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-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:28:03,871 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:28:03,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:28:03,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:28:03,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:28:03,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:28:03,888 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:28:03,890 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:28:03,892 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:28:03,893 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:28:03,894 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:28:03,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:28:03,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:28:03,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:28:03,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:28:03,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:28:03,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:28:03,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:28:03,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:28:03,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:28:03,917 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:28:03,918 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:28:03,920 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:28:03,921 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:28:03,926 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:28:03,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:28:03,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:28:03,929 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:28:03,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:28:03,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:28:03,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:28:03,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:28:03,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:28:03,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:28:03,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:28:03,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:28:03,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:28:03,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:28:03,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:28:03,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:28:03,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:28:03,947 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:03,973 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:28:03,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:28:03,974 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:28:03,974 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:28:03,975 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:28:03,975 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:28:03,975 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:28:03,975 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:28:03,976 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:28:03,976 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:28:03,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:28:03,978 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:28:03,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:28:03,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:28:03,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:28:03,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:28:03,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:28:03,980 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:28:03,980 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:28:03,980 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:28:03,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:28:03,981 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:28:03,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:28:03,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:28:03,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:28:03,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:28:03,982 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:28:03,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:28:03,982 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:28:03,983 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:28:04,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:28:04,040 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:28:04,043 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:28:04,044 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:28:04,045 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:28:04,045 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-1.c [2019-09-20 13:28:04,117 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b1cf5b30/9312b0db5e744a30a1c9bf6f307fcd24/FLAG622df0a5c [2019-09-20 13:28:04,767 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:28:04,768 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.16.i.cil-1.c [2019-09-20 13:28:04,787 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b1cf5b30/9312b0db5e744a30a1c9bf6f307fcd24/FLAG622df0a5c [2019-09-20 13:28:04,968 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b1cf5b30/9312b0db5e744a30a1c9bf6f307fcd24 [2019-09-20 13:28:04,976 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:28:04,978 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:28:04,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:28:04,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:28:04,983 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:28:04,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:28:04" (1/1) ... [2019-09-20 13:28:04,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a6f752c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:04, skipping insertion in model container [2019-09-20 13:28:04,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:28:04" (1/1) ... [2019-09-20 13:28:04,995 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:28:05,078 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:28:05,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:28:05,717 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:28:05,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:28:05,915 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:28:05,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:05 WrapperNode [2019-09-20 13:28:05,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:28:05,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:28:05,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:28:05,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:28:05,938 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:05" (1/1) ... [2019-09-20 13:28:05,939 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:05" (1/1) ... [2019-09-20 13:28:05,970 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:05" (1/1) ... [2019-09-20 13:28:05,971 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:05" (1/1) ... [2019-09-20 13:28:06,052 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:05" (1/1) ... [2019-09-20 13:28:06,063 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:05" (1/1) ... [2019-09-20 13:28:06,068 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:05" (1/1) ... [2019-09-20 13:28:06,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:28:06,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:28:06,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:28:06,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:28:06,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:05" (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:06,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:28:06,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:28:06,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-20 13:28:06,162 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-20 13:28:06,162 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:28:06,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-20 13:28:06,163 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:28:06,163 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:28:06,163 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:28:06,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:28:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:28:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:28:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:28:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:28:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:28:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:28:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-20 13:28:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:28:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-20 13:28:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-20 13:28:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:28:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:28:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:28:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:28:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:28:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:28:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:28:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:28:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:28:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:28:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:28:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:28:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:28:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:28:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:28:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:28:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:28:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:28:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:28:06,660 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:28:07,309 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-20 13:28:07,309 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-20 13:28:07,329 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:28:07,329 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:28:07,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:28:07 BoogieIcfgContainer [2019-09-20 13:28:07,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:28:07,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:28:07,332 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:28:07,335 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:28:07,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:28:04" (1/3) ... [2019-09-20 13:28:07,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9df6822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:28:07, skipping insertion in model container [2019-09-20 13:28:07,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:05" (2/3) ... [2019-09-20 13:28:07,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9df6822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:28:07, skipping insertion in model container [2019-09-20 13:28:07,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:28:07" (3/3) ... [2019-09-20 13:28:07,338 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.16.i.cil-1.c [2019-09-20 13:28:07,349 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:28:07,358 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:28:07,376 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:28:07,406 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:28:07,406 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:28:07,407 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:28:07,407 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:28:07,407 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:28:07,407 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:28:07,407 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:28:07,407 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:28:07,438 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states. [2019-09-20 13:28:07,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-20 13:28:07,459 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:07,461 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] [2019-09-20 13:28:07,463 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:07,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:07,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1765805398, now seen corresponding path program 1 times [2019-09-20 13:28:07,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:07,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:07,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:07,954 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:07,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:07,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:07,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:07,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:07,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:07,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:07,982 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 4 states. [2019-09-20 13:28:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:08,480 INFO L93 Difference]: Finished difference Result 198 states and 326 transitions. [2019-09-20 13:28:08,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:08,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-09-20 13:28:08,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:08,508 INFO L225 Difference]: With dead ends: 198 [2019-09-20 13:28:08,509 INFO L226 Difference]: Without dead ends: 177 [2019-09-20 13:28:08,512 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:08,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-20 13:28:08,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 160. [2019-09-20 13:28:08,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-20 13:28:08,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 248 transitions. [2019-09-20 13:28:08,568 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 248 transitions. Word has length 49 [2019-09-20 13:28:08,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:08,569 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 248 transitions. [2019-09-20 13:28:08,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:08,569 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 248 transitions. [2019-09-20 13:28:08,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:28:08,572 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:08,573 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] [2019-09-20 13:28:08,573 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:08,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:08,573 INFO L82 PathProgramCache]: Analyzing trace with hash 2089385858, now seen corresponding path program 1 times [2019-09-20 13:28:08,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:08,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:08,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:08,747 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:08,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:08,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:08,749 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:08,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:08,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:08,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:08,754 INFO L87 Difference]: Start difference. First operand 160 states and 248 transitions. Second operand 4 states. [2019-09-20 13:28:09,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:09,266 INFO L93 Difference]: Finished difference Result 177 states and 268 transitions. [2019-09-20 13:28:09,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:09,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-20 13:28:09,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:09,268 INFO L225 Difference]: With dead ends: 177 [2019-09-20 13:28:09,269 INFO L226 Difference]: Without dead ends: 177 [2019-09-20 13:28:09,270 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,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-20 13:28:09,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 160. [2019-09-20 13:28:09,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-20 13:28:09,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 247 transitions. [2019-09-20 13:28:09,282 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 247 transitions. Word has length 62 [2019-09-20 13:28:09,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:09,283 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 247 transitions. [2019-09-20 13:28:09,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:09,283 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 247 transitions. [2019-09-20 13:28:09,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:28:09,286 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:09,286 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] [2019-09-20 13:28:09,286 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:09,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:09,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1535183890, now seen corresponding path program 1 times [2019-09-20 13:28:09,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:09,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:09,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:09,427 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:09,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:09,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:09,428 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:09,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:09,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:09,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:09,430 INFO L87 Difference]: Start difference. First operand 160 states and 247 transitions. Second operand 4 states. [2019-09-20 13:28:09,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:09,733 INFO L93 Difference]: Finished difference Result 176 states and 266 transitions. [2019-09-20 13:28:09,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:09,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:28:09,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:09,735 INFO L225 Difference]: With dead ends: 176 [2019-09-20 13:28:09,735 INFO L226 Difference]: Without dead ends: 176 [2019-09-20 13:28:09,736 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,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-20 13:28:09,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 160. [2019-09-20 13:28:09,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-20 13:28:09,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 246 transitions. [2019-09-20 13:28:09,762 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 246 transitions. Word has length 63 [2019-09-20 13:28:09,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:09,762 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 246 transitions. [2019-09-20 13:28:09,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:09,763 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 246 transitions. [2019-09-20 13:28:09,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:28:09,770 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:09,770 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:09,770 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:09,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:09,770 INFO L82 PathProgramCache]: Analyzing trace with hash -872879962, now seen corresponding path program 1 times [2019-09-20 13:28:09,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:09,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:09,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:09,929 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:09,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:09,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:28:09,930 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:09,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:28:09,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:28:09,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:09,931 INFO L87 Difference]: Start difference. First operand 160 states and 246 transitions. Second operand 5 states. [2019-09-20 13:28:10,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,409 INFO L93 Difference]: Finished difference Result 181 states and 274 transitions. [2019-09-20 13:28:10,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:28:10,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-20 13:28:10,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,411 INFO L225 Difference]: With dead ends: 181 [2019-09-20 13:28:10,411 INFO L226 Difference]: Without dead ends: 181 [2019-09-20 13:28:10,412 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:10,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-20 13:28:10,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2019-09-20 13:28:10,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-20 13:28:10,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 273 transitions. [2019-09-20 13:28:10,422 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 273 transitions. Word has length 63 [2019-09-20 13:28:10,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,423 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 273 transitions. [2019-09-20 13:28:10,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:28:10,423 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 273 transitions. [2019-09-20 13:28:10,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:28:10,425 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,425 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] [2019-09-20 13:28:10,425 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,426 INFO L82 PathProgramCache]: Analyzing trace with hash 309686878, now seen corresponding path program 1 times [2019-09-20 13:28:10,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:10,500 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:10,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:10,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:10,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:10,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:10,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:10,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:10,502 INFO L87 Difference]: Start difference. First operand 180 states and 273 transitions. Second operand 4 states. [2019-09-20 13:28:10,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,779 INFO L93 Difference]: Finished difference Result 195 states and 290 transitions. [2019-09-20 13:28:10,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:10,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:28:10,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,781 INFO L225 Difference]: With dead ends: 195 [2019-09-20 13:28:10,781 INFO L226 Difference]: Without dead ends: 195 [2019-09-20 13:28:10,782 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,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-20 13:28:10,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 180. [2019-09-20 13:28:10,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-20 13:28:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 272 transitions. [2019-09-20 13:28:10,788 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 272 transitions. Word has length 63 [2019-09-20 13:28:10,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,789 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 272 transitions. [2019-09-20 13:28:10,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:10,789 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 272 transitions. [2019-09-20 13:28:10,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:28:10,790 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,791 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] [2019-09-20 13:28:10,791 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,791 INFO L82 PathProgramCache]: Analyzing trace with hash 242126877, now seen corresponding path program 1 times [2019-09-20 13:28:10,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:10,858 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:10,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:10,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:10,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:10,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:10,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:10,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:10,861 INFO L87 Difference]: Start difference. First operand 180 states and 272 transitions. Second operand 4 states. [2019-09-20 13:28:11,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:11,146 INFO L93 Difference]: Finished difference Result 193 states and 287 transitions. [2019-09-20 13:28:11,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:11,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:28:11,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:11,148 INFO L225 Difference]: With dead ends: 193 [2019-09-20 13:28:11,148 INFO L226 Difference]: Without dead ends: 193 [2019-09-20 13:28:11,149 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:11,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-20 13:28:11,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 180. [2019-09-20 13:28:11,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-20 13:28:11,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 271 transitions. [2019-09-20 13:28:11,154 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 271 transitions. Word has length 63 [2019-09-20 13:28:11,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:11,155 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 271 transitions. [2019-09-20 13:28:11,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:11,155 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 271 transitions. [2019-09-20 13:28:11,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:28:11,156 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:11,156 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:11,157 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:11,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:11,157 INFO L82 PathProgramCache]: Analyzing trace with hash -303724929, now seen corresponding path program 1 times [2019-09-20 13:28:11,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:11,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:11,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:11,235 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:11,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:11,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:11,236 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:11,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:11,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:11,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:11,238 INFO L87 Difference]: Start difference. First operand 180 states and 271 transitions. Second operand 4 states. [2019-09-20 13:28:11,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:11,518 INFO L93 Difference]: Finished difference Result 193 states and 286 transitions. [2019-09-20 13:28:11,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:11,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:28:11,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:11,521 INFO L225 Difference]: With dead ends: 193 [2019-09-20 13:28:11,521 INFO L226 Difference]: Without dead ends: 193 [2019-09-20 13:28:11,522 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,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-20 13:28:11,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 180. [2019-09-20 13:28:11,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-20 13:28:11,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 270 transitions. [2019-09-20 13:28:11,529 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 270 transitions. Word has length 64 [2019-09-20 13:28:11,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:11,530 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 270 transitions. [2019-09-20 13:28:11,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:11,530 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 270 transitions. [2019-09-20 13:28:11,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:28:11,531 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:11,531 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] [2019-09-20 13:28:11,531 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:11,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:11,532 INFO L82 PathProgramCache]: Analyzing trace with hash -598835814, now seen corresponding path program 1 times [2019-09-20 13:28:11,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:11,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:11,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:11,588 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:11,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:11,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:11,589 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:11,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:11,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:11,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:11,590 INFO L87 Difference]: Start difference. First operand 180 states and 270 transitions. Second operand 4 states. [2019-09-20 13:28:11,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:11,915 INFO L93 Difference]: Finished difference Result 193 states and 285 transitions. [2019-09-20 13:28:11,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:11,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:28:11,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:11,918 INFO L225 Difference]: With dead ends: 193 [2019-09-20 13:28:11,918 INFO L226 Difference]: Without dead ends: 193 [2019-09-20 13:28:11,919 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,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-20 13:28:11,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 180. [2019-09-20 13:28:11,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-20 13:28:11,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 269 transitions. [2019-09-20 13:28:11,925 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 269 transitions. Word has length 65 [2019-09-20 13:28:11,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:11,925 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 269 transitions. [2019-09-20 13:28:11,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:11,925 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 269 transitions. [2019-09-20 13:28:11,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:28:11,926 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:11,927 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] [2019-09-20 13:28:11,927 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:11,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:11,927 INFO L82 PathProgramCache]: Analyzing trace with hash -604400838, now seen corresponding path program 1 times [2019-09-20 13:28:11,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:11,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:11,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:12,008 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:12,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:12,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:12,008 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:12,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:12,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:12,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:12,009 INFO L87 Difference]: Start difference. First operand 180 states and 269 transitions. Second operand 4 states. [2019-09-20 13:28:12,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:12,290 INFO L93 Difference]: Finished difference Result 193 states and 284 transitions. [2019-09-20 13:28:12,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:12,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-20 13:28:12,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:12,292 INFO L225 Difference]: With dead ends: 193 [2019-09-20 13:28:12,292 INFO L226 Difference]: Without dead ends: 193 [2019-09-20 13:28:12,295 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,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-20 13:28:12,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 180. [2019-09-20 13:28:12,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-20 13:28:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 268 transitions. [2019-09-20 13:28:12,301 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 268 transitions. Word has length 66 [2019-09-20 13:28:12,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:12,301 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 268 transitions. [2019-09-20 13:28:12,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:12,303 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 268 transitions. [2019-09-20 13:28:12,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:28:12,304 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:12,305 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] [2019-09-20 13:28:12,305 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:12,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:12,305 INFO L82 PathProgramCache]: Analyzing trace with hash -822498919, now seen corresponding path program 1 times [2019-09-20 13:28:12,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:12,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:12,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:12,386 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:12,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:12,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:12,387 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:12,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:12,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:12,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:12,388 INFO L87 Difference]: Start difference. First operand 180 states and 268 transitions. Second operand 4 states. [2019-09-20 13:28:12,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:12,703 INFO L93 Difference]: Finished difference Result 222 states and 330 transitions. [2019-09-20 13:28:12,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:12,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-20 13:28:12,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:12,706 INFO L225 Difference]: With dead ends: 222 [2019-09-20 13:28:12,706 INFO L226 Difference]: Without dead ends: 222 [2019-09-20 13:28:12,707 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:12,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-20 13:28:12,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2019-09-20 13:28:12,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-20 13:28:12,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 305 transitions. [2019-09-20 13:28:12,713 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 305 transitions. Word has length 66 [2019-09-20 13:28:12,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:12,713 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 305 transitions. [2019-09-20 13:28:12,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:12,714 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 305 transitions. [2019-09-20 13:28:12,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-20 13:28:12,715 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:12,715 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] [2019-09-20 13:28:12,715 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:12,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:12,716 INFO L82 PathProgramCache]: Analyzing trace with hash -223978763, now seen corresponding path program 1 times [2019-09-20 13:28:12,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:12,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:12,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:12,770 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:12,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:12,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:12,771 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:12,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:12,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:12,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:12,772 INFO L87 Difference]: Start difference. First operand 202 states and 305 transitions. Second operand 4 states. [2019-09-20 13:28:13,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:13,017 INFO L93 Difference]: Finished difference Result 205 states and 308 transitions. [2019-09-20 13:28:13,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:13,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-20 13:28:13,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:13,020 INFO L225 Difference]: With dead ends: 205 [2019-09-20 13:28:13,021 INFO L226 Difference]: Without dead ends: 205 [2019-09-20 13:28:13,021 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,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-20 13:28:13,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2019-09-20 13:28:13,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-20 13:28:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 304 transitions. [2019-09-20 13:28:13,027 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 304 transitions. Word has length 67 [2019-09-20 13:28:13,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:13,027 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 304 transitions. [2019-09-20 13:28:13,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:13,027 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 304 transitions. [2019-09-20 13:28:13,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:28:13,028 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:13,029 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] [2019-09-20 13:28:13,029 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:13,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:13,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1269381901, now seen corresponding path program 1 times [2019-09-20 13:28:13,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:13,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:13,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:13,090 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:13,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:13,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:13,091 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:13,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:13,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:13,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:13,092 INFO L87 Difference]: Start difference. First operand 202 states and 304 transitions. Second operand 4 states. [2019-09-20 13:28:13,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:13,465 INFO L93 Difference]: Finished difference Result 222 states and 328 transitions. [2019-09-20 13:28:13,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:13,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:28:13,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:13,467 INFO L225 Difference]: With dead ends: 222 [2019-09-20 13:28:13,467 INFO L226 Difference]: Without dead ends: 222 [2019-09-20 13:28:13,468 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,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-20 13:28:13,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2019-09-20 13:28:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-20 13:28:13,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 303 transitions. [2019-09-20 13:28:13,477 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 303 transitions. Word has length 79 [2019-09-20 13:28:13,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:13,478 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 303 transitions. [2019-09-20 13:28:13,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:13,478 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 303 transitions. [2019-09-20 13:28:13,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:28:13,480 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:13,481 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] [2019-09-20 13:28:13,481 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:13,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:13,482 INFO L82 PathProgramCache]: Analyzing trace with hash -732898547, now seen corresponding path program 1 times [2019-09-20 13:28:13,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:13,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:13,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:13,559 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:13,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:13,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:13,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:13,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:13,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:13,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:13,561 INFO L87 Difference]: Start difference. First operand 202 states and 303 transitions. Second operand 4 states. [2019-09-20 13:28:13,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:13,909 INFO L93 Difference]: Finished difference Result 221 states and 326 transitions. [2019-09-20 13:28:13,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:13,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:28:13,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:13,911 INFO L225 Difference]: With dead ends: 221 [2019-09-20 13:28:13,912 INFO L226 Difference]: Without dead ends: 221 [2019-09-20 13:28:13,912 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,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-20 13:28:13,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 202. [2019-09-20 13:28:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-20 13:28:13,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 302 transitions. [2019-09-20 13:28:13,917 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 302 transitions. Word has length 80 [2019-09-20 13:28:13,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:13,918 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 302 transitions. [2019-09-20 13:28:13,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:13,919 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 302 transitions. [2019-09-20 13:28:13,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:28:13,920 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:13,920 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] [2019-09-20 13:28:13,920 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:13,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:13,920 INFO L82 PathProgramCache]: Analyzing trace with hash -800458548, now seen corresponding path program 1 times [2019-09-20 13:28:13,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:13,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:13,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:14,001 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,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:14,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:14,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:14,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:14,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:14,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:14,003 INFO L87 Difference]: Start difference. First operand 202 states and 302 transitions. Second operand 4 states. [2019-09-20 13:28:14,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:14,296 INFO L93 Difference]: Finished difference Result 219 states and 323 transitions. [2019-09-20 13:28:14,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:14,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:28:14,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:14,298 INFO L225 Difference]: With dead ends: 219 [2019-09-20 13:28:14,299 INFO L226 Difference]: Without dead ends: 219 [2019-09-20 13:28:14,299 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,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-20 13:28:14,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 202. [2019-09-20 13:28:14,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-20 13:28:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 301 transitions. [2019-09-20 13:28:14,309 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 301 transitions. Word has length 80 [2019-09-20 13:28:14,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:14,309 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 301 transitions. [2019-09-20 13:28:14,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:14,309 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 301 transitions. [2019-09-20 13:28:14,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:28:14,310 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:14,310 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] [2019-09-20 13:28:14,311 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:14,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:14,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1735865264, now seen corresponding path program 1 times [2019-09-20 13:28:14,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:14,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:14,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:14,390 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:14,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:14,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:14,391 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:14,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:14,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:14,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:14,392 INFO L87 Difference]: Start difference. First operand 202 states and 301 transitions. Second operand 4 states. [2019-09-20 13:28:14,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:14,822 INFO L93 Difference]: Finished difference Result 219 states and 322 transitions. [2019-09-20 13:28:14,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:14,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:28:14,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:14,825 INFO L225 Difference]: With dead ends: 219 [2019-09-20 13:28:14,825 INFO L226 Difference]: Without dead ends: 219 [2019-09-20 13:28:14,826 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:14,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-20 13:28:14,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 202. [2019-09-20 13:28:14,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-20 13:28:14,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 300 transitions. [2019-09-20 13:28:14,835 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 300 transitions. Word has length 81 [2019-09-20 13:28:14,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:14,835 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 300 transitions. [2019-09-20 13:28:14,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:14,835 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 300 transitions. [2019-09-20 13:28:14,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-20 13:28:14,836 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:14,837 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] [2019-09-20 13:28:14,837 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:14,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:14,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1796049271, now seen corresponding path program 1 times [2019-09-20 13:28:14,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:14,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:14,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:14,904 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:14,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:14,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:14,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:14,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:14,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:14,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:14,908 INFO L87 Difference]: Start difference. First operand 202 states and 300 transitions. Second operand 4 states. [2019-09-20 13:28:15,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:15,276 INFO L93 Difference]: Finished difference Result 219 states and 321 transitions. [2019-09-20 13:28:15,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:15,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-20 13:28:15,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:15,279 INFO L225 Difference]: With dead ends: 219 [2019-09-20 13:28:15,280 INFO L226 Difference]: Without dead ends: 219 [2019-09-20 13:28:15,280 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,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-20 13:28:15,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 202. [2019-09-20 13:28:15,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-20 13:28:15,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 299 transitions. [2019-09-20 13:28:15,289 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 299 transitions. Word has length 82 [2019-09-20 13:28:15,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:15,291 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 299 transitions. [2019-09-20 13:28:15,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:15,291 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 299 transitions. [2019-09-20 13:28:15,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:28:15,293 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:15,293 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] [2019-09-20 13:28:15,294 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:15,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:15,294 INFO L82 PathProgramCache]: Analyzing trace with hash 936687659, now seen corresponding path program 1 times [2019-09-20 13:28:15,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:15,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:15,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:15,379 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:15,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:15,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:15,380 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:15,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:15,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:15,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:15,381 INFO L87 Difference]: Start difference. First operand 202 states and 299 transitions. Second operand 4 states. [2019-09-20 13:28:15,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:15,754 INFO L93 Difference]: Finished difference Result 219 states and 320 transitions. [2019-09-20 13:28:15,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:15,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-20 13:28:15,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:15,756 INFO L225 Difference]: With dead ends: 219 [2019-09-20 13:28:15,756 INFO L226 Difference]: Without dead ends: 219 [2019-09-20 13:28:15,757 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,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-20 13:28:15,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 202. [2019-09-20 13:28:15,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-20 13:28:15,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 298 transitions. [2019-09-20 13:28:15,763 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 298 transitions. Word has length 83 [2019-09-20 13:28:15,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:15,764 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 298 transitions. [2019-09-20 13:28:15,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:15,764 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 298 transitions. [2019-09-20 13:28:15,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-20 13:28:15,765 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:15,765 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] [2019-09-20 13:28:15,765 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:15,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:15,766 INFO L82 PathProgramCache]: Analyzing trace with hash 305124388, now seen corresponding path program 1 times [2019-09-20 13:28:15,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:15,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:15,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:15,855 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:15,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:15,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:15,856 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:15,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:15,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:15,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:15,857 INFO L87 Difference]: Start difference. First operand 202 states and 298 transitions. Second operand 4 states. [2019-09-20 13:28:16,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:16,134 INFO L93 Difference]: Finished difference Result 209 states and 307 transitions. [2019-09-20 13:28:16,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:16,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-20 13:28:16,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:16,136 INFO L225 Difference]: With dead ends: 209 [2019-09-20 13:28:16,136 INFO L226 Difference]: Without dead ends: 209 [2019-09-20 13:28:16,136 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,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-20 13:28:16,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 202. [2019-09-20 13:28:16,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-20 13:28:16,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 297 transitions. [2019-09-20 13:28:16,142 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 297 transitions. Word has length 84 [2019-09-20 13:28:16,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:16,142 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 297 transitions. [2019-09-20 13:28:16,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:16,143 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 297 transitions. [2019-09-20 13:28:16,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-20 13:28:16,144 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:16,144 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:16,144 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:16,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:16,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1695196548, now seen corresponding path program 1 times [2019-09-20 13:28:16,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:16,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:16,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:16,216 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:16,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:16,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:16,217 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:16,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:16,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:16,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:16,218 INFO L87 Difference]: Start difference. First operand 202 states and 297 transitions. Second operand 4 states. [2019-09-20 13:28:16,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:16,760 INFO L93 Difference]: Finished difference Result 314 states and 470 transitions. [2019-09-20 13:28:16,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:16,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-20 13:28:16,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:16,762 INFO L225 Difference]: With dead ends: 314 [2019-09-20 13:28:16,762 INFO L226 Difference]: Without dead ends: 314 [2019-09-20 13:28:16,763 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:16,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-20 13:28:16,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 243. [2019-09-20 13:28:16,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-09-20 13:28:16,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 370 transitions. [2019-09-20 13:28:16,771 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 370 transitions. Word has length 88 [2019-09-20 13:28:16,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:16,771 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 370 transitions. [2019-09-20 13:28:16,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:16,771 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 370 transitions. [2019-09-20 13:28:16,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-20 13:28:16,772 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:16,773 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:16,773 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:16,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:16,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1271549826, now seen corresponding path program 1 times [2019-09-20 13:28:16,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:16,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:16,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:16,842 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:16,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:16,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:16,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:16,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:16,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:16,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:16,844 INFO L87 Difference]: Start difference. First operand 243 states and 370 transitions. Second operand 4 states. [2019-09-20 13:28:17,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:17,171 INFO L93 Difference]: Finished difference Result 292 states and 443 transitions. [2019-09-20 13:28:17,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:17,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-20 13:28:17,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:17,174 INFO L225 Difference]: With dead ends: 292 [2019-09-20 13:28:17,174 INFO L226 Difference]: Without dead ends: 292 [2019-09-20 13:28:17,175 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,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-20 13:28:17,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 267. [2019-09-20 13:28:17,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-09-20 13:28:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 411 transitions. [2019-09-20 13:28:17,182 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 411 transitions. Word has length 88 [2019-09-20 13:28:17,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:17,183 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 411 transitions. [2019-09-20 13:28:17,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:17,183 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 411 transitions. [2019-09-20 13:28:17,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-20 13:28:17,184 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:17,184 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:17,185 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:17,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:17,185 INFO L82 PathProgramCache]: Analyzing trace with hash 130094744, now seen corresponding path program 1 times [2019-09-20 13:28:17,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:17,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:17,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:17,266 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,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:17,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:17,267 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:17,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:17,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:17,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:17,269 INFO L87 Difference]: Start difference. First operand 267 states and 411 transitions. Second operand 4 states. [2019-09-20 13:28:17,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:17,738 INFO L93 Difference]: Finished difference Result 330 states and 499 transitions. [2019-09-20 13:28:17,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:17,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-20 13:28:17,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:17,742 INFO L225 Difference]: With dead ends: 330 [2019-09-20 13:28:17,742 INFO L226 Difference]: Without dead ends: 330 [2019-09-20 13:28:17,743 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,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-20 13:28:17,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 268. [2019-09-20 13:28:17,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-20 13:28:17,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 412 transitions. [2019-09-20 13:28:17,753 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 412 transitions. Word has length 89 [2019-09-20 13:28:17,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:17,753 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 412 transitions. [2019-09-20 13:28:17,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:17,753 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 412 transitions. [2019-09-20 13:28:17,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-20 13:28:17,756 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:17,756 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] [2019-09-20 13:28:17,756 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:17,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:17,757 INFO L82 PathProgramCache]: Analyzing trace with hash 981654768, now seen corresponding path program 1 times [2019-09-20 13:28:17,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:17,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:17,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:17,858 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:17,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:17,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:17,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:17,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:17,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:17,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:17,860 INFO L87 Difference]: Start difference. First operand 268 states and 412 transitions. Second operand 4 states. [2019-09-20 13:28:18,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:18,290 INFO L93 Difference]: Finished difference Result 330 states and 498 transitions. [2019-09-20 13:28:18,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:18,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-20 13:28:18,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:18,295 INFO L225 Difference]: With dead ends: 330 [2019-09-20 13:28:18,295 INFO L226 Difference]: Without dead ends: 330 [2019-09-20 13:28:18,295 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,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-20 13:28:18,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 268. [2019-09-20 13:28:18,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-20 13:28:18,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 411 transitions. [2019-09-20 13:28:18,303 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 411 transitions. Word has length 101 [2019-09-20 13:28:18,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:18,303 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 411 transitions. [2019-09-20 13:28:18,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:18,303 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 411 transitions. [2019-09-20 13:28:18,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-20 13:28:18,304 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:18,305 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] [2019-09-20 13:28:18,305 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:18,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:18,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1857673774, now seen corresponding path program 1 times [2019-09-20 13:28:18,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:18,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:18,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:18,392 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,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:18,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:18,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:18,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:18,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:18,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:18,394 INFO L87 Difference]: Start difference. First operand 268 states and 411 transitions. Second operand 4 states. [2019-09-20 13:28:18,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:18,716 INFO L93 Difference]: Finished difference Result 293 states and 442 transitions. [2019-09-20 13:28:18,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:18,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-20 13:28:18,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:18,719 INFO L225 Difference]: With dead ends: 293 [2019-09-20 13:28:18,719 INFO L226 Difference]: Without dead ends: 293 [2019-09-20 13:28:18,719 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:18,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-20 13:28:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 268. [2019-09-20 13:28:18,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-20 13:28:18,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 410 transitions. [2019-09-20 13:28:18,729 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 410 transitions. Word has length 101 [2019-09-20 13:28:18,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:18,730 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 410 transitions. [2019-09-20 13:28:18,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:18,730 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 410 transitions. [2019-09-20 13:28:18,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:28:18,732 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:18,732 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] [2019-09-20 13:28:18,733 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:18,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:18,733 INFO L82 PathProgramCache]: Analyzing trace with hash 329761456, now seen corresponding path program 1 times [2019-09-20 13:28:18,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:18,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:18,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:18,806 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:18,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:18,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:18,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:18,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:18,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:18,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:18,810 INFO L87 Difference]: Start difference. First operand 268 states and 410 transitions. Second operand 4 states. [2019-09-20 13:28:19,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:19,293 INFO L93 Difference]: Finished difference Result 329 states and 495 transitions. [2019-09-20 13:28:19,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:19,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:28:19,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:19,296 INFO L225 Difference]: With dead ends: 329 [2019-09-20 13:28:19,296 INFO L226 Difference]: Without dead ends: 329 [2019-09-20 13:28:19,296 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,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-09-20 13:28:19,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 268. [2019-09-20 13:28:19,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-20 13:28:19,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 409 transitions. [2019-09-20 13:28:19,304 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 409 transitions. Word has length 102 [2019-09-20 13:28:19,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:19,305 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 409 transitions. [2019-09-20 13:28:19,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:19,305 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 409 transitions. [2019-09-20 13:28:19,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:28:19,306 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:19,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] [2019-09-20 13:28:19,307 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:19,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:19,309 INFO L82 PathProgramCache]: Analyzing trace with hash 262201455, now seen corresponding path program 1 times [2019-09-20 13:28:19,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:19,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:19,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:19,372 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:19,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:19,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:19,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:19,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:19,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:19,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:19,374 INFO L87 Difference]: Start difference. First operand 268 states and 409 transitions. Second operand 4 states. [2019-09-20 13:28:19,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:19,786 INFO L93 Difference]: Finished difference Result 327 states and 492 transitions. [2019-09-20 13:28:19,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:19,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:28:19,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:19,789 INFO L225 Difference]: With dead ends: 327 [2019-09-20 13:28:19,789 INFO L226 Difference]: Without dead ends: 327 [2019-09-20 13:28:19,789 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,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-20 13:28:19,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2019-09-20 13:28:19,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-20 13:28:19,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 408 transitions. [2019-09-20 13:28:19,796 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 408 transitions. Word has length 102 [2019-09-20 13:28:19,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:19,796 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 408 transitions. [2019-09-20 13:28:19,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:19,797 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 408 transitions. [2019-09-20 13:28:19,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:28:19,802 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:19,802 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] [2019-09-20 13:28:19,802 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:19,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:19,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1716546866, now seen corresponding path program 1 times [2019-09-20 13:28:19,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:19,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:19,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:19,887 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,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:19,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:19,888 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:19,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:19,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:19,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:19,889 INFO L87 Difference]: Start difference. First operand 268 states and 408 transitions. Second operand 4 states. [2019-09-20 13:28:20,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:20,214 INFO L93 Difference]: Finished difference Result 292 states and 438 transitions. [2019-09-20 13:28:20,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:20,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:28:20,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:20,216 INFO L225 Difference]: With dead ends: 292 [2019-09-20 13:28:20,216 INFO L226 Difference]: Without dead ends: 292 [2019-09-20 13:28:20,217 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,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-20 13:28:20,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 268. [2019-09-20 13:28:20,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-20 13:28:20,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 407 transitions. [2019-09-20 13:28:20,223 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 407 transitions. Word has length 102 [2019-09-20 13:28:20,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:20,224 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 407 transitions. [2019-09-20 13:28:20,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:20,224 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 407 transitions. [2019-09-20 13:28:20,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:28:20,225 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:20,225 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] [2019-09-20 13:28:20,225 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:20,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:20,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1648986865, now seen corresponding path program 1 times [2019-09-20 13:28:20,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:20,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:20,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:20,285 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,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:20,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:20,286 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:20,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:20,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:20,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:20,287 INFO L87 Difference]: Start difference. First operand 268 states and 407 transitions. Second operand 4 states. [2019-09-20 13:28:20,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:20,580 INFO L93 Difference]: Finished difference Result 290 states and 435 transitions. [2019-09-20 13:28:20,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:20,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:28:20,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:20,583 INFO L225 Difference]: With dead ends: 290 [2019-09-20 13:28:20,583 INFO L226 Difference]: Without dead ends: 290 [2019-09-20 13:28:20,583 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,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-20 13:28:20,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 268. [2019-09-20 13:28:20,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-20 13:28:20,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 406 transitions. [2019-09-20 13:28:20,589 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 406 transitions. Word has length 102 [2019-09-20 13:28:20,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:20,589 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 406 transitions. [2019-09-20 13:28:20,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:20,590 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 406 transitions. [2019-09-20 13:28:20,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:28:20,591 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:20,591 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] [2019-09-20 13:28:20,591 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:20,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:20,591 INFO L82 PathProgramCache]: Analyzing trace with hash 318586989, now seen corresponding path program 1 times [2019-09-20 13:28:20,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:20,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:20,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:20,645 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:20,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:20,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:20,646 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:20,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:20,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:20,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:20,647 INFO L87 Difference]: Start difference. First operand 268 states and 406 transitions. Second operand 4 states. [2019-09-20 13:28:21,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:21,035 INFO L93 Difference]: Finished difference Result 327 states and 489 transitions. [2019-09-20 13:28:21,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:21,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:28:21,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:21,038 INFO L225 Difference]: With dead ends: 327 [2019-09-20 13:28:21,038 INFO L226 Difference]: Without dead ends: 327 [2019-09-20 13:28:21,038 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,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-20 13:28:21,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2019-09-20 13:28:21,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-20 13:28:21,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 405 transitions. [2019-09-20 13:28:21,045 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 405 transitions. Word has length 103 [2019-09-20 13:28:21,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:21,045 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 405 transitions. [2019-09-20 13:28:21,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 405 transitions. [2019-09-20 13:28:21,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:28:21,047 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:21,047 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] [2019-09-20 13:28:21,047 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:21,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:21,048 INFO L82 PathProgramCache]: Analyzing trace with hash 359261739, now seen corresponding path program 1 times [2019-09-20 13:28:21,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:21,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:21,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:21,113 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,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:21,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:21,114 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:21,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:21,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:21,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:21,116 INFO L87 Difference]: Start difference. First operand 268 states and 405 transitions. Second operand 4 states. [2019-09-20 13:28:21,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:21,401 INFO L93 Difference]: Finished difference Result 290 states and 433 transitions. [2019-09-20 13:28:21,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:21,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:28:21,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:21,406 INFO L225 Difference]: With dead ends: 290 [2019-09-20 13:28:21,406 INFO L226 Difference]: Without dead ends: 290 [2019-09-20 13:28:21,407 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,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-20 13:28:21,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 268. [2019-09-20 13:28:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-20 13:28:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 404 transitions. [2019-09-20 13:28:21,413 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 404 transitions. Word has length 103 [2019-09-20 13:28:21,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:21,413 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 404 transitions. [2019-09-20 13:28:21,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 404 transitions. [2019-09-20 13:28:21,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:28:21,415 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:21,415 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] [2019-09-20 13:28:21,415 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:21,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:21,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1512964460, now seen corresponding path program 1 times [2019-09-20 13:28:21,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:21,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:21,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:21,480 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:21,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:21,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:21,481 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:21,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:21,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:21,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:21,482 INFO L87 Difference]: Start difference. First operand 268 states and 404 transitions. Second operand 4 states. [2019-09-20 13:28:21,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:21,919 INFO L93 Difference]: Finished difference Result 327 states and 487 transitions. [2019-09-20 13:28:21,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:21,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:28:21,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:21,922 INFO L225 Difference]: With dead ends: 327 [2019-09-20 13:28:21,922 INFO L226 Difference]: Without dead ends: 327 [2019-09-20 13:28:21,922 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,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-20 13:28:21,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2019-09-20 13:28:21,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-20 13:28:21,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 403 transitions. [2019-09-20 13:28:21,931 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 403 transitions. Word has length 104 [2019-09-20 13:28:21,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:21,932 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 403 transitions. [2019-09-20 13:28:21,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:21,932 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 403 transitions. [2019-09-20 13:28:21,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:28:21,934 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:21,934 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] [2019-09-20 13:28:21,935 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:21,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:21,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1521085586, now seen corresponding path program 1 times [2019-09-20 13:28:21,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:21,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:21,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:22,037 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,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:22,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:22,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:22,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:22,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:22,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:22,039 INFO L87 Difference]: Start difference. First operand 268 states and 403 transitions. Second operand 4 states. [2019-09-20 13:28:22,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:22,323 INFO L93 Difference]: Finished difference Result 290 states and 431 transitions. [2019-09-20 13:28:22,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:22,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:28:22,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:22,326 INFO L225 Difference]: With dead ends: 290 [2019-09-20 13:28:22,326 INFO L226 Difference]: Without dead ends: 290 [2019-09-20 13:28:22,326 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,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-20 13:28:22,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 268. [2019-09-20 13:28:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-20 13:28:22,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 402 transitions. [2019-09-20 13:28:22,332 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 402 transitions. Word has length 104 [2019-09-20 13:28:22,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:22,332 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 402 transitions. [2019-09-20 13:28:22,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:22,333 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 402 transitions. [2019-09-20 13:28:22,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:28:22,334 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:22,334 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] [2019-09-20 13:28:22,334 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:22,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:22,335 INFO L82 PathProgramCache]: Analyzing trace with hash 436898216, now seen corresponding path program 1 times [2019-09-20 13:28:22,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:22,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:22,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:22,399 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:22,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:22,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:22,400 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:22,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:22,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:22,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:22,401 INFO L87 Difference]: Start difference. First operand 268 states and 402 transitions. Second operand 4 states. [2019-09-20 13:28:22,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:22,782 INFO L93 Difference]: Finished difference Result 327 states and 485 transitions. [2019-09-20 13:28:22,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:22,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:28:22,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:22,783 INFO L225 Difference]: With dead ends: 327 [2019-09-20 13:28:22,783 INFO L226 Difference]: Without dead ends: 327 [2019-09-20 13:28:22,784 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,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-20 13:28:22,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2019-09-20 13:28:22,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-20 13:28:22,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 401 transitions. [2019-09-20 13:28:22,791 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 401 transitions. Word has length 105 [2019-09-20 13:28:22,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:22,791 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 401 transitions. [2019-09-20 13:28:22,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 401 transitions. [2019-09-20 13:28:22,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:28:22,792 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:22,793 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] [2019-09-20 13:28:22,793 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:22,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:22,793 INFO L82 PathProgramCache]: Analyzing trace with hash 870627302, now seen corresponding path program 1 times [2019-09-20 13:28:22,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:22,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:22,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:22,862 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:22,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:22,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:22,864 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:22,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:22,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:22,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:22,867 INFO L87 Difference]: Start difference. First operand 268 states and 401 transitions. Second operand 4 states. [2019-09-20 13:28:23,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:23,166 INFO L93 Difference]: Finished difference Result 290 states and 429 transitions. [2019-09-20 13:28:23,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:23,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:28:23,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:23,169 INFO L225 Difference]: With dead ends: 290 [2019-09-20 13:28:23,169 INFO L226 Difference]: Without dead ends: 290 [2019-09-20 13:28:23,170 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:23,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-20 13:28:23,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 268. [2019-09-20 13:28:23,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-20 13:28:23,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 400 transitions. [2019-09-20 13:28:23,175 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 400 transitions. Word has length 105 [2019-09-20 13:28:23,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:23,176 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 400 transitions. [2019-09-20 13:28:23,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:23,176 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 400 transitions. [2019-09-20 13:28:23,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:28:23,177 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:23,177 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] [2019-09-20 13:28:23,177 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:23,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:23,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1991520839, now seen corresponding path program 1 times [2019-09-20 13:28:23,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:23,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:23,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:23,244 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:23,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:23,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:23,245 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:23,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:23,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:23,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:23,246 INFO L87 Difference]: Start difference. First operand 268 states and 400 transitions. Second operand 4 states. [2019-09-20 13:28:23,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:23,624 INFO L93 Difference]: Finished difference Result 317 states and 471 transitions. [2019-09-20 13:28:23,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:23,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:28:23,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:23,628 INFO L225 Difference]: With dead ends: 317 [2019-09-20 13:28:23,628 INFO L226 Difference]: Without dead ends: 317 [2019-09-20 13:28:23,629 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,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-09-20 13:28:23,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 268. [2019-09-20 13:28:23,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-20 13:28:23,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 399 transitions. [2019-09-20 13:28:23,634 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 399 transitions. Word has length 106 [2019-09-20 13:28:23,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:23,635 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 399 transitions. [2019-09-20 13:28:23,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:23,635 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 399 transitions. [2019-09-20 13:28:23,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:28:23,636 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:23,636 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] [2019-09-20 13:28:23,637 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:23,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:23,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1742746679, now seen corresponding path program 1 times [2019-09-20 13:28:23,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:23,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:23,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:23,704 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:23,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:23,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:23,704 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:23,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:23,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:23,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:23,705 INFO L87 Difference]: Start difference. First operand 268 states and 399 transitions. Second operand 4 states. [2019-09-20 13:28:23,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:23,982 INFO L93 Difference]: Finished difference Result 280 states and 415 transitions. [2019-09-20 13:28:23,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:23,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:28:23,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:23,985 INFO L225 Difference]: With dead ends: 280 [2019-09-20 13:28:23,985 INFO L226 Difference]: Without dead ends: 280 [2019-09-20 13:28:23,986 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,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-20 13:28:23,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 268. [2019-09-20 13:28:23,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-20 13:28:23,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 398 transitions. [2019-09-20 13:28:23,995 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 398 transitions. Word has length 106 [2019-09-20 13:28:23,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:23,995 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 398 transitions. [2019-09-20 13:28:23,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:23,995 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 398 transitions. [2019-09-20 13:28:23,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-20 13:28:23,996 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:23,996 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:23,997 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:23,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:23,997 INFO L82 PathProgramCache]: Analyzing trace with hash -214368275, now seen corresponding path program 1 times [2019-09-20 13:28:23,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:23,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:23,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:24,105 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:24,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:24,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:24,107 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:24,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:24,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:24,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:24,108 INFO L87 Difference]: Start difference. First operand 268 states and 398 transitions. Second operand 4 states. [2019-09-20 13:28:24,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:24,498 INFO L93 Difference]: Finished difference Result 317 states and 469 transitions. [2019-09-20 13:28:24,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:24,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-20 13:28:24,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:24,500 INFO L225 Difference]: With dead ends: 317 [2019-09-20 13:28:24,500 INFO L226 Difference]: Without dead ends: 317 [2019-09-20 13:28:24,500 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,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-09-20 13:28:24,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 268. [2019-09-20 13:28:24,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-20 13:28:24,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 397 transitions. [2019-09-20 13:28:24,505 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 397 transitions. Word has length 110 [2019-09-20 13:28:24,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:24,506 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 397 transitions. [2019-09-20 13:28:24,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:24,506 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 397 transitions. [2019-09-20 13:28:24,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-20 13:28:24,507 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:24,507 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:24,507 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:24,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:24,508 INFO L82 PathProgramCache]: Analyzing trace with hash -631764881, now seen corresponding path program 1 times [2019-09-20 13:28:24,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:24,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:24,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:24,580 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:24,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:24,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:24,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:24,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:24,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:24,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:24,582 INFO L87 Difference]: Start difference. First operand 268 states and 397 transitions. Second operand 4 states. [2019-09-20 13:28:24,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:24,911 INFO L93 Difference]: Finished difference Result 321 states and 477 transitions. [2019-09-20 13:28:24,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:24,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-20 13:28:24,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:24,916 INFO L225 Difference]: With dead ends: 321 [2019-09-20 13:28:24,917 INFO L226 Difference]: Without dead ends: 321 [2019-09-20 13:28:24,918 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:24,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-09-20 13:28:24,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 294. [2019-09-20 13:28:24,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-20 13:28:24,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 442 transitions. [2019-09-20 13:28:24,927 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 442 transitions. Word has length 110 [2019-09-20 13:28:24,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:24,929 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 442 transitions. [2019-09-20 13:28:24,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:24,930 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 442 transitions. [2019-09-20 13:28:24,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-20 13:28:24,932 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:24,932 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,932 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:24,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:24,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1079792269, now seen corresponding path program 1 times [2019-09-20 13:28:24,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:24,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:24,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:25,016 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:25,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:25,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:25,017 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:25,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:25,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:25,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:25,018 INFO L87 Difference]: Start difference. First operand 294 states and 442 transitions. Second operand 4 states. [2019-09-20 13:28:25,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:25,443 INFO L93 Difference]: Finished difference Result 343 states and 513 transitions. [2019-09-20 13:28:25,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:25,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-09-20 13:28:25,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:25,446 INFO L225 Difference]: With dead ends: 343 [2019-09-20 13:28:25,446 INFO L226 Difference]: Without dead ends: 343 [2019-09-20 13:28:25,446 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,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-09-20 13:28:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 294. [2019-09-20 13:28:25,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-20 13:28:25,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 441 transitions. [2019-09-20 13:28:25,453 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 441 transitions. Word has length 113 [2019-09-20 13:28:25,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:25,453 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 441 transitions. [2019-09-20 13:28:25,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:25,454 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 441 transitions. [2019-09-20 13:28:25,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-20 13:28:25,455 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:25,455 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,455 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:25,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:25,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1649875916, now seen corresponding path program 1 times [2019-09-20 13:28:25,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:25,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:25,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:25,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:25,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:25,535 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:25,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:25,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:25,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:25,536 INFO L87 Difference]: Start difference. First operand 294 states and 441 transitions. Second operand 4 states. [2019-09-20 13:28:25,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:25,938 INFO L93 Difference]: Finished difference Result 335 states and 499 transitions. [2019-09-20 13:28:25,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:25,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-20 13:28:25,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:25,941 INFO L225 Difference]: With dead ends: 335 [2019-09-20 13:28:25,941 INFO L226 Difference]: Without dead ends: 335 [2019-09-20 13:28:25,942 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,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-09-20 13:28:25,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 294. [2019-09-20 13:28:25,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-20 13:28:25,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 440 transitions. [2019-09-20 13:28:25,948 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 440 transitions. Word has length 114 [2019-09-20 13:28:25,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:25,949 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 440 transitions. [2019-09-20 13:28:25,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:25,949 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 440 transitions. [2019-09-20 13:28:25,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-20 13:28:25,952 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:25,952 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,953 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:25,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:25,953 INFO L82 PathProgramCache]: Analyzing trace with hash 365337133, now seen corresponding path program 1 times [2019-09-20 13:28:25,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:25,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:25,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:26,030 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:26,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:26,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:26,031 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:26,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:26,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:26,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:26,032 INFO L87 Difference]: Start difference. First operand 294 states and 440 transitions. Second operand 4 states. [2019-09-20 13:28:26,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:26,388 INFO L93 Difference]: Finished difference Result 335 states and 498 transitions. [2019-09-20 13:28:26,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:26,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-09-20 13:28:26,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:26,390 INFO L225 Difference]: With dead ends: 335 [2019-09-20 13:28:26,391 INFO L226 Difference]: Without dead ends: 335 [2019-09-20 13:28:26,391 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:26,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-09-20 13:28:26,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 294. [2019-09-20 13:28:26,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-20 13:28:26,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 439 transitions. [2019-09-20 13:28:26,397 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 439 transitions. Word has length 115 [2019-09-20 13:28:26,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:26,397 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 439 transitions. [2019-09-20 13:28:26,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:26,398 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 439 transitions. [2019-09-20 13:28:26,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-20 13:28:26,399 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:26,399 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,399 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:26,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:26,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1808480386, now seen corresponding path program 1 times [2019-09-20 13:28:26,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:26,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:26,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:26,496 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:26,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:26,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:26,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:26,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:26,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:26,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:26,498 INFO L87 Difference]: Start difference. First operand 294 states and 439 transitions. Second operand 4 states. [2019-09-20 13:28:26,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:26,901 INFO L93 Difference]: Finished difference Result 335 states and 497 transitions. [2019-09-20 13:28:26,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:26,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-20 13:28:26,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:26,904 INFO L225 Difference]: With dead ends: 335 [2019-09-20 13:28:26,904 INFO L226 Difference]: Without dead ends: 335 [2019-09-20 13:28:26,905 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:26,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-09-20 13:28:26,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 294. [2019-09-20 13:28:26,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-20 13:28:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 438 transitions. [2019-09-20 13:28:26,911 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 438 transitions. Word has length 116 [2019-09-20 13:28:26,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:26,912 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 438 transitions. [2019-09-20 13:28:26,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:26,912 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 438 transitions. [2019-09-20 13:28:26,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-20 13:28:26,913 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:26,913 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,913 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:26,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:26,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1131758348, now seen corresponding path program 1 times [2019-09-20 13:28:26,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:26,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:26,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:26,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:26,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:26,995 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:26,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:26,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:26,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:26,996 INFO L87 Difference]: Start difference. First operand 294 states and 438 transitions. Second operand 4 states. [2019-09-20 13:28:27,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:27,355 INFO L93 Difference]: Finished difference Result 333 states and 494 transitions. [2019-09-20 13:28:27,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:27,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-20 13:28:27,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:27,358 INFO L225 Difference]: With dead ends: 333 [2019-09-20 13:28:27,358 INFO L226 Difference]: Without dead ends: 333 [2019-09-20 13:28:27,358 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:27,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-09-20 13:28:27,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 294. [2019-09-20 13:28:27,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-20 13:28:27,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 437 transitions. [2019-09-20 13:28:27,365 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 437 transitions. Word has length 116 [2019-09-20 13:28:27,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:27,365 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 437 transitions. [2019-09-20 13:28:27,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:27,365 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 437 transitions. [2019-09-20 13:28:27,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-20 13:28:27,367 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:27,367 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,367 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:27,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:27,367 INFO L82 PathProgramCache]: Analyzing trace with hash 110289475, now seen corresponding path program 1 times [2019-09-20 13:28:27,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:27,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:27,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:27,440 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:27,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:27,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:27,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:27,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:27,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:27,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:27,442 INFO L87 Difference]: Start difference. First operand 294 states and 437 transitions. Second operand 4 states. [2019-09-20 13:28:27,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:27,760 INFO L93 Difference]: Finished difference Result 331 states and 490 transitions. [2019-09-20 13:28:27,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:27,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-09-20 13:28:27,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:27,763 INFO L225 Difference]: With dead ends: 331 [2019-09-20 13:28:27,763 INFO L226 Difference]: Without dead ends: 331 [2019-09-20 13:28:27,764 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:27,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-20 13:28:27,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 294. [2019-09-20 13:28:27,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-20 13:28:27,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 436 transitions. [2019-09-20 13:28:27,769 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 436 transitions. Word has length 117 [2019-09-20 13:28:27,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:27,770 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 436 transitions. [2019-09-20 13:28:27,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:27,770 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 436 transitions. [2019-09-20 13:28:27,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-20 13:28:27,771 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:27,771 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,771 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:27,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:27,772 INFO L82 PathProgramCache]: Analyzing trace with hash 656255755, now seen corresponding path program 1 times [2019-09-20 13:28:27,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:27,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:27,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:27,843 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:27,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:27,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:27,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:27,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:27,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:27,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:27,844 INFO L87 Difference]: Start difference. First operand 294 states and 436 transitions. Second operand 4 states. [2019-09-20 13:28:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:28,162 INFO L93 Difference]: Finished difference Result 328 states and 485 transitions. [2019-09-20 13:28:28,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:28,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-09-20 13:28:28,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:28,165 INFO L225 Difference]: With dead ends: 328 [2019-09-20 13:28:28,165 INFO L226 Difference]: Without dead ends: 328 [2019-09-20 13:28:28,166 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:28,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-20 13:28:28,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 294. [2019-09-20 13:28:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-20 13:28:28,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 435 transitions. [2019-09-20 13:28:28,171 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 435 transitions. Word has length 117 [2019-09-20 13:28:28,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:28,171 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 435 transitions. [2019-09-20 13:28:28,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:28,171 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 435 transitions. [2019-09-20 13:28:28,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-20 13:28:28,172 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:28,173 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,173 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:28,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:28,173 INFO L82 PathProgramCache]: Analyzing trace with hash 775115364, now seen corresponding path program 1 times [2019-09-20 13:28:28,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:28,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:28,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:28,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:28,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:28,247 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:28,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:28,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:28,248 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:28,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:28,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:28,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:28,249 INFO L87 Difference]: Start difference. First operand 294 states and 435 transitions. Second operand 4 states. [2019-09-20 13:28:28,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:28,585 INFO L93 Difference]: Finished difference Result 328 states and 484 transitions. [2019-09-20 13:28:28,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:28,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-09-20 13:28:28,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:28,587 INFO L225 Difference]: With dead ends: 328 [2019-09-20 13:28:28,588 INFO L226 Difference]: Without dead ends: 328 [2019-09-20 13:28:28,588 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:28,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-20 13:28:28,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 294. [2019-09-20 13:28:28,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-20 13:28:28,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 434 transitions. [2019-09-20 13:28:28,593 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 434 transitions. Word has length 120 [2019-09-20 13:28:28,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:28,593 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 434 transitions. [2019-09-20 13:28:28,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:28,594 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 434 transitions. [2019-09-20 13:28:28,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-20 13:28:28,595 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:28,595 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,595 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:28,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:28,595 INFO L82 PathProgramCache]: Analyzing trace with hash -82969504, now seen corresponding path program 1 times [2019-09-20 13:28:28,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:28,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:28,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:28,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:28,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:28,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:28,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:28,663 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:28,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:28,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:28,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:28,664 INFO L87 Difference]: Start difference. First operand 294 states and 434 transitions. Second operand 4 states. [2019-09-20 13:28:29,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:29,021 INFO L93 Difference]: Finished difference Result 322 states and 474 transitions. [2019-09-20 13:28:29,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:29,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-20 13:28:29,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:29,023 INFO L225 Difference]: With dead ends: 322 [2019-09-20 13:28:29,023 INFO L226 Difference]: Without dead ends: 322 [2019-09-20 13:28:29,024 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:29,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-20 13:28:29,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 294. [2019-09-20 13:28:29,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-20 13:28:29,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 433 transitions. [2019-09-20 13:28:29,029 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 433 transitions. Word has length 121 [2019-09-20 13:28:29,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:29,029 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 433 transitions. [2019-09-20 13:28:29,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:29,029 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 433 transitions. [2019-09-20 13:28:29,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-20 13:28:29,031 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:29,031 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,031 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:29,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:29,031 INFO L82 PathProgramCache]: Analyzing trace with hash -430689443, now seen corresponding path program 1 times [2019-09-20 13:28:29,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:29,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:29,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:29,103 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:29,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:29,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:29,104 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:29,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:29,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:29,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:29,105 INFO L87 Difference]: Start difference. First operand 294 states and 433 transitions. Second operand 4 states. [2019-09-20 13:28:29,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:29,428 INFO L93 Difference]: Finished difference Result 322 states and 473 transitions. [2019-09-20 13:28:29,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:29,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-20 13:28:29,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:29,430 INFO L225 Difference]: With dead ends: 322 [2019-09-20 13:28:29,431 INFO L226 Difference]: Without dead ends: 322 [2019-09-20 13:28:29,431 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:29,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-20 13:28:29,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 294. [2019-09-20 13:28:29,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-20 13:28:29,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 432 transitions. [2019-09-20 13:28:29,436 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 432 transitions. Word has length 121 [2019-09-20 13:28:29,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:29,436 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 432 transitions. [2019-09-20 13:28:29,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:29,436 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 432 transitions. [2019-09-20 13:28:29,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-20 13:28:29,438 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:29,438 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,438 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:29,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:29,439 INFO L82 PathProgramCache]: Analyzing trace with hash -38534783, now seen corresponding path program 1 times [2019-09-20 13:28:29,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:29,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:29,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:29,516 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:29,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:29,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:29,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:29,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:29,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:29,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:29,518 INFO L87 Difference]: Start difference. First operand 294 states and 432 transitions. Second operand 4 states. [2019-09-20 13:28:29,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:29,856 INFO L93 Difference]: Finished difference Result 319 states and 468 transitions. [2019-09-20 13:28:29,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:29,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-20 13:28:29,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:29,864 INFO L225 Difference]: With dead ends: 319 [2019-09-20 13:28:29,865 INFO L226 Difference]: Without dead ends: 319 [2019-09-20 13:28:29,865 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:29,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-20 13:28:29,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 294. [2019-09-20 13:28:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-20 13:28:29,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 431 transitions. [2019-09-20 13:28:29,871 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 431 transitions. Word has length 122 [2019-09-20 13:28:29,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:29,871 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 431 transitions. [2019-09-20 13:28:29,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:29,871 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 431 transitions. [2019-09-20 13:28:29,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-20 13:28:29,872 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:29,873 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,873 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:29,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:29,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1029717653, now seen corresponding path program 1 times [2019-09-20 13:28:29,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:29,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:29,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:29,961 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:29,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:29,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:29,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:29,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:29,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:29,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:29,963 INFO L87 Difference]: Start difference. First operand 294 states and 431 transitions. Second operand 4 states. [2019-09-20 13:28:30,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:30,276 INFO L93 Difference]: Finished difference Result 319 states and 467 transitions. [2019-09-20 13:28:30,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:30,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-20 13:28:30,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:30,278 INFO L225 Difference]: With dead ends: 319 [2019-09-20 13:28:30,278 INFO L226 Difference]: Without dead ends: 319 [2019-09-20 13:28:30,279 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:30,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-20 13:28:30,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 294. [2019-09-20 13:28:30,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-20 13:28:30,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 430 transitions. [2019-09-20 13:28:30,283 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 430 transitions. Word has length 123 [2019-09-20 13:28:30,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:30,284 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 430 transitions. [2019-09-20 13:28:30,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:30,284 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 430 transitions. [2019-09-20 13:28:30,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-20 13:28:30,285 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:30,285 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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:30,285 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:30,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:30,286 INFO L82 PathProgramCache]: Analyzing trace with hash -785927715, now seen corresponding path program 1 times [2019-09-20 13:28:30,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:30,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:30,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:30,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:30,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:30,367 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-20 13:28:30,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:30,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:30,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:30,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:30,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:30,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:30,369 INFO L87 Difference]: Start difference. First operand 294 states and 430 transitions. Second operand 4 states. [2019-09-20 13:28:30,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:30,760 INFO L93 Difference]: Finished difference Result 366 states and 541 transitions. [2019-09-20 13:28:30,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:30,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-20 13:28:30,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:30,763 INFO L225 Difference]: With dead ends: 366 [2019-09-20 13:28:30,763 INFO L226 Difference]: Without dead ends: 366 [2019-09-20 13:28:30,764 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,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-09-20 13:28:30,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 326. [2019-09-20 13:28:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-20 13:28:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 487 transitions. [2019-09-20 13:28:30,769 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 487 transitions. Word has length 123 [2019-09-20 13:28:30,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:30,769 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 487 transitions. [2019-09-20 13:28:30,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:30,770 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 487 transitions. [2019-09-20 13:28:30,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-20 13:28:30,771 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:30,771 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,771 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:30,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:30,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1156205657, now seen corresponding path program 1 times [2019-09-20 13:28:30,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:30,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:30,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:30,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:30,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:30,837 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:30,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:30,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:30,837 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:30,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:30,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:30,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:30,838 INFO L87 Difference]: Start difference. First operand 326 states and 487 transitions. Second operand 4 states. [2019-09-20 13:28:31,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:31,137 INFO L93 Difference]: Finished difference Result 348 states and 519 transitions. [2019-09-20 13:28:31,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:31,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-20 13:28:31,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:31,141 INFO L225 Difference]: With dead ends: 348 [2019-09-20 13:28:31,141 INFO L226 Difference]: Without dead ends: 348 [2019-09-20 13:28:31,141 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:31,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-09-20 13:28:31,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 326. [2019-09-20 13:28:31,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-20 13:28:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 486 transitions. [2019-09-20 13:28:31,146 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 486 transitions. Word has length 124 [2019-09-20 13:28:31,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:31,147 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 486 transitions. [2019-09-20 13:28:31,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:31,147 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 486 transitions. [2019-09-20 13:28:31,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-20 13:28:31,148 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:31,148 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:31,149 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:31,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:31,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1369279331, now seen corresponding path program 1 times [2019-09-20 13:28:31,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:31,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:31,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:31,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:31,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:31,236 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-20 13:28:31,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:31,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:31,236 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:31,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:31,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:31,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:31,238 INFO L87 Difference]: Start difference. First operand 326 states and 486 transitions. Second operand 4 states. [2019-09-20 13:28:31,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:31,716 INFO L93 Difference]: Finished difference Result 436 states and 657 transitions. [2019-09-20 13:28:31,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:31,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-20 13:28:31,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:31,719 INFO L225 Difference]: With dead ends: 436 [2019-09-20 13:28:31,719 INFO L226 Difference]: Without dead ends: 436 [2019-09-20 13:28:31,719 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:31,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-09-20 13:28:31,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 365. [2019-09-20 13:28:31,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-09-20 13:28:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 557 transitions. [2019-09-20 13:28:31,724 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 557 transitions. Word has length 124 [2019-09-20 13:28:31,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:31,724 INFO L475 AbstractCegarLoop]: Abstraction has 365 states and 557 transitions. [2019-09-20 13:28:31,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:31,724 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 557 transitions. [2019-09-20 13:28:31,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-20 13:28:31,725 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:31,725 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-20 13:28:31,725 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:31,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:31,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1816097254, now seen corresponding path program 1 times [2019-09-20 13:28:31,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:31,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:31,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:31,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:31,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:31,796 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 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 [4] imperfect sequences [] total 4 [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 4 states [2019-09-20 13:28:31,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:31,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:31,798 INFO L87 Difference]: Start difference. First operand 365 states and 557 transitions. Second operand 4 states. [2019-09-20 13:28:32,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:32,109 INFO L93 Difference]: Finished difference Result 392 states and 591 transitions. [2019-09-20 13:28:32,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:32,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-20 13:28:32,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:32,111 INFO L225 Difference]: With dead ends: 392 [2019-09-20 13:28:32,111 INFO L226 Difference]: Without dead ends: 392 [2019-09-20 13:28:32,112 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:32,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-20 13:28:32,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 365. [2019-09-20 13:28:32,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-09-20 13:28:32,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 556 transitions. [2019-09-20 13:28:32,117 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 556 transitions. Word has length 125 [2019-09-20 13:28:32,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:32,117 INFO L475 AbstractCegarLoop]: Abstraction has 365 states and 556 transitions. [2019-09-20 13:28:32,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:32,117 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 556 transitions. [2019-09-20 13:28:32,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-20 13:28:32,118 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:32,118 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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:32,119 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:32,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:32,119 INFO L82 PathProgramCache]: Analyzing trace with hash 639566481, now seen corresponding path program 1 times [2019-09-20 13:28:32,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:32,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:32,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:32,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:32,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:32,214 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-20 13:28:32,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:32,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:32,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:32,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:32,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:32,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:32,216 INFO L87 Difference]: Start difference. First operand 365 states and 556 transitions. Second operand 4 states. [2019-09-20 13:28:32,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:32,634 INFO L93 Difference]: Finished difference Result 428 states and 644 transitions. [2019-09-20 13:28:32,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:32,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-20 13:28:32,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:32,637 INFO L225 Difference]: With dead ends: 428 [2019-09-20 13:28:32,637 INFO L226 Difference]: Without dead ends: 428 [2019-09-20 13:28:32,637 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:32,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-09-20 13:28:32,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 364. [2019-09-20 13:28:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-20 13:28:32,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 555 transitions. [2019-09-20 13:28:32,642 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 555 transitions. Word has length 125 [2019-09-20 13:28:32,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:32,642 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 555 transitions. [2019-09-20 13:28:32,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:32,642 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 555 transitions. [2019-09-20 13:28:32,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-20 13:28:32,643 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:32,644 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-20 13:28:32,644 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:32,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:32,644 INFO L82 PathProgramCache]: Analyzing trace with hash -237737633, now seen corresponding path program 1 times [2019-09-20 13:28:32,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:32,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:32,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:32,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:32,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:32,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:32,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:32,719 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:32,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:32,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:32,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:32,720 INFO L87 Difference]: Start difference. First operand 364 states and 555 transitions. Second operand 4 states. [2019-09-20 13:28:33,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:33,018 INFO L93 Difference]: Finished difference Result 391 states and 589 transitions. [2019-09-20 13:28:33,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:33,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-20 13:28:33,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:33,022 INFO L225 Difference]: With dead ends: 391 [2019-09-20 13:28:33,022 INFO L226 Difference]: Without dead ends: 391 [2019-09-20 13:28:33,022 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:33,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-09-20 13:28:33,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 364. [2019-09-20 13:28:33,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-20 13:28:33,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 554 transitions. [2019-09-20 13:28:33,027 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 554 transitions. Word has length 126 [2019-09-20 13:28:33,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:33,027 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 554 transitions. [2019-09-20 13:28:33,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 554 transitions. [2019-09-20 13:28:33,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-20 13:28:33,029 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:33,029 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-20 13:28:33,029 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:33,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:33,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1999708181, now seen corresponding path program 1 times [2019-09-20 13:28:33,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:33,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:33,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:33,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:33,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:33,098 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:33,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:33,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:33,098 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:33,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:33,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:33,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:33,099 INFO L87 Difference]: Start difference. First operand 364 states and 554 transitions. Second operand 4 states. [2019-09-20 13:28:33,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:33,416 INFO L93 Difference]: Finished difference Result 391 states and 588 transitions. [2019-09-20 13:28:33,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:33,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-20 13:28:33,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:33,418 INFO L225 Difference]: With dead ends: 391 [2019-09-20 13:28:33,418 INFO L226 Difference]: Without dead ends: 391 [2019-09-20 13:28:33,418 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:33,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-09-20 13:28:33,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 364. [2019-09-20 13:28:33,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-20 13:28:33,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 553 transitions. [2019-09-20 13:28:33,423 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 553 transitions. Word has length 127 [2019-09-20 13:28:33,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:33,423 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 553 transitions. [2019-09-20 13:28:33,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:33,423 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 553 transitions. [2019-09-20 13:28:33,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-20 13:28:33,424 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:33,424 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-20 13:28:33,425 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:33,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:33,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1100977798, now seen corresponding path program 1 times [2019-09-20 13:28:33,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:33,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:33,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:33,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:33,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:33,484 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:33,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:33,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:33,484 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:33,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:33,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:33,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:33,485 INFO L87 Difference]: Start difference. First operand 364 states and 553 transitions. Second operand 4 states. [2019-09-20 13:28:33,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:33,781 INFO L93 Difference]: Finished difference Result 381 states and 575 transitions. [2019-09-20 13:28:33,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:33,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-20 13:28:33,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:33,784 INFO L225 Difference]: With dead ends: 381 [2019-09-20 13:28:33,784 INFO L226 Difference]: Without dead ends: 381 [2019-09-20 13:28:33,784 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:33,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-09-20 13:28:33,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 364. [2019-09-20 13:28:33,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-20 13:28:33,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 552 transitions. [2019-09-20 13:28:33,789 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 552 transitions. Word has length 128 [2019-09-20 13:28:33,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:33,789 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 552 transitions. [2019-09-20 13:28:33,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:33,789 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 552 transitions. [2019-09-20 13:28:33,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-20 13:28:33,790 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:33,791 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:33,791 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:33,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:33,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1151985996, now seen corresponding path program 1 times [2019-09-20 13:28:33,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:33,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:33,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:33,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:33,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:33,859 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:33,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:33,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:33,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:33,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:33,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:33,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:33,861 INFO L87 Difference]: Start difference. First operand 364 states and 552 transitions. Second operand 3 states. [2019-09-20 13:28:33,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:33,966 INFO L93 Difference]: Finished difference Result 699 states and 1056 transitions. [2019-09-20 13:28:33,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:33,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-20 13:28:33,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:33,971 INFO L225 Difference]: With dead ends: 699 [2019-09-20 13:28:33,971 INFO L226 Difference]: Without dead ends: 699 [2019-09-20 13:28:33,973 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,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-09-20 13:28:33,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2019-09-20 13:28:33,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-20 13:28:33,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1055 transitions. [2019-09-20 13:28:33,988 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1055 transitions. Word has length 129 [2019-09-20 13:28:33,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:33,988 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 1055 transitions. [2019-09-20 13:28:33,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:33,988 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1055 transitions. [2019-09-20 13:28:33,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-20 13:28:33,991 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:33,991 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:33,991 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:33,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:33,992 INFO L82 PathProgramCache]: Analyzing trace with hash -369166995, now seen corresponding path program 1 times [2019-09-20 13:28:33,992 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,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:34,166 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:34,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:34,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:34,166 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:34,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:34,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:34,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:34,167 INFO L87 Difference]: Start difference. First operand 697 states and 1055 transitions. Second operand 4 states. [2019-09-20 13:28:34,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:34,625 INFO L93 Difference]: Finished difference Result 913 states and 1383 transitions. [2019-09-20 13:28:34,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:34,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-09-20 13:28:34,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:34,630 INFO L225 Difference]: With dead ends: 913 [2019-09-20 13:28:34,630 INFO L226 Difference]: Without dead ends: 913 [2019-09-20 13:28:34,630 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:34,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2019-09-20 13:28:34,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 775. [2019-09-20 13:28:34,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-09-20 13:28:34,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1197 transitions. [2019-09-20 13:28:34,640 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1197 transitions. Word has length 131 [2019-09-20 13:28:34,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:34,641 INFO L475 AbstractCegarLoop]: Abstraction has 775 states and 1197 transitions. [2019-09-20 13:28:34,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:34,641 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1197 transitions. [2019-09-20 13:28:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-20 13:28:34,643 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:34,643 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:34,643 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:34,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:34,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1712662073, now seen corresponding path program 1 times [2019-09-20 13:28:34,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:34,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:34,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:34,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:34,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:34,716 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:34,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:34,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:34,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:34,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:34,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:34,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:34,718 INFO L87 Difference]: Start difference. First operand 775 states and 1197 transitions. Second operand 4 states. [2019-09-20 13:28:35,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:35,171 INFO L93 Difference]: Finished difference Result 901 states and 1366 transitions. [2019-09-20 13:28:35,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:35,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-09-20 13:28:35,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:35,176 INFO L225 Difference]: With dead ends: 901 [2019-09-20 13:28:35,177 INFO L226 Difference]: Without dead ends: 901 [2019-09-20 13:28:35,177 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:35,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2019-09-20 13:28:35,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 697. [2019-09-20 13:28:35,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-20 13:28:35,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1055 transitions. [2019-09-20 13:28:35,186 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1055 transitions. Word has length 132 [2019-09-20 13:28:35,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:35,186 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 1055 transitions. [2019-09-20 13:28:35,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:35,186 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1055 transitions. [2019-09-20 13:28:35,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-20 13:28:35,188 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:35,189 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:35,189 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:35,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:35,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1341406511, now seen corresponding path program 1 times [2019-09-20 13:28:35,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:35,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:35,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:35,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:35,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:35,275 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:35,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:35,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:35,276 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:35,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:35,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:35,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:35,277 INFO L87 Difference]: Start difference. First operand 697 states and 1055 transitions. Second operand 4 states. [2019-09-20 13:28:35,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:35,593 INFO L93 Difference]: Finished difference Result 729 states and 1097 transitions. [2019-09-20 13:28:35,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:35,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-20 13:28:35,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:35,596 INFO L225 Difference]: With dead ends: 729 [2019-09-20 13:28:35,596 INFO L226 Difference]: Without dead ends: 729 [2019-09-20 13:28:35,597 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:35,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2019-09-20 13:28:35,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 703. [2019-09-20 13:28:35,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-09-20 13:28:35,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1061 transitions. [2019-09-20 13:28:35,604 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1061 transitions. Word has length 133 [2019-09-20 13:28:35,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:35,604 INFO L475 AbstractCegarLoop]: Abstraction has 703 states and 1061 transitions. [2019-09-20 13:28:35,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:35,604 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1061 transitions. [2019-09-20 13:28:35,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-20 13:28:35,605 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:35,606 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2019-09-20 13:28:35,606 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:35,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:35,606 INFO L82 PathProgramCache]: Analyzing trace with hash 2100763372, now seen corresponding path program 1 times [2019-09-20 13:28:35,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:35,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:35,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:35,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:35,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:35,679 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-20 13:28:35,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:35,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:35,680 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:35,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:35,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:35,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:35,681 INFO L87 Difference]: Start difference. First operand 703 states and 1061 transitions. Second operand 4 states. [2019-09-20 13:28:35,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:35,950 INFO L93 Difference]: Finished difference Result 737 states and 1105 transitions. [2019-09-20 13:28:35,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:35,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-20 13:28:35,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:35,953 INFO L225 Difference]: With dead ends: 737 [2019-09-20 13:28:35,954 INFO L226 Difference]: Without dead ends: 737 [2019-09-20 13:28:35,954 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:35,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-09-20 13:28:35,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 703. [2019-09-20 13:28:35,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-09-20 13:28:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1059 transitions. [2019-09-20 13:28:35,964 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1059 transitions. Word has length 138 [2019-09-20 13:28:35,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:35,965 INFO L475 AbstractCegarLoop]: Abstraction has 703 states and 1059 transitions. [2019-09-20 13:28:35,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:35,965 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1059 transitions. [2019-09-20 13:28:35,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-20 13:28:35,966 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:35,967 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] [2019-09-20 13:28:35,967 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:35,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:35,967 INFO L82 PathProgramCache]: Analyzing trace with hash -663860235, now seen corresponding path program 1 times [2019-09-20 13:28:35,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:35,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:35,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:35,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:35,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:36,046 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:36,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:36,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:36,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:36,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:36,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:36,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:36,048 INFO L87 Difference]: Start difference. First operand 703 states and 1059 transitions. Second operand 4 states. [2019-09-20 13:28:36,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:36,401 INFO L93 Difference]: Finished difference Result 829 states and 1253 transitions. [2019-09-20 13:28:36,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:36,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-20 13:28:36,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:36,407 INFO L225 Difference]: With dead ends: 829 [2019-09-20 13:28:36,407 INFO L226 Difference]: Without dead ends: 829 [2019-09-20 13:28:36,407 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:36,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2019-09-20 13:28:36,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 759. [2019-09-20 13:28:36,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-09-20 13:28:36,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1157 transitions. [2019-09-20 13:28:36,418 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1157 transitions. Word has length 138 [2019-09-20 13:28:36,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:36,419 INFO L475 AbstractCegarLoop]: Abstraction has 759 states and 1157 transitions. [2019-09-20 13:28:36,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:36,419 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1157 transitions. [2019-09-20 13:28:36,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-20 13:28:36,422 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:36,422 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2019-09-20 13:28:36,422 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:36,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:36,423 INFO L82 PathProgramCache]: Analyzing trace with hash 462308518, now seen corresponding path program 1 times [2019-09-20 13:28:36,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:36,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:36,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:36,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:36,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:36,502 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-20 13:28:36,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:36,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:36,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:36,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:36,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:36,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:36,504 INFO L87 Difference]: Start difference. First operand 759 states and 1157 transitions. Second operand 4 states. [2019-09-20 13:28:36,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:36,941 INFO L93 Difference]: Finished difference Result 963 states and 1466 transitions. [2019-09-20 13:28:36,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:36,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-09-20 13:28:36,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:36,946 INFO L225 Difference]: With dead ends: 963 [2019-09-20 13:28:36,946 INFO L226 Difference]: Without dead ends: 963 [2019-09-20 13:28:36,947 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:36,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-09-20 13:28:36,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 783. [2019-09-20 13:28:36,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-20 13:28:36,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1191 transitions. [2019-09-20 13:28:36,958 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1191 transitions. Word has length 139 [2019-09-20 13:28:36,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:36,958 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1191 transitions. [2019-09-20 13:28:36,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:36,959 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1191 transitions. [2019-09-20 13:28:36,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-20 13:28:36,961 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:36,961 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-09-20 13:28:36,961 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:36,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:36,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1617694983, now seen corresponding path program 1 times [2019-09-20 13:28:36,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:36,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:36,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:36,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:36,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:37,058 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-20 13:28:37,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:37,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:37,058 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:37,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:37,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:37,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:37,059 INFO L87 Difference]: Start difference. First operand 783 states and 1191 transitions. Second operand 4 states.