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.10.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:54:08,828 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:54:08,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:54:08,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:54:08,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:54:08,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:54:08,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:54:08,846 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:54:08,848 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:54:08,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:54:08,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:54:08,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:54:08,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:54:08,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:54:08,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:54:08,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:54:08,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:54:08,856 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:54:08,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:54:08,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:54:08,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:54:08,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:54:08,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:54:08,863 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:54:08,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:54:08,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:54:08,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:54:08,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:54:08,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:54:08,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:54:08,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:54:08,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:54:08,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:54:08,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:54:08,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:54:08,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:54:08,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:54:08,873 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:54:08,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:54:08,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:54:08,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:54:08,875 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-09 05:54:08,890 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:54:08,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:54:08,891 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:54:08,891 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:54:08,891 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:54:08,892 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:54:08,892 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:54:08,892 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:54:08,892 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:54:08,892 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:54:08,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:54:08,893 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:54:08,893 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:54:08,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:54:08,894 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:54:08,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:54:08,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:54:08,894 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:54:08,895 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:54:08,895 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:54:08,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:54:08,895 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:54:08,895 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:54:08,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:54:08,896 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:54:08,896 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:54:08,896 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:54:08,896 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:54:08,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:54:08,897 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:54:08,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:54:08,936 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:54:08,939 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:54:08,941 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:54:08,941 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:54:08,942 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.10.i.cil-1.c [2019-09-09 05:54:09,000 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6938f768/c4b669537e7f468897493dd68801de11/FLAG3db8ff128 [2019-09-09 05:54:09,600 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:54:09,601 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.10.i.cil-1.c [2019-09-09 05:54:09,623 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6938f768/c4b669537e7f468897493dd68801de11/FLAG3db8ff128 [2019-09-09 05:54:09,824 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6938f768/c4b669537e7f468897493dd68801de11 [2019-09-09 05:54:09,834 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:54:09,835 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:54:09,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:54:09,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:54:09,840 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:54:09,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:54:09" (1/1) ... [2019-09-09 05:54:09,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64288fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:09, skipping insertion in model container [2019-09-09 05:54:09,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:54:09" (1/1) ... [2019-09-09 05:54:09,851 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:54:09,924 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:54:10,496 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:54:10,530 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:54:10,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:54:10,761 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:54:10,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:10 WrapperNode [2019-09-09 05:54:10,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:54:10,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:54:10,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:54:10,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:54:10,773 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:10" (1/1) ... [2019-09-09 05:54:10,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:10" (1/1) ... [2019-09-09 05:54:10,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:10" (1/1) ... [2019-09-09 05:54:10,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:10" (1/1) ... [2019-09-09 05:54:10,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:10" (1/1) ... [2019-09-09 05:54:10,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:10" (1/1) ... [2019-09-09 05:54:10,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:10" (1/1) ... [2019-09-09 05:54:10,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:54:10,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:54:10,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:54:10,915 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:54:10,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:10" (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-09 05:54:10,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:54:10,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:54:10,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-09 05:54:10,974 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-09 05:54:10,974 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:54:10,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-09 05:54:10,975 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-09 05:54:10,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-09 05:54:10,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-09 05:54:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:54:10,976 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-09 05:54:10,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:54:10,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:54:10,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:54:10,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-09 05:54:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-09 05:54:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-09 05:54:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-09 05:54:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-09 05:54:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-09 05:54:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-09 05:54:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-09 05:54:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:54:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-09 05:54:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-09 05:54:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-09 05:54:10,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-09 05:54:10,979 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-09 05:54:10,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-09 05:54:10,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:54:10,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-09 05:54:10,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-09 05:54:10,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-09 05:54:10,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:54:10,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-09 05:54:10,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-09 05:54:10,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-09 05:54:10,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-09 05:54:10,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-09 05:54:11,426 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:54:12,056 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-09 05:54:12,056 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-09 05:54:12,092 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:54:12,093 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:54:12,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:54:12 BoogieIcfgContainer [2019-09-09 05:54:12,094 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:54:12,095 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:54:12,095 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:54:12,099 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:54:12,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:54:09" (1/3) ... [2019-09-09 05:54:12,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed72f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:54:12, skipping insertion in model container [2019-09-09 05:54:12,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:54:10" (2/3) ... [2019-09-09 05:54:12,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed72f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:54:12, skipping insertion in model container [2019-09-09 05:54:12,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:54:12" (3/3) ... [2019-09-09 05:54:12,103 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.10.i.cil-1.c [2019-09-09 05:54:12,112 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:54:12,122 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:54:12,138 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:54:12,164 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:54:12,164 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:54:12,164 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:54:12,164 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:54:12,165 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:54:12,165 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:54:12,165 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:54:12,165 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:54:12,188 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2019-09-09 05:54:12,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-09 05:54:12,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:12,203 INFO L399 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] [2019-09-09 05:54:12,205 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:12,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:12,211 INFO L82 PathProgramCache]: Analyzing trace with hash -2093674288, now seen corresponding path program 1 times [2019-09-09 05:54:12,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:12,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:12,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:12,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:12,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:12,628 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-09 05:54:12,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:12,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:12,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:12,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:12,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:12,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:12,661 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 4 states. [2019-09-09 05:54:13,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:13,135 INFO L93 Difference]: Finished difference Result 188 states and 306 transitions. [2019-09-09 05:54:13,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:13,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-09-09 05:54:13,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:13,157 INFO L225 Difference]: With dead ends: 188 [2019-09-09 05:54:13,158 INFO L226 Difference]: Without dead ends: 167 [2019-09-09 05:54:13,161 INFO L628 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-09 05:54:13,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-09 05:54:13,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 150. [2019-09-09 05:54:13,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-09 05:54:13,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 228 transitions. [2019-09-09 05:54:13,239 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 228 transitions. Word has length 48 [2019-09-09 05:54:13,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:13,240 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 228 transitions. [2019-09-09 05:54:13,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:13,240 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 228 transitions. [2019-09-09 05:54:13,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-09 05:54:13,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:13,243 INFO L399 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] [2019-09-09 05:54:13,244 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:13,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:13,244 INFO L82 PathProgramCache]: Analyzing trace with hash -769657203, now seen corresponding path program 1 times [2019-09-09 05:54:13,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:13,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:13,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:13,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:13,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:13,377 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-09 05:54:13,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:13,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:13,379 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:13,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:13,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:13,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:13,383 INFO L87 Difference]: Start difference. First operand 150 states and 228 transitions. Second operand 4 states. [2019-09-09 05:54:13,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:13,743 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2019-09-09 05:54:13,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:13,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-09-09 05:54:13,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:13,746 INFO L225 Difference]: With dead ends: 167 [2019-09-09 05:54:13,746 INFO L226 Difference]: Without dead ends: 167 [2019-09-09 05:54:13,747 INFO L628 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-09 05:54:13,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-09 05:54:13,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 150. [2019-09-09 05:54:13,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-09 05:54:13,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 227 transitions. [2019-09-09 05:54:13,757 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 227 transitions. Word has length 61 [2019-09-09 05:54:13,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:13,757 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 227 transitions. [2019-09-09 05:54:13,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:13,757 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 227 transitions. [2019-09-09 05:54:13,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-09 05:54:13,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:13,760 INFO L399 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] [2019-09-09 05:54:13,760 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:13,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:13,760 INFO L82 PathProgramCache]: Analyzing trace with hash -780515679, now seen corresponding path program 1 times [2019-09-09 05:54:13,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:13,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:13,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:13,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:13,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:13,850 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-09 05:54:13,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:13,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:13,851 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:13,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:13,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:13,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:13,852 INFO L87 Difference]: Start difference. First operand 150 states and 227 transitions. Second operand 4 states. [2019-09-09 05:54:14,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:14,188 INFO L93 Difference]: Finished difference Result 166 states and 246 transitions. [2019-09-09 05:54:14,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:14,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-09 05:54:14,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:14,190 INFO L225 Difference]: With dead ends: 166 [2019-09-09 05:54:14,190 INFO L226 Difference]: Without dead ends: 166 [2019-09-09 05:54:14,191 INFO L628 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-09 05:54:14,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-09 05:54:14,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 150. [2019-09-09 05:54:14,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-09 05:54:14,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 226 transitions. [2019-09-09 05:54:14,199 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 226 transitions. Word has length 62 [2019-09-09 05:54:14,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:14,200 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 226 transitions. [2019-09-09 05:54:14,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:14,200 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 226 transitions. [2019-09-09 05:54:14,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-09 05:54:14,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:14,202 INFO L399 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] [2019-09-09 05:54:14,203 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:14,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:14,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1828026483, now seen corresponding path program 1 times [2019-09-09 05:54:14,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:14,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:14,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:14,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:14,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:14,317 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-09 05:54:14,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:14,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:54:14,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:14,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:54:14,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:54:14,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:14,319 INFO L87 Difference]: Start difference. First operand 150 states and 226 transitions. Second operand 5 states. [2019-09-09 05:54:14,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:14,828 INFO L93 Difference]: Finished difference Result 171 states and 254 transitions. [2019-09-09 05:54:14,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:54:14,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-09-09 05:54:14,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:14,830 INFO L225 Difference]: With dead ends: 171 [2019-09-09 05:54:14,830 INFO L226 Difference]: Without dead ends: 171 [2019-09-09 05:54:14,831 INFO L628 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-09 05:54:14,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-09 05:54:14,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2019-09-09 05:54:14,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-09 05:54:14,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 253 transitions. [2019-09-09 05:54:14,842 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 253 transitions. Word has length 62 [2019-09-09 05:54:14,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:14,842 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 253 transitions. [2019-09-09 05:54:14,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:54:14,842 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 253 transitions. [2019-09-09 05:54:14,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-09 05:54:14,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:14,845 INFO L399 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] [2019-09-09 05:54:14,845 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:14,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:14,847 INFO L82 PathProgramCache]: Analyzing trace with hash 981067477, now seen corresponding path program 1 times [2019-09-09 05:54:14,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:14,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:14,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:14,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:14,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:14,907 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-09 05:54:14,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:14,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:14,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:14,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:14,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:14,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:14,909 INFO L87 Difference]: Start difference. First operand 170 states and 253 transitions. Second operand 4 states. [2019-09-09 05:54:15,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:15,170 INFO L93 Difference]: Finished difference Result 185 states and 270 transitions. [2019-09-09 05:54:15,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:15,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-09 05:54:15,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:15,172 INFO L225 Difference]: With dead ends: 185 [2019-09-09 05:54:15,172 INFO L226 Difference]: Without dead ends: 185 [2019-09-09 05:54:15,173 INFO L628 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-09 05:54:15,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-09 05:54:15,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 170. [2019-09-09 05:54:15,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-09 05:54:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 252 transitions. [2019-09-09 05:54:15,180 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 252 transitions. Word has length 62 [2019-09-09 05:54:15,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:15,181 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 252 transitions. [2019-09-09 05:54:15,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:15,181 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 252 transitions. [2019-09-09 05:54:15,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-09 05:54:15,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:15,182 INFO L399 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] [2019-09-09 05:54:15,182 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:15,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:15,183 INFO L82 PathProgramCache]: Analyzing trace with hash 840340790, now seen corresponding path program 1 times [2019-09-09 05:54:15,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:15,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:15,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:15,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:15,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:15,251 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-09 05:54:15,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:15,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:15,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:15,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:15,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:15,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:15,255 INFO L87 Difference]: Start difference. First operand 170 states and 252 transitions. Second operand 4 states. [2019-09-09 05:54:15,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:15,533 INFO L93 Difference]: Finished difference Result 183 states and 267 transitions. [2019-09-09 05:54:15,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:15,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-09 05:54:15,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:15,535 INFO L225 Difference]: With dead ends: 183 [2019-09-09 05:54:15,536 INFO L226 Difference]: Without dead ends: 183 [2019-09-09 05:54:15,536 INFO L628 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-09 05:54:15,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-09 05:54:15,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 170. [2019-09-09 05:54:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-09 05:54:15,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 251 transitions. [2019-09-09 05:54:15,548 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 251 transitions. Word has length 62 [2019-09-09 05:54:15,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:15,550 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 251 transitions. [2019-09-09 05:54:15,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:15,550 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 251 transitions. [2019-09-09 05:54:15,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:54:15,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:15,551 INFO L399 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-09 05:54:15,552 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:15,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:15,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1871605872, now seen corresponding path program 1 times [2019-09-09 05:54:15,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:15,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:15,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:15,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:15,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:15,633 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-09 05:54:15,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:15,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:15,633 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:15,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:15,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:15,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:15,635 INFO L87 Difference]: Start difference. First operand 170 states and 251 transitions. Second operand 4 states. [2019-09-09 05:54:15,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:15,889 INFO L93 Difference]: Finished difference Result 183 states and 266 transitions. [2019-09-09 05:54:15,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:15,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-09 05:54:15,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:15,891 INFO L225 Difference]: With dead ends: 183 [2019-09-09 05:54:15,891 INFO L226 Difference]: Without dead ends: 183 [2019-09-09 05:54:15,891 INFO L628 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-09 05:54:15,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-09 05:54:15,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 170. [2019-09-09 05:54:15,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-09 05:54:15,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 250 transitions. [2019-09-09 05:54:15,897 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 250 transitions. Word has length 63 [2019-09-09 05:54:15,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:15,897 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 250 transitions. [2019-09-09 05:54:15,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:15,897 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 250 transitions. [2019-09-09 05:54:15,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:54:15,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:15,898 INFO L399 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] [2019-09-09 05:54:15,899 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:15,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:15,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1090961511, now seen corresponding path program 1 times [2019-09-09 05:54:15,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:15,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:15,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:15,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:15,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:15,963 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-09 05:54:15,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:15,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:15,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:15,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:15,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:15,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:15,965 INFO L87 Difference]: Start difference. First operand 170 states and 250 transitions. Second operand 4 states. [2019-09-09 05:54:16,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:16,227 INFO L93 Difference]: Finished difference Result 183 states and 265 transitions. [2019-09-09 05:54:16,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:16,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-09 05:54:16,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:16,230 INFO L225 Difference]: With dead ends: 183 [2019-09-09 05:54:16,230 INFO L226 Difference]: Without dead ends: 183 [2019-09-09 05:54:16,230 INFO L628 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-09 05:54:16,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-09 05:54:16,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 170. [2019-09-09 05:54:16,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-09 05:54:16,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 249 transitions. [2019-09-09 05:54:16,237 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 249 transitions. Word has length 64 [2019-09-09 05:54:16,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:16,238 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 249 transitions. [2019-09-09 05:54:16,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:16,238 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 249 transitions. [2019-09-09 05:54:16,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-09 05:54:16,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:16,239 INFO L399 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] [2019-09-09 05:54:16,239 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:16,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:16,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1471474475, now seen corresponding path program 1 times [2019-09-09 05:54:16,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:16,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:16,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:16,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:16,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:16,312 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-09 05:54:16,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:16,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:16,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:16,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:16,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:16,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:16,314 INFO L87 Difference]: Start difference. First operand 170 states and 249 transitions. Second operand 4 states. [2019-09-09 05:54:16,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:16,621 INFO L93 Difference]: Finished difference Result 183 states and 264 transitions. [2019-09-09 05:54:16,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:16,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-09 05:54:16,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:16,624 INFO L225 Difference]: With dead ends: 183 [2019-09-09 05:54:16,624 INFO L226 Difference]: Without dead ends: 183 [2019-09-09 05:54:16,624 INFO L628 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-09 05:54:16,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-09 05:54:16,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 170. [2019-09-09 05:54:16,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-09 05:54:16,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 248 transitions. [2019-09-09 05:54:16,636 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 248 transitions. Word has length 65 [2019-09-09 05:54:16,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:16,638 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 248 transitions. [2019-09-09 05:54:16,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:16,641 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 248 transitions. [2019-09-09 05:54:16,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-09 05:54:16,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:16,644 INFO L399 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] [2019-09-09 05:54:16,644 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:16,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:16,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1708078742, now seen corresponding path program 1 times [2019-09-09 05:54:16,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:16,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:16,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:16,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:16,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:16,753 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-09 05:54:16,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:16,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:16,754 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:16,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:16,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:16,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:16,755 INFO L87 Difference]: Start difference. First operand 170 states and 248 transitions. Second operand 4 states. [2019-09-09 05:54:17,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:17,034 INFO L93 Difference]: Finished difference Result 212 states and 310 transitions. [2019-09-09 05:54:17,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:17,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-09 05:54:17,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:17,036 INFO L225 Difference]: With dead ends: 212 [2019-09-09 05:54:17,036 INFO L226 Difference]: Without dead ends: 212 [2019-09-09 05:54:17,036 INFO L628 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-09 05:54:17,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-09 05:54:17,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 192. [2019-09-09 05:54:17,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-09 05:54:17,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 285 transitions. [2019-09-09 05:54:17,042 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 285 transitions. Word has length 65 [2019-09-09 05:54:17,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:17,042 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 285 transitions. [2019-09-09 05:54:17,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:17,043 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 285 transitions. [2019-09-09 05:54:17,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-09 05:54:17,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:17,044 INFO L399 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] [2019-09-09 05:54:17,044 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:17,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:17,045 INFO L82 PathProgramCache]: Analyzing trace with hash 882288222, now seen corresponding path program 1 times [2019-09-09 05:54:17,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:17,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:17,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:17,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:17,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:17,102 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-09 05:54:17,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:17,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:17,103 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:17,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:17,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:17,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:17,104 INFO L87 Difference]: Start difference. First operand 192 states and 285 transitions. Second operand 4 states. [2019-09-09 05:54:17,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:17,355 INFO L93 Difference]: Finished difference Result 195 states and 288 transitions. [2019-09-09 05:54:17,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:17,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-09 05:54:17,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:17,357 INFO L225 Difference]: With dead ends: 195 [2019-09-09 05:54:17,358 INFO L226 Difference]: Without dead ends: 195 [2019-09-09 05:54:17,358 INFO L628 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-09 05:54:17,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-09 05:54:17,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2019-09-09 05:54:17,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-09 05:54:17,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 284 transitions. [2019-09-09 05:54:17,369 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 284 transitions. Word has length 66 [2019-09-09 05:54:17,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:17,369 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 284 transitions. [2019-09-09 05:54:17,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:17,369 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 284 transitions. [2019-09-09 05:54:17,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-09 05:54:17,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:17,371 INFO L399 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] [2019-09-09 05:54:17,371 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:17,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:17,371 INFO L82 PathProgramCache]: Analyzing trace with hash 963895943, now seen corresponding path program 1 times [2019-09-09 05:54:17,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:17,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:17,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:17,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:17,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:17,444 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-09 05:54:17,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:17,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:17,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:17,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:17,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:17,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:17,447 INFO L87 Difference]: Start difference. First operand 192 states and 284 transitions. Second operand 4 states. [2019-09-09 05:54:17,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:17,755 INFO L93 Difference]: Finished difference Result 212 states and 308 transitions. [2019-09-09 05:54:17,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:17,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-09 05:54:17,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:17,757 INFO L225 Difference]: With dead ends: 212 [2019-09-09 05:54:17,757 INFO L226 Difference]: Without dead ends: 212 [2019-09-09 05:54:17,758 INFO L628 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-09 05:54:17,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-09 05:54:17,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 192. [2019-09-09 05:54:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-09 05:54:17,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 283 transitions. [2019-09-09 05:54:17,766 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 283 transitions. Word has length 78 [2019-09-09 05:54:17,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:17,766 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 283 transitions. [2019-09-09 05:54:17,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:17,767 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 283 transitions. [2019-09-09 05:54:17,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-09 05:54:17,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:17,769 INFO L399 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] [2019-09-09 05:54:17,769 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:17,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:17,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1113359845, now seen corresponding path program 1 times [2019-09-09 05:54:17,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:17,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:17,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:17,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:17,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:17,843 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-09 05:54:17,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:17,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:17,845 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:17,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:17,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:17,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:17,846 INFO L87 Difference]: Start difference. First operand 192 states and 283 transitions. Second operand 4 states. [2019-09-09 05:54:18,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:18,114 INFO L93 Difference]: Finished difference Result 211 states and 306 transitions. [2019-09-09 05:54:18,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:18,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-09 05:54:18,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:18,116 INFO L225 Difference]: With dead ends: 211 [2019-09-09 05:54:18,116 INFO L226 Difference]: Without dead ends: 211 [2019-09-09 05:54:18,117 INFO L628 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-09 05:54:18,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-09 05:54:18,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 192. [2019-09-09 05:54:18,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-09 05:54:18,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 282 transitions. [2019-09-09 05:54:18,122 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 282 transitions. Word has length 79 [2019-09-09 05:54:18,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:18,122 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 282 transitions. [2019-09-09 05:54:18,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:18,123 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 282 transitions. [2019-09-09 05:54:18,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-09 05:54:18,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:18,124 INFO L399 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] [2019-09-09 05:54:18,124 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:18,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:18,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1254086532, now seen corresponding path program 1 times [2019-09-09 05:54:18,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:18,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:18,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:18,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:18,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:18,185 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-09 05:54:18,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:18,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:18,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:18,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:18,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:18,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:18,187 INFO L87 Difference]: Start difference. First operand 192 states and 282 transitions. Second operand 4 states. [2019-09-09 05:54:18,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:18,497 INFO L93 Difference]: Finished difference Result 209 states and 303 transitions. [2019-09-09 05:54:18,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:18,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-09 05:54:18,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:18,499 INFO L225 Difference]: With dead ends: 209 [2019-09-09 05:54:18,499 INFO L226 Difference]: Without dead ends: 209 [2019-09-09 05:54:18,499 INFO L628 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-09 05:54:18,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-09 05:54:18,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 192. [2019-09-09 05:54:18,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-09 05:54:18,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 281 transitions. [2019-09-09 05:54:18,504 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 281 transitions. Word has length 79 [2019-09-09 05:54:18,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:18,505 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 281 transitions. [2019-09-09 05:54:18,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:18,505 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 281 transitions. [2019-09-09 05:54:18,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-09 05:54:18,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:18,506 INFO L399 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] [2019-09-09 05:54:18,506 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:18,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:18,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1368868330, now seen corresponding path program 1 times [2019-09-09 05:54:18,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:18,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:18,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:18,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:18,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:18,563 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-09 05:54:18,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:18,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:18,563 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:18,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:18,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:18,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:18,564 INFO L87 Difference]: Start difference. First operand 192 states and 281 transitions. Second operand 4 states. [2019-09-09 05:54:18,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:18,820 INFO L93 Difference]: Finished difference Result 209 states and 302 transitions. [2019-09-09 05:54:18,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:18,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-09 05:54:18,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:18,822 INFO L225 Difference]: With dead ends: 209 [2019-09-09 05:54:18,823 INFO L226 Difference]: Without dead ends: 209 [2019-09-09 05:54:18,823 INFO L628 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-09 05:54:18,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-09 05:54:18,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 192. [2019-09-09 05:54:18,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-09 05:54:18,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 280 transitions. [2019-09-09 05:54:18,828 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 280 transitions. Word has length 80 [2019-09-09 05:54:18,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:18,829 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 280 transitions. [2019-09-09 05:54:18,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 280 transitions. [2019-09-09 05:54:18,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-09 05:54:18,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:18,830 INFO L399 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] [2019-09-09 05:54:18,830 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:18,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:18,831 INFO L82 PathProgramCache]: Analyzing trace with hash 504043871, now seen corresponding path program 1 times [2019-09-09 05:54:18,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:18,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:18,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:18,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:18,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:18,893 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-09 05:54:18,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:18,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:18,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:18,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:18,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:18,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:18,895 INFO L87 Difference]: Start difference. First operand 192 states and 280 transitions. Second operand 4 states. [2019-09-09 05:54:19,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:19,149 INFO L93 Difference]: Finished difference Result 209 states and 301 transitions. [2019-09-09 05:54:19,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:19,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-09 05:54:19,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:19,151 INFO L225 Difference]: With dead ends: 209 [2019-09-09 05:54:19,151 INFO L226 Difference]: Without dead ends: 209 [2019-09-09 05:54:19,151 INFO L628 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-09 05:54:19,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-09 05:54:19,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 192. [2019-09-09 05:54:19,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-09 05:54:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 279 transitions. [2019-09-09 05:54:19,156 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 279 transitions. Word has length 81 [2019-09-09 05:54:19,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:19,156 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 279 transitions. [2019-09-09 05:54:19,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:19,157 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 279 transitions. [2019-09-09 05:54:19,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-09 05:54:19,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:19,158 INFO L399 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] [2019-09-09 05:54:19,158 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:19,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:19,158 INFO L82 PathProgramCache]: Analyzing trace with hash 729052111, now seen corresponding path program 1 times [2019-09-09 05:54:19,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:19,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:19,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:19,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:19,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:19,203 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-09 05:54:19,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:19,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:19,204 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:19,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:19,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:19,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:19,205 INFO L87 Difference]: Start difference. First operand 192 states and 279 transitions. Second operand 4 states. [2019-09-09 05:54:19,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:19,516 INFO L93 Difference]: Finished difference Result 209 states and 300 transitions. [2019-09-09 05:54:19,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:19,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-09 05:54:19,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:19,518 INFO L225 Difference]: With dead ends: 209 [2019-09-09 05:54:19,519 INFO L226 Difference]: Without dead ends: 209 [2019-09-09 05:54:19,519 INFO L628 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-09 05:54:19,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-09 05:54:19,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 192. [2019-09-09 05:54:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-09 05:54:19,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 278 transitions. [2019-09-09 05:54:19,524 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 278 transitions. Word has length 82 [2019-09-09 05:54:19,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:19,525 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 278 transitions. [2019-09-09 05:54:19,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:19,525 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 278 transitions. [2019-09-09 05:54:19,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-09 05:54:19,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:19,527 INFO L399 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] [2019-09-09 05:54:19,527 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:19,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:19,528 INFO L82 PathProgramCache]: Analyzing trace with hash 379135652, now seen corresponding path program 1 times [2019-09-09 05:54:19,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:19,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:19,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:19,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:19,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:19,611 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-09 05:54:19,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:19,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:19,612 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:19,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:19,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:19,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:19,614 INFO L87 Difference]: Start difference. First operand 192 states and 278 transitions. Second operand 4 states. [2019-09-09 05:54:19,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:19,912 INFO L93 Difference]: Finished difference Result 199 states and 287 transitions. [2019-09-09 05:54:19,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:19,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-09 05:54:19,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:19,914 INFO L225 Difference]: With dead ends: 199 [2019-09-09 05:54:19,915 INFO L226 Difference]: Without dead ends: 199 [2019-09-09 05:54:19,915 INFO L628 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-09 05:54:19,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-09 05:54:19,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 192. [2019-09-09 05:54:19,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-09 05:54:19,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 277 transitions. [2019-09-09 05:54:19,921 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 277 transitions. Word has length 83 [2019-09-09 05:54:19,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:19,921 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 277 transitions. [2019-09-09 05:54:19,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:19,922 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 277 transitions. [2019-09-09 05:54:19,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-09 05:54:19,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:19,923 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:19,924 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:19,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:19,924 INFO L82 PathProgramCache]: Analyzing trace with hash -578102836, now seen corresponding path program 1 times [2019-09-09 05:54:19,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:19,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:19,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:19,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:19,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:19,988 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-09 05:54:19,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:19,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:19,989 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:19,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:19,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:19,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:19,990 INFO L87 Difference]: Start difference. First operand 192 states and 277 transitions. Second operand 4 states. [2019-09-09 05:54:20,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:20,398 INFO L93 Difference]: Finished difference Result 297 states and 436 transitions. [2019-09-09 05:54:20,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:20,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-09 05:54:20,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:20,401 INFO L225 Difference]: With dead ends: 297 [2019-09-09 05:54:20,401 INFO L226 Difference]: Without dead ends: 297 [2019-09-09 05:54:20,401 INFO L628 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-09 05:54:20,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-09 05:54:20,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 233. [2019-09-09 05:54:20,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-09 05:54:20,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 350 transitions. [2019-09-09 05:54:20,407 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 350 transitions. Word has length 87 [2019-09-09 05:54:20,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:20,408 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 350 transitions. [2019-09-09 05:54:20,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 350 transitions. [2019-09-09 05:54:20,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-09 05:54:20,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:20,409 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:20,410 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:20,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:20,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1949910134, now seen corresponding path program 1 times [2019-09-09 05:54:20,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:20,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:20,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:20,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:20,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:20,467 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-09 05:54:20,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:20,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:20,467 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:20,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:20,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:20,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:20,468 INFO L87 Difference]: Start difference. First operand 233 states and 350 transitions. Second operand 4 states. [2019-09-09 05:54:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:20,764 INFO L93 Difference]: Finished difference Result 281 states and 421 transitions. [2019-09-09 05:54:20,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:20,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-09 05:54:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:20,766 INFO L225 Difference]: With dead ends: 281 [2019-09-09 05:54:20,767 INFO L226 Difference]: Without dead ends: 281 [2019-09-09 05:54:20,767 INFO L628 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-09 05:54:20,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-09 05:54:20,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 257. [2019-09-09 05:54:20,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-09 05:54:20,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 391 transitions. [2019-09-09 05:54:20,774 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 391 transitions. Word has length 87 [2019-09-09 05:54:20,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:20,774 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 391 transitions. [2019-09-09 05:54:20,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:20,774 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 391 transitions. [2019-09-09 05:54:20,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-09 05:54:20,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:20,776 INFO L399 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-09 05:54:20,776 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:20,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:20,776 INFO L82 PathProgramCache]: Analyzing trace with hash -942801744, now seen corresponding path program 1 times [2019-09-09 05:54:20,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:20,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:20,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:20,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:20,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:20,879 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-09 05:54:20,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:20,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:20,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:20,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:20,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:20,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:20,881 INFO L87 Difference]: Start difference. First operand 257 states and 391 transitions. Second operand 4 states. [2019-09-09 05:54:21,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:21,412 INFO L93 Difference]: Finished difference Result 314 states and 467 transitions. [2019-09-09 05:54:21,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:21,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-09 05:54:21,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:21,419 INFO L225 Difference]: With dead ends: 314 [2019-09-09 05:54:21,419 INFO L226 Difference]: Without dead ends: 314 [2019-09-09 05:54:21,420 INFO L628 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-09 05:54:21,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-09 05:54:21,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 258. [2019-09-09 05:54:21,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-09 05:54:21,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 392 transitions. [2019-09-09 05:54:21,431 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 392 transitions. Word has length 88 [2019-09-09 05:54:21,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:21,432 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 392 transitions. [2019-09-09 05:54:21,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:21,433 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 392 transitions. [2019-09-09 05:54:21,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-09 05:54:21,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:21,435 INFO L399 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] [2019-09-09 05:54:21,435 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:21,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:21,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1170319121, now seen corresponding path program 1 times [2019-09-09 05:54:21,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:21,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:21,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:21,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:21,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:21,524 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-09 05:54:21,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:21,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:21,525 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:21,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:21,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:21,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:21,527 INFO L87 Difference]: Start difference. First operand 258 states and 392 transitions. Second operand 4 states. [2019-09-09 05:54:21,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:21,917 INFO L93 Difference]: Finished difference Result 314 states and 466 transitions. [2019-09-09 05:54:21,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:21,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-09 05:54:21,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:21,922 INFO L225 Difference]: With dead ends: 314 [2019-09-09 05:54:21,922 INFO L226 Difference]: Without dead ends: 314 [2019-09-09 05:54:21,922 INFO L628 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-09 05:54:21,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-09 05:54:21,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 258. [2019-09-09 05:54:21,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-09 05:54:21,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 391 transitions. [2019-09-09 05:54:21,929 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 391 transitions. Word has length 100 [2019-09-09 05:54:21,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:21,930 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 391 transitions. [2019-09-09 05:54:21,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:21,930 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 391 transitions. [2019-09-09 05:54:21,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-09 05:54:21,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:21,931 INFO L399 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] [2019-09-09 05:54:21,932 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:21,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:21,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1614219795, now seen corresponding path program 1 times [2019-09-09 05:54:21,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:21,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:21,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:21,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:21,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:21,995 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-09 05:54:21,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:21,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:21,996 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:21,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:21,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:21,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:21,997 INFO L87 Difference]: Start difference. First operand 258 states and 391 transitions. Second operand 4 states. [2019-09-09 05:54:22,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:22,321 INFO L93 Difference]: Finished difference Result 282 states and 420 transitions. [2019-09-09 05:54:22,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:22,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-09 05:54:22,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:22,325 INFO L225 Difference]: With dead ends: 282 [2019-09-09 05:54:22,325 INFO L226 Difference]: Without dead ends: 282 [2019-09-09 05:54:22,326 INFO L628 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-09 05:54:22,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-09 05:54:22,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 258. [2019-09-09 05:54:22,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-09 05:54:22,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 390 transitions. [2019-09-09 05:54:22,337 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 390 transitions. Word has length 100 [2019-09-09 05:54:22,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:22,337 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 390 transitions. [2019-09-09 05:54:22,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:22,338 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 390 transitions. [2019-09-09 05:54:22,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 05:54:22,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:22,340 INFO L399 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] [2019-09-09 05:54:22,340 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:22,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:22,341 INFO L82 PathProgramCache]: Analyzing trace with hash 990791377, now seen corresponding path program 1 times [2019-09-09 05:54:22,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:22,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:22,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:22,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:22,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:22,448 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-09 05:54:22,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:22,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:22,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:22,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:22,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:22,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:22,452 INFO L87 Difference]: Start difference. First operand 258 states and 390 transitions. Second operand 4 states. [2019-09-09 05:54:22,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:22,962 INFO L93 Difference]: Finished difference Result 313 states and 463 transitions. [2019-09-09 05:54:22,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:22,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-09 05:54:22,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:22,965 INFO L225 Difference]: With dead ends: 313 [2019-09-09 05:54:22,965 INFO L226 Difference]: Without dead ends: 313 [2019-09-09 05:54:22,966 INFO L628 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-09 05:54:22,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-09 05:54:22,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 258. [2019-09-09 05:54:22,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-09 05:54:22,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 389 transitions. [2019-09-09 05:54:22,974 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 389 transitions. Word has length 101 [2019-09-09 05:54:22,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:22,975 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 389 transitions. [2019-09-09 05:54:22,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:22,975 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 389 transitions. [2019-09-09 05:54:22,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 05:54:22,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:22,977 INFO L399 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] [2019-09-09 05:54:22,977 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:22,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:22,977 INFO L82 PathProgramCache]: Analyzing trace with hash 850064690, now seen corresponding path program 1 times [2019-09-09 05:54:22,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:22,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:22,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:22,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:22,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:23,116 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-09 05:54:23,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:23,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:23,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:23,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:23,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:23,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:23,117 INFO L87 Difference]: Start difference. First operand 258 states and 389 transitions. Second operand 4 states. [2019-09-09 05:54:23,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:23,490 INFO L93 Difference]: Finished difference Result 311 states and 460 transitions. [2019-09-09 05:54:23,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:23,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-09 05:54:23,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:23,493 INFO L225 Difference]: With dead ends: 311 [2019-09-09 05:54:23,493 INFO L226 Difference]: Without dead ends: 311 [2019-09-09 05:54:23,493 INFO L628 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-09 05:54:23,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-09 05:54:23,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 258. [2019-09-09 05:54:23,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-09 05:54:23,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 388 transitions. [2019-09-09 05:54:23,500 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 388 transitions. Word has length 101 [2019-09-09 05:54:23,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:23,500 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 388 transitions. [2019-09-09 05:54:23,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:23,500 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 388 transitions. [2019-09-09 05:54:23,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 05:54:23,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:23,502 INFO L399 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] [2019-09-09 05:54:23,502 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:23,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:23,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1866810383, now seen corresponding path program 1 times [2019-09-09 05:54:23,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:23,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:23,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:23,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:23,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:23,558 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-09 05:54:23,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:23,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:23,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:23,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:23,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:23,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:23,560 INFO L87 Difference]: Start difference. First operand 258 states and 388 transitions. Second operand 4 states. [2019-09-09 05:54:23,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:23,838 INFO L93 Difference]: Finished difference Result 281 states and 416 transitions. [2019-09-09 05:54:23,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:23,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-09 05:54:23,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:23,840 INFO L225 Difference]: With dead ends: 281 [2019-09-09 05:54:23,840 INFO L226 Difference]: Without dead ends: 281 [2019-09-09 05:54:23,841 INFO L628 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-09 05:54:23,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-09 05:54:23,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 258. [2019-09-09 05:54:23,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-09 05:54:23,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 387 transitions. [2019-09-09 05:54:23,847 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 387 transitions. Word has length 101 [2019-09-09 05:54:23,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:23,847 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 387 transitions. [2019-09-09 05:54:23,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:23,847 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 387 transitions. [2019-09-09 05:54:23,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 05:54:23,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:23,849 INFO L399 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] [2019-09-09 05:54:23,849 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:23,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:23,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1726083696, now seen corresponding path program 1 times [2019-09-09 05:54:23,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:23,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:23,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:23,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:23,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:23,912 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-09 05:54:23,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:23,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:23,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:23,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:23,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:23,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:23,914 INFO L87 Difference]: Start difference. First operand 258 states and 387 transitions. Second operand 4 states. [2019-09-09 05:54:24,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:24,233 INFO L93 Difference]: Finished difference Result 279 states and 413 transitions. [2019-09-09 05:54:24,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:24,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-09 05:54:24,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:24,238 INFO L225 Difference]: With dead ends: 279 [2019-09-09 05:54:24,238 INFO L226 Difference]: Without dead ends: 279 [2019-09-09 05:54:24,239 INFO L628 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-09 05:54:24,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-09-09 05:54:24,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 258. [2019-09-09 05:54:24,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-09 05:54:24,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 386 transitions. [2019-09-09 05:54:24,244 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 386 transitions. Word has length 101 [2019-09-09 05:54:24,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:24,245 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 386 transitions. [2019-09-09 05:54:24,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:24,245 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 386 transitions. [2019-09-09 05:54:24,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:54:24,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:24,246 INFO L399 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] [2019-09-09 05:54:24,247 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:24,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:24,247 INFO L82 PathProgramCache]: Analyzing trace with hash -2121920524, now seen corresponding path program 1 times [2019-09-09 05:54:24,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:24,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:24,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:24,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:24,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:24,306 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-09 05:54:24,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:24,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:24,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:24,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:24,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:24,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:24,308 INFO L87 Difference]: Start difference. First operand 258 states and 386 transitions. Second operand 4 states. [2019-09-09 05:54:24,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:24,698 INFO L93 Difference]: Finished difference Result 311 states and 457 transitions. [2019-09-09 05:54:24,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:24,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-09 05:54:24,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:24,702 INFO L225 Difference]: With dead ends: 311 [2019-09-09 05:54:24,702 INFO L226 Difference]: Without dead ends: 311 [2019-09-09 05:54:24,702 INFO L628 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-09 05:54:24,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-09 05:54:24,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 258. [2019-09-09 05:54:24,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-09 05:54:24,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 385 transitions. [2019-09-09 05:54:24,708 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 385 transitions. Word has length 102 [2019-09-09 05:54:24,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:24,708 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 385 transitions. [2019-09-09 05:54:24,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:24,709 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 385 transitions. [2019-09-09 05:54:24,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:54:24,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:24,710 INFO L399 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] [2019-09-09 05:54:24,710 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:24,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:24,711 INFO L82 PathProgramCache]: Analyzing trace with hash -735135114, now seen corresponding path program 1 times [2019-09-09 05:54:24,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:24,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:24,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:24,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:24,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:24,789 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-09 05:54:24,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:24,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:24,789 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:24,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:24,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:24,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:24,790 INFO L87 Difference]: Start difference. First operand 258 states and 385 transitions. Second operand 4 states. [2019-09-09 05:54:25,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:25,028 INFO L93 Difference]: Finished difference Result 279 states and 411 transitions. [2019-09-09 05:54:25,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:25,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-09 05:54:25,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:25,030 INFO L225 Difference]: With dead ends: 279 [2019-09-09 05:54:25,031 INFO L226 Difference]: Without dead ends: 279 [2019-09-09 05:54:25,031 INFO L628 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-09 05:54:25,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-09-09 05:54:25,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 258. [2019-09-09 05:54:25,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-09 05:54:25,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 384 transitions. [2019-09-09 05:54:25,037 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 384 transitions. Word has length 102 [2019-09-09 05:54:25,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:25,037 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 384 transitions. [2019-09-09 05:54:25,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:25,038 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 384 transitions. [2019-09-09 05:54:25,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:54:25,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:25,039 INFO L399 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] [2019-09-09 05:54:25,039 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:25,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:25,039 INFO L82 PathProgramCache]: Analyzing trace with hash -336228203, now seen corresponding path program 1 times [2019-09-09 05:54:25,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:25,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:25,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:25,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:25,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:25,094 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-09 05:54:25,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:25,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:25,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:25,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:25,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:25,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:25,095 INFO L87 Difference]: Start difference. First operand 258 states and 384 transitions. Second operand 4 states. [2019-09-09 05:54:25,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:25,448 INFO L93 Difference]: Finished difference Result 311 states and 455 transitions. [2019-09-09 05:54:25,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:25,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-09 05:54:25,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:25,450 INFO L225 Difference]: With dead ends: 311 [2019-09-09 05:54:25,451 INFO L226 Difference]: Without dead ends: 311 [2019-09-09 05:54:25,451 INFO L628 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-09 05:54:25,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-09 05:54:25,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 258. [2019-09-09 05:54:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-09 05:54:25,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 383 transitions. [2019-09-09 05:54:25,457 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 383 transitions. Word has length 103 [2019-09-09 05:54:25,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:25,458 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 383 transitions. [2019-09-09 05:54:25,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:25,458 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 383 transitions. [2019-09-09 05:54:25,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:54:25,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:25,459 INFO L399 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] [2019-09-09 05:54:25,459 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:25,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:25,460 INFO L82 PathProgramCache]: Analyzing trace with hash -295553453, now seen corresponding path program 1 times [2019-09-09 05:54:25,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:25,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:25,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:25,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:25,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:25,550 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-09 05:54:25,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:25,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:25,551 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:25,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:25,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:25,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:25,553 INFO L87 Difference]: Start difference. First operand 258 states and 383 transitions. Second operand 4 states. [2019-09-09 05:54:25,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:25,850 INFO L93 Difference]: Finished difference Result 279 states and 409 transitions. [2019-09-09 05:54:25,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:25,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-09 05:54:25,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:25,852 INFO L225 Difference]: With dead ends: 279 [2019-09-09 05:54:25,852 INFO L226 Difference]: Without dead ends: 279 [2019-09-09 05:54:25,852 INFO L628 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-09 05:54:25,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-09-09 05:54:25,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 258. [2019-09-09 05:54:25,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-09 05:54:25,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 382 transitions. [2019-09-09 05:54:25,858 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 382 transitions. Word has length 103 [2019-09-09 05:54:25,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:25,858 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 382 transitions. [2019-09-09 05:54:25,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:25,859 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 382 transitions. [2019-09-09 05:54:25,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:54:25,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:25,860 INFO L399 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] [2019-09-09 05:54:25,860 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:25,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:25,861 INFO L82 PathProgramCache]: Analyzing trace with hash 450421593, now seen corresponding path program 1 times [2019-09-09 05:54:25,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:25,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:25,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:25,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:25,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:25,921 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-09 05:54:25,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:25,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:25,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:25,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:25,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:25,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:25,923 INFO L87 Difference]: Start difference. First operand 258 states and 382 transitions. Second operand 4 states. [2019-09-09 05:54:26,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:26,306 INFO L93 Difference]: Finished difference Result 311 states and 453 transitions. [2019-09-09 05:54:26,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:26,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-09 05:54:26,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:26,309 INFO L225 Difference]: With dead ends: 311 [2019-09-09 05:54:26,309 INFO L226 Difference]: Without dead ends: 311 [2019-09-09 05:54:26,310 INFO L628 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-09 05:54:26,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-09 05:54:26,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 258. [2019-09-09 05:54:26,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-09 05:54:26,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 381 transitions. [2019-09-09 05:54:26,316 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 381 transitions. Word has length 104 [2019-09-09 05:54:26,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:26,317 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 381 transitions. [2019-09-09 05:54:26,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:26,317 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 381 transitions. [2019-09-09 05:54:26,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:54:26,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:26,318 INFO L399 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] [2019-09-09 05:54:26,318 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:26,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:26,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1711338843, now seen corresponding path program 1 times [2019-09-09 05:54:26,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:26,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:26,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:26,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:26,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:26,423 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-09 05:54:26,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:26,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:26,424 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:26,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:26,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:26,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:26,425 INFO L87 Difference]: Start difference. First operand 258 states and 381 transitions. Second operand 4 states. [2019-09-09 05:54:26,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:26,693 INFO L93 Difference]: Finished difference Result 279 states and 407 transitions. [2019-09-09 05:54:26,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:26,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-09 05:54:26,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:26,695 INFO L225 Difference]: With dead ends: 279 [2019-09-09 05:54:26,695 INFO L226 Difference]: Without dead ends: 279 [2019-09-09 05:54:26,696 INFO L628 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-09 05:54:26,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-09-09 05:54:26,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 258. [2019-09-09 05:54:26,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-09 05:54:26,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 380 transitions. [2019-09-09 05:54:26,701 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 380 transitions. Word has length 104 [2019-09-09 05:54:26,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:26,701 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 380 transitions. [2019-09-09 05:54:26,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:26,701 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 380 transitions. [2019-09-09 05:54:26,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:54:26,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:26,703 INFO L399 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] [2019-09-09 05:54:26,703 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:26,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:26,703 INFO L82 PathProgramCache]: Analyzing trace with hash 331524186, now seen corresponding path program 1 times [2019-09-09 05:54:26,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:26,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:26,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:26,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:26,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:26,765 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-09 05:54:26,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:26,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:26,765 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:26,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:26,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:26,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:26,766 INFO L87 Difference]: Start difference. First operand 258 states and 380 transitions. Second operand 4 states. [2019-09-09 05:54:27,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:27,116 INFO L93 Difference]: Finished difference Result 301 states and 439 transitions. [2019-09-09 05:54:27,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:27,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-09 05:54:27,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:27,118 INFO L225 Difference]: With dead ends: 301 [2019-09-09 05:54:27,118 INFO L226 Difference]: Without dead ends: 301 [2019-09-09 05:54:27,118 INFO L628 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-09 05:54:27,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-09-09 05:54:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 258. [2019-09-09 05:54:27,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-09 05:54:27,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 379 transitions. [2019-09-09 05:54:27,124 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 379 transitions. Word has length 105 [2019-09-09 05:54:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:27,124 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 379 transitions. [2019-09-09 05:54:27,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:27,124 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 379 transitions. [2019-09-09 05:54:27,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:54:27,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:27,125 INFO L399 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] [2019-09-09 05:54:27,126 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:27,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:27,126 INFO L82 PathProgramCache]: Analyzing trace with hash 765253272, now seen corresponding path program 1 times [2019-09-09 05:54:27,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:27,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:27,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:27,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:27,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:27,190 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-09 05:54:27,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:27,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:27,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:27,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:27,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:27,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:27,192 INFO L87 Difference]: Start difference. First operand 258 states and 379 transitions. Second operand 4 states. [2019-09-09 05:54:27,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:27,442 INFO L93 Difference]: Finished difference Result 269 states and 393 transitions. [2019-09-09 05:54:27,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:27,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-09 05:54:27,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:27,444 INFO L225 Difference]: With dead ends: 269 [2019-09-09 05:54:27,444 INFO L226 Difference]: Without dead ends: 269 [2019-09-09 05:54:27,444 INFO L628 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-09 05:54:27,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-09 05:54:27,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 258. [2019-09-09 05:54:27,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-09 05:54:27,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 378 transitions. [2019-09-09 05:54:27,449 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 378 transitions. Word has length 105 [2019-09-09 05:54:27,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:27,450 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 378 transitions. [2019-09-09 05:54:27,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:27,450 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 378 transitions. [2019-09-09 05:54:27,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-09 05:54:27,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:27,451 INFO L399 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] [2019-09-09 05:54:27,451 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:27,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:27,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1993514386, now seen corresponding path program 1 times [2019-09-09 05:54:27,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:27,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:27,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:27,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:27,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:27,514 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-09 05:54:27,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:27,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:27,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:27,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:27,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:27,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:27,516 INFO L87 Difference]: Start difference. First operand 258 states and 378 transitions. Second operand 4 states. [2019-09-09 05:54:27,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:27,926 INFO L93 Difference]: Finished difference Result 301 states and 437 transitions. [2019-09-09 05:54:27,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:27,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-09-09 05:54:27,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:27,928 INFO L225 Difference]: With dead ends: 301 [2019-09-09 05:54:27,928 INFO L226 Difference]: Without dead ends: 301 [2019-09-09 05:54:27,928 INFO L628 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-09 05:54:27,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-09-09 05:54:27,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 258. [2019-09-09 05:54:27,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-09 05:54:27,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 377 transitions. [2019-09-09 05:54:27,933 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 377 transitions. Word has length 109 [2019-09-09 05:54:27,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:27,933 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 377 transitions. [2019-09-09 05:54:27,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:27,933 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 377 transitions. [2019-09-09 05:54:27,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-09 05:54:27,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:27,935 INFO L399 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] [2019-09-09 05:54:27,935 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:27,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:27,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1314242132, now seen corresponding path program 1 times [2019-09-09 05:54:27,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:27,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:27,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:27,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:27,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:27,999 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-09 05:54:28,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:28,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:54:28,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:28,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:28,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:28,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:28,001 INFO L87 Difference]: Start difference. First operand 258 states and 377 transitions. Second operand 3 states. [2019-09-09 05:54:28,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:28,033 INFO L93 Difference]: Finished difference Result 489 states and 720 transitions. [2019-09-09 05:54:28,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:28,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-09 05:54:28,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:28,035 INFO L225 Difference]: With dead ends: 489 [2019-09-09 05:54:28,036 INFO L226 Difference]: Without dead ends: 489 [2019-09-09 05:54:28,036 INFO L628 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-09 05:54:28,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-09-09 05:54:28,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2019-09-09 05:54:28,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-09-09 05:54:28,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 720 transitions. [2019-09-09 05:54:28,048 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 720 transitions. Word has length 109 [2019-09-09 05:54:28,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:28,049 INFO L475 AbstractCegarLoop]: Abstraction has 489 states and 720 transitions. [2019-09-09 05:54:28,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:28,050 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 720 transitions. [2019-09-09 05:54:28,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-09 05:54:28,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:28,091 INFO L399 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] [2019-09-09 05:54:28,092 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:28,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:28,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1497455874, now seen corresponding path program 1 times [2019-09-09 05:54:28,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:28,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:28,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:28,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:28,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:28,163 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-09 05:54:28,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:28,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:28,163 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:28,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:28,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:28,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:28,164 INFO L87 Difference]: Start difference. First operand 489 states and 720 transitions. Second operand 4 states. [2019-09-09 05:54:28,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:28,621 INFO L93 Difference]: Finished difference Result 693 states and 1029 transitions. [2019-09-09 05:54:28,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:28,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-09 05:54:28,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:28,626 INFO L225 Difference]: With dead ends: 693 [2019-09-09 05:54:28,627 INFO L226 Difference]: Without dead ends: 693 [2019-09-09 05:54:28,627 INFO L628 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-09 05:54:28,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2019-09-09 05:54:28,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 567. [2019-09-09 05:54:28,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-09-09 05:54:28,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 862 transitions. [2019-09-09 05:54:28,637 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 862 transitions. Word has length 128 [2019-09-09 05:54:28,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:28,637 INFO L475 AbstractCegarLoop]: Abstraction has 567 states and 862 transitions. [2019-09-09 05:54:28,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:28,637 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 862 transitions. [2019-09-09 05:54:28,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-09 05:54:28,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:28,639 INFO L399 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] [2019-09-09 05:54:28,639 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:28,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:28,640 INFO L82 PathProgramCache]: Analyzing trace with hash 622025150, now seen corresponding path program 1 times [2019-09-09 05:54:28,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:28,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:28,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:28,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:28,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:28,713 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-09 05:54:28,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:28,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:28,713 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:28,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:28,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:28,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:28,714 INFO L87 Difference]: Start difference. First operand 567 states and 862 transitions. Second operand 4 states. [2019-09-09 05:54:29,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:29,180 INFO L93 Difference]: Finished difference Result 681 states and 1012 transitions. [2019-09-09 05:54:29,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:29,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-09 05:54:29,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:29,185 INFO L225 Difference]: With dead ends: 681 [2019-09-09 05:54:29,186 INFO L226 Difference]: Without dead ends: 681 [2019-09-09 05:54:29,186 INFO L628 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-09 05:54:29,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-09-09 05:54:29,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 537. [2019-09-09 05:54:29,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-09-09 05:54:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 804 transitions. [2019-09-09 05:54:29,200 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 804 transitions. Word has length 129 [2019-09-09 05:54:29,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:29,201 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 804 transitions. [2019-09-09 05:54:29,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:29,201 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 804 transitions. [2019-09-09 05:54:29,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-09 05:54:29,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:29,204 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:29,204 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:29,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:29,204 INFO L82 PathProgramCache]: Analyzing trace with hash -2012356833, now seen corresponding path program 1 times [2019-09-09 05:54:29,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:29,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:29,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:29,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:29,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:29,300 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:29,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:29,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:29,301 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:29,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:29,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:29,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:29,302 INFO L87 Difference]: Start difference. First operand 537 states and 804 transitions. Second operand 4 states. [2019-09-09 05:54:29,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:29,749 INFO L93 Difference]: Finished difference Result 681 states and 1010 transitions. [2019-09-09 05:54:29,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:29,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-09 05:54:29,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:29,754 INFO L225 Difference]: With dead ends: 681 [2019-09-09 05:54:29,754 INFO L226 Difference]: Without dead ends: 681 [2019-09-09 05:54:29,754 INFO L628 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-09 05:54:29,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-09-09 05:54:29,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 537. [2019-09-09 05:54:29,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-09-09 05:54:29,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 802 transitions. [2019-09-09 05:54:29,764 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 802 transitions. Word has length 141 [2019-09-09 05:54:29,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:29,764 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 802 transitions. [2019-09-09 05:54:29,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:29,764 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 802 transitions. [2019-09-09 05:54:29,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-09 05:54:29,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:29,766 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:29,766 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:29,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:29,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1112084611, now seen corresponding path program 1 times [2019-09-09 05:54:29,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:29,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:29,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:29,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:29,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:29,833 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:29,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:29,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:29,834 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:29,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:29,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:29,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:29,835 INFO L87 Difference]: Start difference. First operand 537 states and 802 transitions. Second operand 4 states. [2019-09-09 05:54:30,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:30,287 INFO L93 Difference]: Finished difference Result 679 states and 1006 transitions. [2019-09-09 05:54:30,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:30,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-09 05:54:30,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:30,292 INFO L225 Difference]: With dead ends: 679 [2019-09-09 05:54:30,292 INFO L226 Difference]: Without dead ends: 679 [2019-09-09 05:54:30,292 INFO L628 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-09 05:54:30,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2019-09-09 05:54:30,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 537. [2019-09-09 05:54:30,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-09-09 05:54:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 800 transitions. [2019-09-09 05:54:30,301 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 800 transitions. Word has length 142 [2019-09-09 05:54:30,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:30,301 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 800 transitions. [2019-09-09 05:54:30,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:30,302 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 800 transitions. [2019-09-09 05:54:30,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-09 05:54:30,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:30,303 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:30,304 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:30,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:30,304 INFO L82 PathProgramCache]: Analyzing trace with hash 971357924, now seen corresponding path program 1 times [2019-09-09 05:54:30,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:30,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:30,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:30,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:30,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:30,383 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:30,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:30,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:30,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:30,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:30,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:30,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:30,385 INFO L87 Difference]: Start difference. First operand 537 states and 800 transitions. Second operand 4 states. [2019-09-09 05:54:30,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:30,777 INFO L93 Difference]: Finished difference Result 675 states and 1000 transitions. [2019-09-09 05:54:30,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:30,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-09 05:54:30,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:30,780 INFO L225 Difference]: With dead ends: 675 [2019-09-09 05:54:30,780 INFO L226 Difference]: Without dead ends: 675 [2019-09-09 05:54:30,780 INFO L628 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-09 05:54:30,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-09-09 05:54:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 537. [2019-09-09 05:54:30,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-09-09 05:54:30,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 798 transitions. [2019-09-09 05:54:30,789 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 798 transitions. Word has length 142 [2019-09-09 05:54:30,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:30,790 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 798 transitions. [2019-09-09 05:54:30,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:30,790 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 798 transitions. [2019-09-09 05:54:30,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-09 05:54:30,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:30,792 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:30,792 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:30,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:30,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1638169730, now seen corresponding path program 1 times [2019-09-09 05:54:30,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:30,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:30,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:30,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:30,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:30,859 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:30,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:30,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:30,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:30,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:30,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:30,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:30,861 INFO L87 Difference]: Start difference. First operand 537 states and 798 transitions. Second operand 4 states. [2019-09-09 05:54:31,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:31,276 INFO L93 Difference]: Finished difference Result 675 states and 998 transitions. [2019-09-09 05:54:31,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:31,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-09 05:54:31,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:31,281 INFO L225 Difference]: With dead ends: 675 [2019-09-09 05:54:31,281 INFO L226 Difference]: Without dead ends: 675 [2019-09-09 05:54:31,281 INFO L628 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-09 05:54:31,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-09-09 05:54:31,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 537. [2019-09-09 05:54:31,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-09-09 05:54:31,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 796 transitions. [2019-09-09 05:54:31,290 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 796 transitions. Word has length 143 [2019-09-09 05:54:31,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:31,290 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 796 transitions. [2019-09-09 05:54:31,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:31,291 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 796 transitions. [2019-09-09 05:54:31,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-09 05:54:31,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:31,293 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:31,293 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:31,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:31,293 INFO L82 PathProgramCache]: Analyzing trace with hash 262452679, now seen corresponding path program 1 times [2019-09-09 05:54:31,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:31,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:31,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:31,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:31,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:31,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:31,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:31,365 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:31,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:31,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:31,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:31,365 INFO L87 Difference]: Start difference. First operand 537 states and 796 transitions. Second operand 4 states. [2019-09-09 05:54:31,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:31,774 INFO L93 Difference]: Finished difference Result 675 states and 996 transitions. [2019-09-09 05:54:31,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:31,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-09-09 05:54:31,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:31,779 INFO L225 Difference]: With dead ends: 675 [2019-09-09 05:54:31,780 INFO L226 Difference]: Without dead ends: 675 [2019-09-09 05:54:31,780 INFO L628 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-09 05:54:31,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-09-09 05:54:31,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 537. [2019-09-09 05:54:31,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-09-09 05:54:31,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 794 transitions. [2019-09-09 05:54:31,788 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 794 transitions. Word has length 144 [2019-09-09 05:54:31,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:31,789 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 794 transitions. [2019-09-09 05:54:31,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:31,789 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 794 transitions. [2019-09-09 05:54:31,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-09 05:54:31,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:31,791 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:31,791 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:31,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:31,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1829659751, now seen corresponding path program 1 times [2019-09-09 05:54:31,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:31,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:31,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:31,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:31,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:31,883 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:31,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:31,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:31,883 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:31,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:31,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:31,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:31,884 INFO L87 Difference]: Start difference. First operand 537 states and 794 transitions. Second operand 4 states. [2019-09-09 05:54:32,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:32,299 INFO L93 Difference]: Finished difference Result 675 states and 994 transitions. [2019-09-09 05:54:32,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:32,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-09 05:54:32,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:32,304 INFO L225 Difference]: With dead ends: 675 [2019-09-09 05:54:32,304 INFO L226 Difference]: Without dead ends: 675 [2019-09-09 05:54:32,304 INFO L628 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-09 05:54:32,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-09-09 05:54:32,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 537. [2019-09-09 05:54:32,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-09-09 05:54:32,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 792 transitions. [2019-09-09 05:54:32,313 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 792 transitions. Word has length 145 [2019-09-09 05:54:32,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:32,313 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 792 transitions. [2019-09-09 05:54:32,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:32,313 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 792 transitions. [2019-09-09 05:54:32,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-09 05:54:32,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:32,315 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:32,315 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:32,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:32,316 INFO L82 PathProgramCache]: Analyzing trace with hash 138234124, now seen corresponding path program 1 times [2019-09-09 05:54:32,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:32,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:32,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:32,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:32,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:32,378 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:32,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:32,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:32,379 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:32,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:32,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:32,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:32,380 INFO L87 Difference]: Start difference. First operand 537 states and 792 transitions. Second operand 4 states. [2019-09-09 05:54:32,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:32,773 INFO L93 Difference]: Finished difference Result 655 states and 968 transitions. [2019-09-09 05:54:32,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:32,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-09-09 05:54:32,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:32,777 INFO L225 Difference]: With dead ends: 655 [2019-09-09 05:54:32,778 INFO L226 Difference]: Without dead ends: 655 [2019-09-09 05:54:32,778 INFO L628 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-09 05:54:32,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-09-09 05:54:32,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 537. [2019-09-09 05:54:32,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-09-09 05:54:32,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 790 transitions. [2019-09-09 05:54:32,786 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 790 transitions. Word has length 146 [2019-09-09 05:54:32,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:32,786 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 790 transitions. [2019-09-09 05:54:32,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 790 transitions. [2019-09-09 05:54:32,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-09 05:54:32,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:32,788 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:32,789 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:32,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:32,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1994106336, now seen corresponding path program 1 times [2019-09-09 05:54:32,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:32,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:32,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:32,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:32,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:32,867 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:32,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:32,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:32,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:32,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:32,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:32,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:32,868 INFO L87 Difference]: Start difference. First operand 537 states and 790 transitions. Second operand 4 states. [2019-09-09 05:54:33,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:33,255 INFO L93 Difference]: Finished difference Result 655 states and 966 transitions. [2019-09-09 05:54:33,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:33,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-09 05:54:33,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:33,260 INFO L225 Difference]: With dead ends: 655 [2019-09-09 05:54:33,260 INFO L226 Difference]: Without dead ends: 655 [2019-09-09 05:54:33,260 INFO L628 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-09 05:54:33,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-09-09 05:54:33,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 489. [2019-09-09 05:54:33,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-09-09 05:54:33,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 720 transitions. [2019-09-09 05:54:33,266 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 720 transitions. Word has length 150 [2019-09-09 05:54:33,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:33,267 INFO L475 AbstractCegarLoop]: Abstraction has 489 states and 720 transitions. [2019-09-09 05:54:33,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 720 transitions. [2019-09-09 05:54:33,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-09 05:54:33,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:33,269 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:33,269 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:33,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:33,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1805395323, now seen corresponding path program 1 times [2019-09-09 05:54:33,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:33,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:33,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:33,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:33,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:33,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:33,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:33,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:33,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:33,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:33,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:33,350 INFO L87 Difference]: Start difference. First operand 489 states and 720 transitions. Second operand 4 states. [2019-09-09 05:54:33,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:33,728 INFO L93 Difference]: Finished difference Result 647 states and 954 transitions. [2019-09-09 05:54:33,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:33,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-09-09 05:54:33,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:33,732 INFO L225 Difference]: With dead ends: 647 [2019-09-09 05:54:33,732 INFO L226 Difference]: Without dead ends: 647 [2019-09-09 05:54:33,733 INFO L628 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-09 05:54:33,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-09-09 05:54:33,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 539. [2019-09-09 05:54:33,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-09-09 05:54:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 790 transitions. [2019-09-09 05:54:33,740 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 790 transitions. Word has length 151 [2019-09-09 05:54:33,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:33,741 INFO L475 AbstractCegarLoop]: Abstraction has 539 states and 790 transitions. [2019-09-09 05:54:33,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:33,741 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 790 transitions. [2019-09-09 05:54:33,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-09 05:54:33,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:33,743 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:33,743 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:33,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:33,743 INFO L82 PathProgramCache]: Analyzing trace with hash 369659868, now seen corresponding path program 1 times [2019-09-09 05:54:33,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:33,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:33,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:33,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:33,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:33,835 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:33,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:33,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:33,836 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:33,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:33,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:33,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:33,837 INFO L87 Difference]: Start difference. First operand 539 states and 790 transitions. Second operand 4 states. [2019-09-09 05:54:34,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:34,251 INFO L93 Difference]: Finished difference Result 647 states and 952 transitions. [2019-09-09 05:54:34,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:34,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-09 05:54:34,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:34,256 INFO L225 Difference]: With dead ends: 647 [2019-09-09 05:54:34,258 INFO L226 Difference]: Without dead ends: 647 [2019-09-09 05:54:34,259 INFO L628 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-09 05:54:34,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-09-09 05:54:34,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 545. [2019-09-09 05:54:34,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-09-09 05:54:34,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 800 transitions. [2019-09-09 05:54:34,266 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 800 transitions. Word has length 153 [2019-09-09 05:54:34,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:34,266 INFO L475 AbstractCegarLoop]: Abstraction has 545 states and 800 transitions. [2019-09-09 05:54:34,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:34,266 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 800 transitions. [2019-09-09 05:54:34,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-09 05:54:34,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:34,268 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:34,268 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:34,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:34,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1784521759, now seen corresponding path program 1 times [2019-09-09 05:54:34,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:34,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:34,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:34,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:34,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:34,353 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:34,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:34,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:34,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:34,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:34,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:34,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:34,357 INFO L87 Difference]: Start difference. First operand 545 states and 800 transitions. Second operand 4 states. [2019-09-09 05:54:34,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:34,732 INFO L93 Difference]: Finished difference Result 631 states and 924 transitions. [2019-09-09 05:54:34,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:34,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-09 05:54:34,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:34,736 INFO L225 Difference]: With dead ends: 631 [2019-09-09 05:54:34,736 INFO L226 Difference]: Without dead ends: 631 [2019-09-09 05:54:34,737 INFO L628 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-09 05:54:34,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-09-09 05:54:34,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 547. [2019-09-09 05:54:34,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-09 05:54:34,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 802 transitions. [2019-09-09 05:54:34,747 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 802 transitions. Word has length 154 [2019-09-09 05:54:34,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:34,747 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 802 transitions. [2019-09-09 05:54:34,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:34,748 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 802 transitions. [2019-09-09 05:54:34,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-09 05:54:34,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:34,749 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:34,750 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:34,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:34,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1442468738, now seen corresponding path program 1 times [2019-09-09 05:54:34,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:34,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:34,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:34,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:34,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:34,826 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:34,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:34,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:34,827 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:34,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:34,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:34,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:34,828 INFO L87 Difference]: Start difference. First operand 547 states and 802 transitions. Second operand 4 states. [2019-09-09 05:54:35,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:35,183 INFO L93 Difference]: Finished difference Result 631 states and 922 transitions. [2019-09-09 05:54:35,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:35,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-09 05:54:35,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:35,187 INFO L225 Difference]: With dead ends: 631 [2019-09-09 05:54:35,187 INFO L226 Difference]: Without dead ends: 631 [2019-09-09 05:54:35,188 INFO L628 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-09 05:54:35,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-09-09 05:54:35,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 549. [2019-09-09 05:54:35,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-09-09 05:54:35,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 804 transitions. [2019-09-09 05:54:35,195 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 804 transitions. Word has length 155 [2019-09-09 05:54:35,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:35,196 INFO L475 AbstractCegarLoop]: Abstraction has 549 states and 804 transitions. [2019-09-09 05:54:35,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:35,197 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 804 transitions. [2019-09-09 05:54:35,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-09 05:54:35,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:35,199 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:35,199 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:35,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:35,199 INFO L82 PathProgramCache]: Analyzing trace with hash -147724341, now seen corresponding path program 1 times [2019-09-09 05:54:35,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:35,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:35,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:35,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:35,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:35,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:35,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:35,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:35,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:35,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:35,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:35,279 INFO L87 Difference]: Start difference. First operand 549 states and 804 transitions. Second operand 4 states. [2019-09-09 05:54:35,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:35,607 INFO L93 Difference]: Finished difference Result 631 states and 920 transitions. [2019-09-09 05:54:35,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:35,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-09 05:54:35,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:35,611 INFO L225 Difference]: With dead ends: 631 [2019-09-09 05:54:35,611 INFO L226 Difference]: Without dead ends: 631 [2019-09-09 05:54:35,612 INFO L628 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-09 05:54:35,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-09-09 05:54:35,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 549. [2019-09-09 05:54:35,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-09-09 05:54:35,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 802 transitions. [2019-09-09 05:54:35,619 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 802 transitions. Word has length 156 [2019-09-09 05:54:35,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:35,619 INFO L475 AbstractCegarLoop]: Abstraction has 549 states and 802 transitions. [2019-09-09 05:54:35,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:35,619 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 802 transitions. [2019-09-09 05:54:35,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-09 05:54:35,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:35,621 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:35,621 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:35,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:35,621 INFO L82 PathProgramCache]: Analyzing trace with hash 980161255, now seen corresponding path program 1 times [2019-09-09 05:54:35,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:35,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:35,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:35,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:35,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:35,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:35,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:35,705 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:35,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:35,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:35,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:35,706 INFO L87 Difference]: Start difference. First operand 549 states and 802 transitions. Second operand 4 states. [2019-09-09 05:54:36,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:36,073 INFO L93 Difference]: Finished difference Result 627 states and 914 transitions. [2019-09-09 05:54:36,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:36,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-09 05:54:36,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:36,076 INFO L225 Difference]: With dead ends: 627 [2019-09-09 05:54:36,076 INFO L226 Difference]: Without dead ends: 627 [2019-09-09 05:54:36,077 INFO L628 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-09 05:54:36,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-09-09 05:54:36,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 551. [2019-09-09 05:54:36,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-09 05:54:36,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 804 transitions. [2019-09-09 05:54:36,086 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 804 transitions. Word has length 156 [2019-09-09 05:54:36,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:36,086 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 804 transitions. [2019-09-09 05:54:36,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:36,087 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 804 transitions. [2019-09-09 05:54:36,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-09 05:54:36,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:36,089 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:36,089 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:36,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:36,090 INFO L82 PathProgramCache]: Analyzing trace with hash 771032646, now seen corresponding path program 1 times [2019-09-09 05:54:36,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:36,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:36,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:36,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:36,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:36,174 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:36,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:36,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:36,174 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:36,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:36,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:36,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:36,175 INFO L87 Difference]: Start difference. First operand 551 states and 804 transitions. Second operand 4 states. [2019-09-09 05:54:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:36,493 INFO L93 Difference]: Finished difference Result 623 states and 906 transitions. [2019-09-09 05:54:36,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:36,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-09 05:54:36,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:36,498 INFO L225 Difference]: With dead ends: 623 [2019-09-09 05:54:36,498 INFO L226 Difference]: Without dead ends: 623 [2019-09-09 05:54:36,498 INFO L628 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-09 05:54:36,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-09 05:54:36,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 551. [2019-09-09 05:54:36,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-09 05:54:36,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 802 transitions. [2019-09-09 05:54:36,505 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 802 transitions. Word has length 157 [2019-09-09 05:54:36,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:36,506 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 802 transitions. [2019-09-09 05:54:36,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:36,507 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 802 transitions. [2019-09-09 05:54:36,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-09 05:54:36,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:36,508 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:36,508 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:36,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:36,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1245623140, now seen corresponding path program 1 times [2019-09-09 05:54:36,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:36,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:36,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:36,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:36,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:36,592 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:36,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:36,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:36,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:36,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:36,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:36,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:36,594 INFO L87 Difference]: Start difference. First operand 551 states and 802 transitions. Second operand 4 states. [2019-09-09 05:54:36,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:36,899 INFO L93 Difference]: Finished difference Result 617 states and 896 transitions. [2019-09-09 05:54:36,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:36,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-09 05:54:36,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:36,903 INFO L225 Difference]: With dead ends: 617 [2019-09-09 05:54:36,903 INFO L226 Difference]: Without dead ends: 617 [2019-09-09 05:54:36,904 INFO L628 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-09 05:54:36,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-09 05:54:36,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 553. [2019-09-09 05:54:36,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-09-09 05:54:36,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 804 transitions. [2019-09-09 05:54:36,909 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 804 transitions. Word has length 157 [2019-09-09 05:54:36,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:36,909 INFO L475 AbstractCegarLoop]: Abstraction has 553 states and 804 transitions. [2019-09-09 05:54:36,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:36,910 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 804 transitions. [2019-09-09 05:54:36,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-09 05:54:36,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:36,911 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:36,911 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:36,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:36,911 INFO L82 PathProgramCache]: Analyzing trace with hash -35238846, now seen corresponding path program 1 times [2019-09-09 05:54:36,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:36,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:36,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:36,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:36,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:36,978 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:36,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:36,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:36,979 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:36,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:36,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:36,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:36,980 INFO L87 Difference]: Start difference. First operand 553 states and 804 transitions. Second operand 4 states. [2019-09-09 05:54:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:37,281 INFO L93 Difference]: Finished difference Result 617 states and 894 transitions. [2019-09-09 05:54:37,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:37,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-09 05:54:37,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:37,284 INFO L225 Difference]: With dead ends: 617 [2019-09-09 05:54:37,284 INFO L226 Difference]: Without dead ends: 617 [2019-09-09 05:54:37,284 INFO L628 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-09 05:54:37,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-09 05:54:37,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 555. [2019-09-09 05:54:37,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-09-09 05:54:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 806 transitions. [2019-09-09 05:54:37,290 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 806 transitions. Word has length 159 [2019-09-09 05:54:37,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:37,290 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 806 transitions. [2019-09-09 05:54:37,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:37,290 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 806 transitions. [2019-09-09 05:54:37,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-09 05:54:37,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:37,292 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:37,292 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:37,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:37,292 INFO L82 PathProgramCache]: Analyzing trace with hash 953095010, now seen corresponding path program 1 times [2019-09-09 05:54:37,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:37,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:37,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:37,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:37,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:37,368 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:37,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:37,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:37,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:37,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:37,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:37,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:37,369 INFO L87 Difference]: Start difference. First operand 555 states and 806 transitions. Second operand 4 states. [2019-09-09 05:54:37,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:37,681 INFO L93 Difference]: Finished difference Result 609 states and 882 transitions. [2019-09-09 05:54:37,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:37,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-09 05:54:37,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:37,685 INFO L225 Difference]: With dead ends: 609 [2019-09-09 05:54:37,685 INFO L226 Difference]: Without dead ends: 609 [2019-09-09 05:54:37,685 INFO L628 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-09 05:54:37,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-09-09 05:54:37,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 557. [2019-09-09 05:54:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-09-09 05:54:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 808 transitions. [2019-09-09 05:54:37,692 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 808 transitions. Word has length 160 [2019-09-09 05:54:37,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:37,692 INFO L475 AbstractCegarLoop]: Abstraction has 557 states and 808 transitions. [2019-09-09 05:54:37,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:37,692 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 808 transitions. [2019-09-09 05:54:37,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-09 05:54:37,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:37,694 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:37,694 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:37,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:37,694 INFO L82 PathProgramCache]: Analyzing trace with hash -2074125903, now seen corresponding path program 1 times [2019-09-09 05:54:37,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:37,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:37,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:37,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:37,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:37,783 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:37,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:37,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:37,784 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:37,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:37,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:37,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:37,785 INFO L87 Difference]: Start difference. First operand 557 states and 808 transitions. Second operand 4 states. [2019-09-09 05:54:38,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:38,094 INFO L93 Difference]: Finished difference Result 609 states and 880 transitions. [2019-09-09 05:54:38,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:38,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-09 05:54:38,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:38,098 INFO L225 Difference]: With dead ends: 609 [2019-09-09 05:54:38,098 INFO L226 Difference]: Without dead ends: 609 [2019-09-09 05:54:38,098 INFO L628 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-09 05:54:38,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-09-09 05:54:38,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 559. [2019-09-09 05:54:38,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-09 05:54:38,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 810 transitions. [2019-09-09 05:54:38,104 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 810 transitions. Word has length 160 [2019-09-09 05:54:38,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:38,104 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 810 transitions. [2019-09-09 05:54:38,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:38,104 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 810 transitions. [2019-09-09 05:54:38,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-09 05:54:38,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:38,106 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:38,106 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:38,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:38,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1968548047, now seen corresponding path program 1 times [2019-09-09 05:54:38,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:38,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:38,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:38,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:38,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:38,178 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:38,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:38,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:38,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:38,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:38,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:38,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:38,180 INFO L87 Difference]: Start difference. First operand 559 states and 810 transitions. Second operand 4 states. [2019-09-09 05:54:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:38,472 INFO L93 Difference]: Finished difference Result 605 states and 874 transitions. [2019-09-09 05:54:38,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:38,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-09 05:54:38,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:38,477 INFO L225 Difference]: With dead ends: 605 [2019-09-09 05:54:38,477 INFO L226 Difference]: Without dead ends: 605 [2019-09-09 05:54:38,477 INFO L628 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-09 05:54:38,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-09-09 05:54:38,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 561. [2019-09-09 05:54:38,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-09-09 05:54:38,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 812 transitions. [2019-09-09 05:54:38,483 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 812 transitions. Word has length 161 [2019-09-09 05:54:38,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:38,483 INFO L475 AbstractCegarLoop]: Abstraction has 561 states and 812 transitions. [2019-09-09 05:54:38,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:38,483 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 812 transitions. [2019-09-09 05:54:38,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-09 05:54:38,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:38,485 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:38,485 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:38,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:38,485 INFO L82 PathProgramCache]: Analyzing trace with hash -306693738, now seen corresponding path program 1 times [2019-09-09 05:54:38,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:38,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:38,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:38,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:38,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:38,571 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:38,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:38,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:38,571 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:38,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:38,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:38,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:38,573 INFO L87 Difference]: Start difference. First operand 561 states and 812 transitions. Second operand 4 states. [2019-09-09 05:54:38,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:38,866 INFO L93 Difference]: Finished difference Result 605 states and 872 transitions. [2019-09-09 05:54:38,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:38,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-09 05:54:38,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:38,870 INFO L225 Difference]: With dead ends: 605 [2019-09-09 05:54:38,870 INFO L226 Difference]: Without dead ends: 605 [2019-09-09 05:54:38,870 INFO L628 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-09 05:54:38,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-09-09 05:54:38,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 563. [2019-09-09 05:54:38,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-09-09 05:54:38,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 814 transitions. [2019-09-09 05:54:38,877 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 814 transitions. Word has length 162 [2019-09-09 05:54:38,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:38,878 INFO L475 AbstractCegarLoop]: Abstraction has 563 states and 814 transitions. [2019-09-09 05:54:38,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:38,878 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 814 transitions. [2019-09-09 05:54:38,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-09 05:54:38,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:38,879 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:38,880 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:38,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:38,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1901377462, now seen corresponding path program 1 times [2019-09-09 05:54:38,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:38,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:38,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:38,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:38,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:38,962 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:38,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:38,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:38,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:38,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:38,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:38,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:38,963 INFO L87 Difference]: Start difference. First operand 563 states and 814 transitions. Second operand 4 states. [2019-09-09 05:54:39,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:39,252 INFO L93 Difference]: Finished difference Result 601 states and 866 transitions. [2019-09-09 05:54:39,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:39,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-09 05:54:39,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:39,256 INFO L225 Difference]: With dead ends: 601 [2019-09-09 05:54:39,256 INFO L226 Difference]: Without dead ends: 601 [2019-09-09 05:54:39,256 INFO L628 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-09 05:54:39,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-09-09 05:54:39,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 565. [2019-09-09 05:54:39,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-09-09 05:54:39,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 816 transitions. [2019-09-09 05:54:39,266 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 816 transitions. Word has length 163 [2019-09-09 05:54:39,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:39,266 INFO L475 AbstractCegarLoop]: Abstraction has 565 states and 816 transitions. [2019-09-09 05:54:39,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:39,266 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 816 transitions. [2019-09-09 05:54:39,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-09 05:54:39,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:39,268 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:39,268 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:39,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:39,268 INFO L82 PathProgramCache]: Analyzing trace with hash -783079604, now seen corresponding path program 1 times [2019-09-09 05:54:39,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:39,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:39,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:39,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:39,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-09 05:54:39,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:39,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:54:39,372 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:39,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:39,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:39,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:39,373 INFO L87 Difference]: Start difference. First operand 565 states and 816 transitions. Second operand 3 states. [2019-09-09 05:54:39,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:39,416 INFO L93 Difference]: Finished difference Result 829 states and 1198 transitions. [2019-09-09 05:54:39,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:39,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-09-09 05:54:39,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:39,421 INFO L225 Difference]: With dead ends: 829 [2019-09-09 05:54:39,421 INFO L226 Difference]: Without dead ends: 829 [2019-09-09 05:54:39,421 INFO L628 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-09 05:54:39,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2019-09-09 05:54:39,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 829. [2019-09-09 05:54:39,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-09-09 05:54:39,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1198 transitions. [2019-09-09 05:54:39,433 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1198 transitions. Word has length 171 [2019-09-09 05:54:39,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:39,434 INFO L475 AbstractCegarLoop]: Abstraction has 829 states and 1198 transitions. [2019-09-09 05:54:39,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:39,434 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1198 transitions. [2019-09-09 05:54:39,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-09 05:54:39,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:39,437 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:39,437 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:39,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:39,438 INFO L82 PathProgramCache]: Analyzing trace with hash 674806226, now seen corresponding path program 1 times [2019-09-09 05:54:39,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:39,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:39,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:39,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:39,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-09 05:54:39,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:39,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:39,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:39,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:39,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:39,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:39,528 INFO L87 Difference]: Start difference. First operand 829 states and 1198 transitions. Second operand 4 states. [2019-09-09 05:54:39,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:39,858 INFO L93 Difference]: Finished difference Result 883 states and 1267 transitions. [2019-09-09 05:54:39,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:39,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-09-09 05:54:39,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:39,862 INFO L225 Difference]: With dead ends: 883 [2019-09-09 05:54:39,862 INFO L226 Difference]: Without dead ends: 883 [2019-09-09 05:54:39,862 INFO L628 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-09 05:54:39,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-09-09 05:54:39,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 829. [2019-09-09 05:54:39,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-09-09 05:54:39,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1195 transitions. [2019-09-09 05:54:39,873 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1195 transitions. Word has length 172 [2019-09-09 05:54:39,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:39,873 INFO L475 AbstractCegarLoop]: Abstraction has 829 states and 1195 transitions. [2019-09-09 05:54:39,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:39,873 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1195 transitions. [2019-09-09 05:54:39,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-09 05:54:39,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:39,875 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:39,875 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:39,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:39,878 INFO L82 PathProgramCache]: Analyzing trace with hash -432104751, now seen corresponding path program 1 times [2019-09-09 05:54:39,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:39,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:39,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:39,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:39,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:39,970 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:39,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:39,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:54:39,970 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:39,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:39,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:39,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:39,971 INFO L87 Difference]: Start difference. First operand 829 states and 1195 transitions. Second operand 3 states. [2019-09-09 05:54:40,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:40,006 INFO L93 Difference]: Finished difference Result 1094 states and 1577 transitions. [2019-09-09 05:54:40,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:40,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-09 05:54:40,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:40,009 INFO L225 Difference]: With dead ends: 1094 [2019-09-09 05:54:40,009 INFO L226 Difference]: Without dead ends: 1094 [2019-09-09 05:54:40,009 INFO L628 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-09 05:54:40,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2019-09-09 05:54:40,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1094. [2019-09-09 05:54:40,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2019-09-09 05:54:40,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1577 transitions. [2019-09-09 05:54:40,022 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1577 transitions. Word has length 172 [2019-09-09 05:54:40,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:40,022 INFO L475 AbstractCegarLoop]: Abstraction has 1094 states and 1577 transitions. [2019-09-09 05:54:40,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:40,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1577 transitions. [2019-09-09 05:54:40,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-09 05:54:40,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:40,025 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:40,025 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:40,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:40,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1965607507, now seen corresponding path program 1 times [2019-09-09 05:54:40,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:40,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:40,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:40,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:40,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:40,104 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-09-09 05:54:40,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:40,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:54:40,104 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:40,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:40,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:40,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:40,105 INFO L87 Difference]: Start difference. First operand 1094 states and 1577 transitions. Second operand 3 states. [2019-09-09 05:54:40,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:40,138 INFO L93 Difference]: Finished difference Result 1363 states and 1970 transitions. [2019-09-09 05:54:40,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:40,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-09-09 05:54:40,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:40,141 INFO L225 Difference]: With dead ends: 1363 [2019-09-09 05:54:40,142 INFO L226 Difference]: Without dead ends: 1363 [2019-09-09 05:54:40,142 INFO L628 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-09 05:54:40,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-09-09 05:54:40,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1363. [2019-09-09 05:54:40,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-09-09 05:54:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1970 transitions. [2019-09-09 05:54:40,159 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1970 transitions. Word has length 210 [2019-09-09 05:54:40,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:40,159 INFO L475 AbstractCegarLoop]: Abstraction has 1363 states and 1970 transitions. [2019-09-09 05:54:40,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:40,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1970 transitions. [2019-09-09 05:54:40,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-09 05:54:40,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:40,163 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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-09 05:54:40,163 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:40,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:40,163 INFO L82 PathProgramCache]: Analyzing trace with hash 165018352, now seen corresponding path program 1 times [2019-09-09 05:54:40,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:40,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:40,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:40,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:40,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2019-09-09 05:54:40,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:40,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:40,326 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:40,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:40,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:40,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:40,327 INFO L87 Difference]: Start difference. First operand 1363 states and 1970 transitions. Second operand 4 states. [2019-09-09 05:54:40,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:40,782 INFO L93 Difference]: Finished difference Result 1865 states and 2727 transitions. [2019-09-09 05:54:40,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:40,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 296 [2019-09-09 05:54:40,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:40,787 INFO L225 Difference]: With dead ends: 1865 [2019-09-09 05:54:40,787 INFO L226 Difference]: Without dead ends: 1865 [2019-09-09 05:54:40,787 INFO L628 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-09 05:54:40,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2019-09-09 05:54:40,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1568. [2019-09-09 05:54:40,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2019-09-09 05:54:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2345 transitions. [2019-09-09 05:54:40,807 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2345 transitions. Word has length 296 [2019-09-09 05:54:40,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:40,807 INFO L475 AbstractCegarLoop]: Abstraction has 1568 states and 2345 transitions. [2019-09-09 05:54:40,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:40,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2345 transitions. [2019-09-09 05:54:40,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-09 05:54:40,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:40,810 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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-09 05:54:40,811 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:40,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:40,811 INFO L82 PathProgramCache]: Analyzing trace with hash -264639954, now seen corresponding path program 1 times [2019-09-09 05:54:40,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:40,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:40,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:40,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:40,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:41,079 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-09-09 05:54:41,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:41,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-09 05:54:41,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:41,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 05:54:41,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 05:54:41,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:54:41,081 INFO L87 Difference]: Start difference. First operand 1568 states and 2345 transitions. Second operand 7 states. [2019-09-09 05:54:42,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:42,468 INFO L93 Difference]: Finished difference Result 3247 states and 4931 transitions. [2019-09-09 05:54:42,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:54:42,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 296 [2019-09-09 05:54:42,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:42,475 INFO L225 Difference]: With dead ends: 3247 [2019-09-09 05:54:42,475 INFO L226 Difference]: Without dead ends: 3247 [2019-09-09 05:54:42,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:54:42,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2019-09-09 05:54:42,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 2945. [2019-09-09 05:54:42,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2945 states. [2019-09-09 05:54:42,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2945 states and 4544 transitions. [2019-09-09 05:54:42,509 INFO L78 Accepts]: Start accepts. Automaton has 2945 states and 4544 transitions. Word has length 296 [2019-09-09 05:54:42,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:42,510 INFO L475 AbstractCegarLoop]: Abstraction has 2945 states and 4544 transitions. [2019-09-09 05:54:42,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 05:54:42,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2945 states and 4544 transitions. [2019-09-09 05:54:42,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-09 05:54:42,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:42,516 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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-09 05:54:42,516 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:42,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:42,516 INFO L82 PathProgramCache]: Analyzing trace with hash 2107076912, now seen corresponding path program 1 times [2019-09-09 05:54:42,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:42,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:42,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:42,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:42,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:42,842 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 506 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2019-09-09 05:54:42,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:42,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-09 05:54:42,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:42,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 05:54:42,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 05:54:42,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:54:42,844 INFO L87 Difference]: Start difference. First operand 2945 states and 4544 transitions. Second operand 7 states. [2019-09-09 05:54:44,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:44,663 INFO L93 Difference]: Finished difference Result 6832 states and 10409 transitions. [2019-09-09 05:54:44,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:54:44,663 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 296 [2019-09-09 05:54:44,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:44,678 INFO L225 Difference]: With dead ends: 6832 [2019-09-09 05:54:44,678 INFO L226 Difference]: Without dead ends: 6832 [2019-09-09 05:54:44,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-09-09 05:54:44,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6832 states. [2019-09-09 05:54:44,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6832 to 3883. [2019-09-09 05:54:44,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3883 states. [2019-09-09 05:54:44,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3883 states to 3883 states and 6205 transitions. [2019-09-09 05:54:44,735 INFO L78 Accepts]: Start accepts. Automaton has 3883 states and 6205 transitions. Word has length 296 [2019-09-09 05:54:44,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:44,736 INFO L475 AbstractCegarLoop]: Abstraction has 3883 states and 6205 transitions. [2019-09-09 05:54:44,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 05:54:44,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3883 states and 6205 transitions. [2019-09-09 05:54:44,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-09 05:54:44,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:44,744 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-09-09 05:54:44,744 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:44,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:44,745 INFO L82 PathProgramCache]: Analyzing trace with hash -79482426, now seen corresponding path program 1 times [2019-09-09 05:54:44,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:44,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:44,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:44,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:44,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:44,919 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2019-09-09 05:54:44,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:44,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:44,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:44,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:44,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:44,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:44,920 INFO L87 Difference]: Start difference. First operand 3883 states and 6205 transitions. Second operand 4 states. [2019-09-09 05:54:45,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:45,469 INFO L93 Difference]: Finished difference Result 4478 states and 6963 transitions. [2019-09-09 05:54:45,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:45,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 297 [2019-09-09 05:54:45,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:45,483 INFO L225 Difference]: With dead ends: 4478 [2019-09-09 05:54:45,483 INFO L226 Difference]: Without dead ends: 4478 [2019-09-09 05:54:45,484 INFO L628 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-09 05:54:45,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2019-09-09 05:54:45,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 3893. [2019-09-09 05:54:45,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3893 states. [2019-09-09 05:54:45,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 6215 transitions. [2019-09-09 05:54:45,553 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 6215 transitions. Word has length 297 [2019-09-09 05:54:45,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:45,553 INFO L475 AbstractCegarLoop]: Abstraction has 3893 states and 6215 transitions. [2019-09-09 05:54:45,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:45,554 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 6215 transitions. [2019-09-09 05:54:45,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-09 05:54:45,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:45,563 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:45,563 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:45,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:45,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1593510392, now seen corresponding path program 1 times [2019-09-09 05:54:45,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:45,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:45,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:45,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:45,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:45,847 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 510 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2019-09-09 05:54:45,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:45,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-09 05:54:45,848 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:45,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 05:54:45,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 05:54:45,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:54:45,849 INFO L87 Difference]: Start difference. First operand 3893 states and 6215 transitions. Second operand 7 states. [2019-09-09 05:54:47,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:47,307 INFO L93 Difference]: Finished difference Result 5225 states and 7891 transitions. [2019-09-09 05:54:47,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:54:47,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 297 [2019-09-09 05:54:47,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:47,316 INFO L225 Difference]: With dead ends: 5225 [2019-09-09 05:54:47,316 INFO L226 Difference]: Without dead ends: 5225 [2019-09-09 05:54:47,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-09-09 05:54:47,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5225 states. [2019-09-09 05:54:47,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5225 to 3171. [2019-09-09 05:54:47,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3171 states. [2019-09-09 05:54:47,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 3171 states and 4912 transitions. [2019-09-09 05:54:47,362 INFO L78 Accepts]: Start accepts. Automaton has 3171 states and 4912 transitions. Word has length 297 [2019-09-09 05:54:47,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:47,362 INFO L475 AbstractCegarLoop]: Abstraction has 3171 states and 4912 transitions. [2019-09-09 05:54:47,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 05:54:47,362 INFO L276 IsEmpty]: Start isEmpty. Operand 3171 states and 4912 transitions. [2019-09-09 05:54:47,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-09-09 05:54:47,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:47,368 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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-09 05:54:47,368 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:47,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:47,369 INFO L82 PathProgramCache]: Analyzing trace with hash 2102798151, now seen corresponding path program 1 times [2019-09-09 05:54:47,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:47,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:47,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:47,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:47,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:47,620 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 516 proven. 92 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-09-09 05:54:47,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:54:47,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:54:47,621 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 310 with the following transitions: [2019-09-09 05:54:47,625 INFO L207 CegarAbsIntRunner]: [0], [43], [48], [50], [61], [63], [67], [76], [78], [83], [88], [93], [98], [103], [106], [108], [113], [118], [121], [123], [128], [133], [136], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [193], [198], [203], [208], [213], [218], [221], [223], [228], [231], [233], [238], [241], [303], [308], [312], [315], [323], [325], [328], [336], [339], [343], [506], [509], [511], [514], [522], [525], [529], [531], [536], [539], [541], [544], [552], [557], [559], [562], [564], [567], [575], [578], [582], [603], [637], [639], [651], [654], [655], [667], [675], [676], [677] [2019-09-09 05:54:47,695 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:54:47,695 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:54:47,799 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:54:47,801 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 0. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 22 variables. [2019-09-09 05:54:47,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:47,807 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:54:47,950 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-09 05:54:47,951 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:54:47,961 INFO L420 sIntCurrentIteration]: We unified 308 AI predicates to 308 [2019-09-09 05:54:47,961 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:54:47,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:54:47,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-09 05:54:47,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:47,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-09 05:54:47,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-09 05:54:47,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 05:54:47,964 INFO L87 Difference]: Start difference. First operand 3171 states and 4912 transitions. Second operand 2 states. [2019-09-09 05:54:47,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:47,965 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-09 05:54:47,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-09 05:54:47,965 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 309 [2019-09-09 05:54:47,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:47,965 INFO L225 Difference]: With dead ends: 2 [2019-09-09 05:54:47,965 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:54:47,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 05:54:47,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:54:47,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:54:47,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:54:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:54:47,966 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 309 [2019-09-09 05:54:47,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:47,967 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:54:47,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-09 05:54:47,967 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:54:47,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:54:47,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:54:47 BoogieIcfgContainer [2019-09-09 05:54:47,971 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:54:47,975 INFO L168 Benchmark]: Toolchain (without parser) took 38137.89 ms. Allocated memory was 142.6 MB in the beginning and 648.5 MB in the end (delta: 505.9 MB). Free memory was 88.0 MB in the beginning and 462.2 MB in the end (delta: -374.2 MB). Peak memory consumption was 131.7 MB. Max. memory is 7.1 GB. [2019-09-09 05:54:47,976 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 142.6 MB. Free memory was 108.8 MB in the beginning and 108.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:54:47,977 INFO L168 Benchmark]: CACSL2BoogieTranslator took 925.37 ms. Allocated memory was 142.6 MB in the beginning and 202.9 MB in the end (delta: 60.3 MB). Free memory was 87.8 MB in the beginning and 159.3 MB in the end (delta: -71.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-09-09 05:54:47,978 INFO L168 Benchmark]: Boogie Preprocessor took 149.38 ms. Allocated memory is still 202.9 MB. Free memory was 159.3 MB in the beginning and 151.4 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 7.1 GB. [2019-09-09 05:54:47,979 INFO L168 Benchmark]: RCFGBuilder took 1182.29 ms. Allocated memory was 202.9 MB in the beginning and 232.8 MB in the end (delta: 29.9 MB). Free memory was 151.4 MB in the beginning and 170.1 MB in the end (delta: -18.6 MB). Peak memory consumption was 76.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:54:47,983 INFO L168 Benchmark]: TraceAbstraction took 35876.37 ms. Allocated memory was 232.8 MB in the beginning and 648.5 MB in the end (delta: 415.8 MB). Free memory was 170.1 MB in the beginning and 462.2 MB in the end (delta: -292.1 MB). Peak memory consumption was 123.6 MB. Max. memory is 7.1 GB. [2019-09-09 05:54:47,991 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 142.6 MB. Free memory was 108.8 MB in the beginning and 108.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 925.37 ms. Allocated memory was 142.6 MB in the beginning and 202.9 MB in the end (delta: 60.3 MB). Free memory was 87.8 MB in the beginning and 159.3 MB in the end (delta: -71.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 149.38 ms. Allocated memory is still 202.9 MB. Free memory was 159.3 MB in the beginning and 151.4 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1182.29 ms. Allocated memory was 202.9 MB in the beginning and 232.8 MB in the end (delta: 29.9 MB). Free memory was 151.4 MB in the beginning and 170.1 MB in the end (delta: -18.6 MB). Peak memory consumption was 76.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35876.37 ms. Allocated memory was 232.8 MB in the beginning and 648.5 MB in the end (delta: 415.8 MB). Free memory was 170.1 MB in the beginning and 462.2 MB in the end (delta: -292.1 MB). Peak memory consumption was 123.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1715]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 184 locations, 1 error locations. SAFE Result, 35.8s OverallTime, 71 OverallIterations, 9 TraceHistogramMax, 27.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16400 SDtfs, 6395 SDslu, 23850 SDs, 0 SdLazy, 15880 SolverSat, 819 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 716 GetRequests, 458 SyntacticMatches, 37 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3893occurred in iteration=69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.1688311688311688 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 71 MinimizatonAttempts, 9539 StatesRemovedByMinimization, 66 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 9284 NumberOfCodeBlocks, 9284 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 9213 ConstructedInterpolants, 0 QuantifiedInterpolants, 4001816 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 71 InterpolantComputations, 70 PerfectInterpolantSequences, 10629/10721 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...