java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-12 20:41:04,683 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 20:41:04,685 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 20:41:04,697 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 20:41:04,697 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 20:41:04,698 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 20:41:04,699 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 20:41:04,701 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 20:41:04,702 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 20:41:04,703 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 20:41:04,703 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 20:41:04,704 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 20:41:04,704 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 20:41:04,705 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 20:41:04,706 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 20:41:04,707 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 20:41:04,709 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 20:41:04,710 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 20:41:04,711 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 20:41:04,712 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 20:41:04,714 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 20:41:04,714 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 20:41:04,714 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 20:41:04,715 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 20:41:04,715 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 20:41:04,716 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 20:41:04,717 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 20:41:04,717 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 20:41:04,718 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 20:41:04,718 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 20:41:04,718 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 20:41:04,719 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-04-12 20:41:04,729 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 20:41:04,729 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 20:41:04,730 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-12 20:41:04,730 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-12 20:41:04,730 INFO L133 SettingsManager]: * Use SBE=true [2018-04-12 20:41:04,730 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 20:41:04,731 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 20:41:04,731 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 20:41:04,731 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 20:41:04,731 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 20:41:04,731 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 20:41:04,731 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 20:41:04,731 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-12 20:41:04,732 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 20:41:04,732 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 20:41:04,732 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 20:41:04,732 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-12 20:41:04,732 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-12 20:41:04,732 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 20:41:04,732 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 20:41:04,733 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 20:41:04,733 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-12 20:41:04,761 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 20:41:04,771 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 20:41:04,774 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 20:41:04,776 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 20:41:04,776 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 20:41:04,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,064 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGd177d05fc [2018-04-12 20:41:05,199 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 20:41:05,200 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 20:41:05,200 INFO L168 CDTParser]: Scanning substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,209 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 20:41:05,210 INFO L215 ultiparseSymbolTable]: [2018-04-12 20:41:05,210 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 20:41:05,210 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ ('') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,210 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,210 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,210 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,210 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 20:41:05,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____nlink_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__register_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__gid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ldiv_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____socklen_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__timer_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____ssize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__off_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____intptr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____mode_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__size_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsword_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__uint in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__id_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ssize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__nlink_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__caddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_short in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__div_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____suseconds_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____rlim_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__uid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__wchar_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__key_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__lldiv_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fd_mask in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__clockid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____clockid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_char in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____off64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____gid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____id_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____timer_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____pid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_long in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_char in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ulong in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__clock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__daddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____ino_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____off_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__blksize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fd_mask in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____caddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_long in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____sigset_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__sigset_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____ino64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__time_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____clock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____daddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____key_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__mode_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____useconds_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__dev_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_short in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fd_set in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____loff_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__suseconds_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_int in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fsid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____dev_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____time_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ushort in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____qaddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____blksize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ino_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__loff_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____rlim64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,233 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGd177d05fc [2018-04-12 20:41:05,237 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 20:41:05,238 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 20:41:05,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 20:41:05,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 20:41:05,245 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 20:41:05,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 08:41:05" (1/1) ... [2018-04-12 20:41:05,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53c5c7dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 08:41:05, skipping insertion in model container [2018-04-12 20:41:05,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 08:41:05" (1/1) ... [2018-04-12 20:41:05,260 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 20:41:05,283 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 20:41:05,408 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 20:41:05,439 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 20:41:05,445 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-12 20:41:05,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 08:41:05 WrapperNode [2018-04-12 20:41:05,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 20:41:05,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 20:41:05,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 20:41:05,480 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 20:41:05,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 08:41:05" (1/1) ... [2018-04-12 20:41:05,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 08:41:05" (1/1) ... [2018-04-12 20:41:05,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 08:41:05" (1/1) ... [2018-04-12 20:41:05,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 08:41:05" (1/1) ... [2018-04-12 20:41:05,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 08:41:05" (1/1) ... [2018-04-12 20:41:05,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 08:41:05" (1/1) ... [2018-04-12 20:41:05,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 08:41:05" (1/1) ... [2018-04-12 20:41:05,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 20:41:05,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 20:41:05,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 20:41:05,522 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 20:41:05,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 08:41:05" (1/1) ... No working directory specified, using /home/ultimate/work/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 [2018-04-12 20:41:05,618 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 20:41:05,618 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 20:41:05,618 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-12 20:41:05,619 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-12 20:41:05,619 INFO L136 BoogieDeclarations]: Found implementation of procedure substring [2018-04-12 20:41:05,619 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 20:41:05,619 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-12 20:41:05,619 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-12 20:41:05,619 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-12 20:41:05,619 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-12 20:41:05,619 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-12 20:41:05,619 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-12 20:41:05,619 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-12 20:41:05,619 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-12 20:41:05,619 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-12 20:41:05,619 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-12 20:41:05,620 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-12 20:41:05,620 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-12 20:41:05,620 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-12 20:41:05,620 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-12 20:41:05,620 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-12 20:41:05,620 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-12 20:41:05,620 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-12 20:41:05,620 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-12 20:41:05,620 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-12 20:41:05,621 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-12 20:41:05,621 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-12 20:41:05,621 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-12 20:41:05,621 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-12 20:41:05,621 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-12 20:41:05,621 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-12 20:41:05,621 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-12 20:41:05,621 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-12 20:41:05,621 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-12 20:41:05,622 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-12 20:41:05,622 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-12 20:41:05,622 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-12 20:41:05,622 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-12 20:41:05,622 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-12 20:41:05,622 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-12 20:41:05,622 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-12 20:41:05,622 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-12 20:41:05,622 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-12 20:41:05,623 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-12 20:41:05,623 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-12 20:41:05,623 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-12 20:41:05,623 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-12 20:41:05,623 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-12 20:41:05,623 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-12 20:41:05,623 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-12 20:41:05,623 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-12 20:41:05,623 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-12 20:41:05,623 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-12 20:41:05,624 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-12 20:41:05,624 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-12 20:41:05,624 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-12 20:41:05,624 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-12 20:41:05,624 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-12 20:41:05,624 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-12 20:41:05,624 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-12 20:41:05,624 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-12 20:41:05,624 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-12 20:41:05,624 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-12 20:41:05,625 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-12 20:41:05,625 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-12 20:41:05,625 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-12 20:41:05,625 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-12 20:41:05,625 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-12 20:41:05,625 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-12 20:41:05,625 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-12 20:41:05,625 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-12 20:41:05,625 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-12 20:41:05,625 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-12 20:41:05,625 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-12 20:41:05,626 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-12 20:41:05,626 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-12 20:41:05,626 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-12 20:41:05,626 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-12 20:41:05,626 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-12 20:41:05,626 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-12 20:41:05,626 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-12 20:41:05,626 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-12 20:41:05,626 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-12 20:41:05,626 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-12 20:41:05,627 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-12 20:41:05,627 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-12 20:41:05,627 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-12 20:41:05,627 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-12 20:41:05,627 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-12 20:41:05,627 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-12 20:41:05,627 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-12 20:41:05,627 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-12 20:41:05,627 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-12 20:41:05,627 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-12 20:41:05,627 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-12 20:41:05,628 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-12 20:41:05,628 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-12 20:41:05,628 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-12 20:41:05,628 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-12 20:41:05,628 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-12 20:41:05,628 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-12 20:41:05,628 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-12 20:41:05,628 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-12 20:41:05,628 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-12 20:41:05,628 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-12 20:41:05,629 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-12 20:41:05,629 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-12 20:41:05,629 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-12 20:41:05,629 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-12 20:41:05,629 INFO L128 BoogieDeclarations]: Found specification of procedure substring [2018-04-12 20:41:05,629 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-12 20:41:05,629 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 20:41:05,629 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-12 20:41:05,629 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-12 20:41:05,629 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-12 20:41:05,629 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 20:41:05,630 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 20:41:05,630 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-12 20:41:05,901 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 20:41:05,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 08:41:05 BoogieIcfgContainer [2018-04-12 20:41:05,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 20:41:05,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 20:41:05,902 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 20:41:05,904 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 20:41:05,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 08:41:05" (1/3) ... [2018-04-12 20:41:05,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c016a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 08:41:05, skipping insertion in model container [2018-04-12 20:41:05,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 08:41:05" (2/3) ... [2018-04-12 20:41:05,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c016a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 08:41:05, skipping insertion in model container [2018-04-12 20:41:05,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 08:41:05" (3/3) ... [2018-04-12 20:41:05,907 INFO L107 eAbstractionObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 20:41:05,912 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-12 20:41:05,918 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-04-12 20:41:05,948 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 20:41:05,948 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 20:41:05,948 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-12 20:41:05,949 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-12 20:41:05,949 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-12 20:41:05,949 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 20:41:05,949 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 20:41:05,949 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 20:41:05,949 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 20:41:05,950 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 20:41:05,959 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-04-12 20:41:05,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-12 20:41:05,965 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:05,965 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 20:41:05,965 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:05,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1359245197, now seen corresponding path program 1 times [2018-04-12 20:41:06,001 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:06,046 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:06,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:06,105 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 20:41:06,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 20:41:06,106 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:06,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:06,106 INFO L182 omatonBuilderFactory]: Interpolants [59#true, 60#false, 61#(= 1 (select |#valid| |main_#t~malloc13.base|)), 62#(= 1 (select |#valid| main_~nondetString1~0.base))] [2018-04-12 20:41:06,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:06,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 20:41:06,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 20:41:06,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 20:41:06,119 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 4 states. [2018-04-12 20:41:06,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:06,198 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-04-12 20:41:06,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 20:41:06,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-04-12 20:41:06,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:06,210 INFO L225 Difference]: With dead ends: 55 [2018-04-12 20:41:06,210 INFO L226 Difference]: Without dead ends: 52 [2018-04-12 20:41:06,212 INFO L567 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 [2018-04-12 20:41:06,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-12 20:41:06,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-04-12 20:41:06,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-12 20:41:06,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-04-12 20:41:06,247 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 13 [2018-04-12 20:41:06,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:06,247 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-04-12 20:41:06,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 20:41:06,248 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-04-12 20:41:06,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-12 20:41:06,248 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:06,248 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 20:41:06,248 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:06,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1359245198, now seen corresponding path program 1 times [2018-04-12 20:41:06,250 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:06,264 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:06,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:06,323 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 20:41:06,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 20:41:06,323 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:06,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:06,323 INFO L182 omatonBuilderFactory]: Interpolants [176#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 177#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 172#true, 173#false, 174#(<= 1 main_~length1~0), 175#(and (= main_~length1~0 (select |#length| |main_#t~malloc13.base|)) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= 1 main_~length1~0) (= 0 |main_#t~malloc13.offset|))] [2018-04-12 20:41:06,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:06,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 20:41:06,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 20:41:06,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-12 20:41:06,325 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 6 states. [2018-04-12 20:41:06,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:06,403 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-04-12 20:41:06,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 20:41:06,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-12 20:41:06,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:06,404 INFO L225 Difference]: With dead ends: 51 [2018-04-12 20:41:06,404 INFO L226 Difference]: Without dead ends: 51 [2018-04-12 20:41:06,405 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-12 20:41:06,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-12 20:41:06,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-12 20:41:06,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-12 20:41:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-04-12 20:41:06,409 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2018-04-12 20:41:06,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:06,410 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-04-12 20:41:06,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 20:41:06,410 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-04-12 20:41:06,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-12 20:41:06,410 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:06,410 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 20:41:06,410 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:06,411 INFO L82 PathProgramCache]: Analyzing trace with hash -813071859, now seen corresponding path program 1 times [2018-04-12 20:41:06,411 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:06,423 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:06,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:06,443 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 20:41:06,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 20:41:06,444 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:06,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:06,444 INFO L182 omatonBuilderFactory]: Interpolants [282#true, 283#false, 284#(= 1 (select |#valid| |main_#t~malloc14.base|)), 285#(= 1 (select |#valid| main_~nondetString2~0.base))] [2018-04-12 20:41:06,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:06,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 20:41:06,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 20:41:06,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 20:41:06,445 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 4 states. [2018-04-12 20:41:06,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:06,479 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-04-12 20:41:06,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 20:41:06,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-12 20:41:06,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:06,480 INFO L225 Difference]: With dead ends: 50 [2018-04-12 20:41:06,480 INFO L226 Difference]: Without dead ends: 50 [2018-04-12 20:41:06,480 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 20:41:06,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-12 20:41:06,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-04-12 20:41:06,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-12 20:41:06,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-04-12 20:41:06,483 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 14 [2018-04-12 20:41:06,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:06,483 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-04-12 20:41:06,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 20:41:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-04-12 20:41:06,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-12 20:41:06,483 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:06,483 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 20:41:06,484 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:06,484 INFO L82 PathProgramCache]: Analyzing trace with hash -813071858, now seen corresponding path program 1 times [2018-04-12 20:41:06,484 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:06,495 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:06,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:06,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 20:41:06,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 20:41:06,535 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:06,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:06,536 INFO L182 omatonBuilderFactory]: Interpolants [388#true, 389#false, 390#(<= 1 main_~length2~0), 391#(and (= 0 |main_#t~malloc14.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc14.base|))), 392#(and (= main_~nondetString2~0.offset 0) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))] [2018-04-12 20:41:06,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:06,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 20:41:06,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 20:41:06,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 20:41:06,536 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 5 states. [2018-04-12 20:41:06,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:06,558 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-04-12 20:41:06,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 20:41:06,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-12 20:41:06,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:06,559 INFO L225 Difference]: With dead ends: 49 [2018-04-12 20:41:06,559 INFO L226 Difference]: Without dead ends: 49 [2018-04-12 20:41:06,559 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-12 20:41:06,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-12 20:41:06,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-04-12 20:41:06,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-12 20:41:06,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-04-12 20:41:06,562 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 14 [2018-04-12 20:41:06,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:06,562 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-04-12 20:41:06,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 20:41:06,562 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-04-12 20:41:06,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-12 20:41:06,562 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:06,562 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 20:41:06,562 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:06,562 INFO L82 PathProgramCache]: Analyzing trace with hash 198035442, now seen corresponding path program 1 times [2018-04-12 20:41:06,563 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:06,574 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:06,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:06,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 20:41:06,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 20:41:06,597 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:06,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:06,598 INFO L182 omatonBuilderFactory]: Interpolants [496#(= 1 (select |#valid| |substring_#in~s.base|)), 497#(= 1 (select |#valid| substring_~ps~0.base)), 493#true, 494#false, 495#(= 1 (select |#valid| main_~nondetString1~0.base))] [2018-04-12 20:41:06,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:06,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 20:41:06,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 20:41:06,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 20:41:06,598 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2018-04-12 20:41:06,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:06,658 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-04-12 20:41:06,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 20:41:06,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-12 20:41:06,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:06,658 INFO L225 Difference]: With dead ends: 48 [2018-04-12 20:41:06,658 INFO L226 Difference]: Without dead ends: 48 [2018-04-12 20:41:06,659 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-12 20:41:06,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-12 20:41:06,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-04-12 20:41:06,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-04-12 20:41:06,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-04-12 20:41:06,661 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 18 [2018-04-12 20:41:06,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:06,661 INFO L459 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-04-12 20:41:06,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 20:41:06,661 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-04-12 20:41:06,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-12 20:41:06,661 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:06,662 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 20:41:06,662 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:06,662 INFO L82 PathProgramCache]: Analyzing trace with hash 198035443, now seen corresponding path program 1 times [2018-04-12 20:41:06,662 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:06,669 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:06,724 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 20:41:06,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 20:41:06,724 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:06,724 INFO L182 omatonBuilderFactory]: Interpolants [596#true, 597#false, 598#(<= 1 main_~length1~0), 599#(and (<= 1 main_~length1~0) (= 0 |main_#t~malloc13.offset|)), 600#(and (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 601#(and (<= (+ main_~nondetString1~0.offset 1) (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 602#(and (= 0 |substring_#in~s.offset|) (<= 1 (select |#length| |substring_#in~s.base|))), 603#(and (= substring_~ps~0.offset 0) (<= 1 (select |#length| substring_~ps~0.base)))] [2018-04-12 20:41:06,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:06,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 20:41:06,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 20:41:06,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-12 20:41:06,725 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 8 states. [2018-04-12 20:41:06,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:06,808 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-04-12 20:41:06,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 20:41:06,808 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-04-12 20:41:06,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:06,811 INFO L225 Difference]: With dead ends: 72 [2018-04-12 20:41:06,811 INFO L226 Difference]: Without dead ends: 72 [2018-04-12 20:41:06,811 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-04-12 20:41:06,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-12 20:41:06,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2018-04-12 20:41:06,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-12 20:41:06,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-04-12 20:41:06,814 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 18 [2018-04-12 20:41:06,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:06,814 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-04-12 20:41:06,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 20:41:06,815 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-04-12 20:41:06,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-12 20:41:06,815 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:06,815 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 20:41:06,815 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:06,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1611194078, now seen corresponding path program 1 times [2018-04-12 20:41:06,816 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:06,824 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:06,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:06,855 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 20:41:06,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 20:41:06,864 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:06,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:06,865 INFO L182 omatonBuilderFactory]: Interpolants [736#(= 1 (select |#valid| main_~nondetString2~0.base)), 737#(= 1 (select |#valid| |substring_#in~t.base|)), 738#(= 1 (select |#valid| substring_~t.base)), 739#(= 1 (select |#valid| substring_~pt~0.base)), 734#true, 735#false] [2018-04-12 20:41:06,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:06,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 20:41:06,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 20:41:06,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 20:41:06,866 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 6 states. [2018-04-12 20:41:06,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:06,918 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-04-12 20:41:06,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 20:41:06,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-04-12 20:41:06,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:06,919 INFO L225 Difference]: With dead ends: 51 [2018-04-12 20:41:06,919 INFO L226 Difference]: Without dead ends: 51 [2018-04-12 20:41:06,920 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-12 20:41:06,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-12 20:41:06,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-04-12 20:41:06,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-12 20:41:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-04-12 20:41:06,923 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 21 [2018-04-12 20:41:06,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:06,923 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-04-12 20:41:06,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 20:41:06,923 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-04-12 20:41:06,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-12 20:41:06,924 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:06,924 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 20:41:06,924 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:06,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1611194077, now seen corresponding path program 1 times [2018-04-12 20:41:06,925 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:06,934 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:07,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:07,004 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 20:41:07,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-12 20:41:07,004 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:07,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:07,005 INFO L182 omatonBuilderFactory]: Interpolants [848#(and (= 0 |substring_#in~t.offset|) (<= 1 (select |#length| |substring_#in~t.base|))), 849#(and (<= 1 (select |#length| substring_~t.base)) (= 0 substring_~t.offset)), 850#(and (<= 1 (select |#length| substring_~pt~0.base)) (= substring_~pt~0.offset 0)), 842#true, 843#false, 844#(<= 1 main_~length2~0), 845#(and (= 0 |main_#t~malloc14.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc14.base|))), 846#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 847#(and (= 0 main_~nondetString2~0.offset) (<= 1 (select |#length| main_~nondetString2~0.base)))] [2018-04-12 20:41:07,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:07,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 20:41:07,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 20:41:07,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-12 20:41:07,006 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 9 states. [2018-04-12 20:41:07,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:07,118 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-04-12 20:41:07,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 20:41:07,119 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-04-12 20:41:07,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:07,119 INFO L225 Difference]: With dead ends: 66 [2018-04-12 20:41:07,120 INFO L226 Difference]: Without dead ends: 66 [2018-04-12 20:41:07,120 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-04-12 20:41:07,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-12 20:41:07,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-04-12 20:41:07,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-12 20:41:07,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2018-04-12 20:41:07,123 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 21 [2018-04-12 20:41:07,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:07,123 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2018-04-12 20:41:07,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 20:41:07,124 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-04-12 20:41:07,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-12 20:41:07,124 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:07,124 INFO L355 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] [2018-04-12 20:41:07,124 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:07,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1620411736, now seen corresponding path program 1 times [2018-04-12 20:41:07,125 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:07,135 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:07,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:07,161 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 20:41:07,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 20:41:07,161 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:07,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:07,161 INFO L182 omatonBuilderFactory]: Interpolants [979#true, 980#false, 981#(= 1 (select |#valid| main_~nondetString1~0.base)), 982#(= 1 (select |#valid| |substring_#in~s.base|)), 983#(= 1 (select |#valid| substring_~ps~0.base)), 984#(= 1 (select |#valid| substring_~ps2~0.base))] [2018-04-12 20:41:07,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:07,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 20:41:07,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 20:41:07,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 20:41:07,162 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 6 states. [2018-04-12 20:41:07,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:07,225 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-04-12 20:41:07,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 20:41:07,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-04-12 20:41:07,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:07,226 INFO L225 Difference]: With dead ends: 59 [2018-04-12 20:41:07,226 INFO L226 Difference]: Without dead ends: 59 [2018-04-12 20:41:07,227 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-12 20:41:07,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-12 20:41:07,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-04-12 20:41:07,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-12 20:41:07,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-04-12 20:41:07,229 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 25 [2018-04-12 20:41:07,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:07,229 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-04-12 20:41:07,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 20:41:07,230 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-04-12 20:41:07,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-12 20:41:07,230 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:07,230 INFO L355 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] [2018-04-12 20:41:07,230 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:07,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1620411735, now seen corresponding path program 1 times [2018-04-12 20:41:07,231 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:07,239 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:07,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:07,285 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 20:41:07,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 20:41:07,285 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:07,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:07,285 INFO L182 omatonBuilderFactory]: Interpolants [1104#false, 1105#(= 0 |main_#t~malloc13.offset|), 1106#(= 0 main_~nondetString1~0.offset), 1107#(= 0 |substring_#in~s.offset|), 1108#(= substring_~ps~0.offset 0), 1109#(and (= substring_~ps~0.offset 0) (<= (+ substring_~ps~0.offset 1) (select |#length| substring_~ps~0.base))), 1110#(and (<= 1 (select |#length| substring_~ps2~0.base)) (= substring_~ps2~0.offset 0)), 1103#true] [2018-04-12 20:41:07,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:07,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 20:41:07,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 20:41:07,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-12 20:41:07,286 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 8 states. [2018-04-12 20:41:07,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:07,386 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2018-04-12 20:41:07,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 20:41:07,387 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-04-12 20:41:07,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:07,388 INFO L225 Difference]: With dead ends: 92 [2018-04-12 20:41:07,388 INFO L226 Difference]: Without dead ends: 92 [2018-04-12 20:41:07,388 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-04-12 20:41:07,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-04-12 20:41:07,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2018-04-12 20:41:07,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-04-12 20:41:07,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-04-12 20:41:07,392 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 25 [2018-04-12 20:41:07,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:07,393 INFO L459 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-04-12 20:41:07,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 20:41:07,393 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-04-12 20:41:07,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-12 20:41:07,393 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:07,394 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 20:41:07,394 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:07,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1307124962, now seen corresponding path program 1 times [2018-04-12 20:41:07,395 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:07,402 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:07,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:07,412 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 20:41:07,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 20:41:07,413 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:07,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:07,413 INFO L182 omatonBuilderFactory]: Interpolants [1275#true, 1276#false, 1277#(not |substring_#t~short6|)] [2018-04-12 20:41:07,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:07,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 20:41:07,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 20:41:07,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 20:41:07,414 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 3 states. [2018-04-12 20:41:07,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:07,420 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-04-12 20:41:07,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 20:41:07,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-04-12 20:41:07,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:07,421 INFO L225 Difference]: With dead ends: 64 [2018-04-12 20:41:07,421 INFO L226 Difference]: Without dead ends: 64 [2018-04-12 20:41:07,421 INFO L567 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 [2018-04-12 20:41:07,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-04-12 20:41:07,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-04-12 20:41:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-12 20:41:07,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2018-04-12 20:41:07,424 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 26 [2018-04-12 20:41:07,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:07,425 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-04-12 20:41:07,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 20:41:07,425 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2018-04-12 20:41:07,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 20:41:07,425 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:07,425 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 20:41:07,426 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:07,426 INFO L82 PathProgramCache]: Analyzing trace with hash 2015624486, now seen corresponding path program 1 times [2018-04-12 20:41:07,426 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:07,433 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:07,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:07,456 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 20:41:07,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 20:41:07,456 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:07,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:07,457 INFO L182 omatonBuilderFactory]: Interpolants [1408#(= (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset) |substring_#t~mem3|), 1409#(or (= 0 (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset)) |substring_#t~short6|), 1410#(= 0 (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset)), 1411#(= 0 |substring_#t~mem9|), 1406#true, 1407#false] [2018-04-12 20:41:07,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:07,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 20:41:07,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 20:41:07,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-12 20:41:07,457 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 6 states. [2018-04-12 20:41:07,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:07,496 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-04-12 20:41:07,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 20:41:07,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-04-12 20:41:07,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:07,497 INFO L225 Difference]: With dead ends: 70 [2018-04-12 20:41:07,497 INFO L226 Difference]: Without dead ends: 70 [2018-04-12 20:41:07,497 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-04-12 20:41:07,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-04-12 20:41:07,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-04-12 20:41:07,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-12 20:41:07,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-04-12 20:41:07,500 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 28 [2018-04-12 20:41:07,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:07,500 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-04-12 20:41:07,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 20:41:07,500 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-04-12 20:41:07,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 20:41:07,501 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:07,501 INFO L355 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] [2018-04-12 20:41:07,501 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:07,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1801524697, now seen corresponding path program 1 times [2018-04-12 20:41:07,501 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:07,508 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:07,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:07,587 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 20:41:07,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 20:41:07,587 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:07,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:07,588 INFO L182 omatonBuilderFactory]: Interpolants [1555#true, 1556#false, 1557#(= |#valid| |old(#valid)|), 1558#(and (= (select |#valid| |main_#t~malloc13.base|) 1) (= |old(#valid)| (store |#valid| |main_#t~malloc13.base| 0))), 1559#(and (= main_~nondetString1~0.base |main_#t~malloc13.base|) (= (select |#valid| main_~nondetString1~0.base) 1) (= |old(#valid)| (store |#valid| |main_#t~malloc13.base| 0))), 1560#(and (= (store (store |#valid| |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0) |old(#valid)|) (not (= |main_#t~malloc13.base| |main_#t~malloc14.base|))), 1561#(= (store |#valid| |main_#t~malloc14.base| 0) |old(#valid)|)] [2018-04-12 20:41:07,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:07,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 20:41:07,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 20:41:07,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-12 20:41:07,589 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 7 states. [2018-04-12 20:41:07,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:07,698 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-04-12 20:41:07,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 20:41:07,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-04-12 20:41:07,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:07,699 INFO L225 Difference]: With dead ends: 66 [2018-04-12 20:41:07,699 INFO L226 Difference]: Without dead ends: 54 [2018-04-12 20:41:07,700 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-04-12 20:41:07,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-12 20:41:07,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-12 20:41:07,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-12 20:41:07,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-04-12 20:41:07,705 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 28 [2018-04-12 20:41:07,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:07,705 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-04-12 20:41:07,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 20:41:07,705 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-04-12 20:41:07,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-12 20:41:07,705 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:07,706 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 20:41:07,706 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:07,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1695652845, now seen corresponding path program 1 times [2018-04-12 20:41:07,706 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:07,718 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:07,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:07,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 20:41:07,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-04-12 20:41:07,889 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:07,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:07,891 INFO L182 omatonBuilderFactory]: Interpolants [1696#(= 0 (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset)), 1697#(and (= 0 (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset)) (= |substring_#t~mem3| (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset))), 1698#(or (not |substring_#t~short6|) (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset)))), 1699#(not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset))), 1700#(not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) |substring_#t~mem4|)), 1701#(not (= |substring_#t~mem5| |substring_#t~mem4|)), 1702#(not |substring_#t~short6|), 1686#true, 1687#false, 1688#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 1689#(and (= (select |#valid| |main_#t~malloc13.base|) 1) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= 0 |main_#t~malloc13.offset|)), 1690#(and (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 1691#(and (not (= main_~nondetString1~0.base |main_#t~malloc14.base|)) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 1692#(and (<= 1 main_~length1~0) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 1693#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 1694#(= 0 (select (select |#memory_int| |substring_#in~s.base|) |substring_#in~s.offset|)), 1695#(= 0 (select (select |#memory_int| substring_~ps~0.base) substring_~ps~0.offset))] [2018-04-12 20:41:07,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:07,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-12 20:41:07,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-12 20:41:07,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-04-12 20:41:07,892 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 17 states. [2018-04-12 20:41:08,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:08,188 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2018-04-12 20:41:08,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-12 20:41:08,188 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-04-12 20:41:08,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:08,189 INFO L225 Difference]: With dead ends: 109 [2018-04-12 20:41:08,189 INFO L226 Difference]: Without dead ends: 109 [2018-04-12 20:41:08,189 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=804, Unknown=0, NotChecked=0, Total=992 [2018-04-12 20:41:08,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-12 20:41:08,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 74. [2018-04-12 20:41:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-12 20:41:08,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-04-12 20:41:08,192 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 29 [2018-04-12 20:41:08,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:08,192 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-04-12 20:41:08,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-12 20:41:08,192 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-04-12 20:41:08,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-12 20:41:08,193 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:08,193 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 20:41:08,193 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:08,194 INFO L82 PathProgramCache]: Analyzing trace with hash 793876117, now seen corresponding path program 1 times [2018-04-12 20:41:08,194 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:08,204 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:08,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:08,299 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 20:41:08,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-12 20:41:08,299 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:08,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:08,299 INFO L182 omatonBuilderFactory]: Interpolants [1920#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (<= (+ main_~nondetString2~0.offset main_~length2~0) 1)), 1921#(and (= main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset))), 1922#(= 0 (select (select |#memory_int| |substring_#in~t.base|) |substring_#in~t.offset|)), 1923#(= 0 (select (select |#memory_int| substring_~t.base) substring_~t.offset)), 1924#(= 0 (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset)), 1925#(and (= 0 (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset)) (= |substring_#t~mem3| (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset))), 1926#(not |substring_#t~short6|), 1916#true, 1917#false, 1918#(and (<= main_~length2~0 1) (<= 1 main_~length2~0)), 1919#(and (<= main_~length2~0 1) (= 0 |main_#t~malloc14.offset|) (<= 1 main_~length2~0))] [2018-04-12 20:41:08,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:08,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 20:41:08,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 20:41:08,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-04-12 20:41:08,300 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 11 states. [2018-04-12 20:41:08,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:08,435 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2018-04-12 20:41:08,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 20:41:08,435 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-04-12 20:41:08,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:08,436 INFO L225 Difference]: With dead ends: 104 [2018-04-12 20:41:08,436 INFO L226 Difference]: Without dead ends: 74 [2018-04-12 20:41:08,436 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-04-12 20:41:08,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-04-12 20:41:08,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-04-12 20:41:08,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-12 20:41:08,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-04-12 20:41:08,438 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 29 [2018-04-12 20:41:08,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:08,438 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-04-12 20:41:08,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 20:41:08,438 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-04-12 20:41:08,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-12 20:41:08,439 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:08,439 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 20:41:08,439 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:08,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1012730835, now seen corresponding path program 1 times [2018-04-12 20:41:08,440 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:08,450 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:08,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:08,570 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:41:08,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-12 20:41:08,570 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:08,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:08,570 INFO L182 omatonBuilderFactory]: Interpolants [2117#true, 2118#false, 2119#(<= 1 main_~length2~0), 2120#(and (= 0 |main_#t~malloc14.offset|) (<= 1 main_~length2~0)), 2121#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0)), 2122#(and (= 0 main_~nondetString2~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset)) (<= 2 (select |#length| main_~nondetString2~0.base)))), 2123#(and (= 0 |substring_#in~t.offset|) (or (<= 2 (select |#length| |substring_#in~t.base|)) (= 0 (select (select |#memory_int| |substring_#in~t.base|) |substring_#in~t.offset|)))), 2124#(and (or (= 0 (select (select |#memory_int| substring_~t.base) substring_~t.offset)) (<= 2 (select |#length| substring_~t.base))) (= 0 substring_~t.offset)), 2125#(and (or (= 0 (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset)) (<= 2 (select |#length| substring_~pt~0.base))) (= substring_~pt~0.offset 0)), 2126#(and (or (<= 2 (select |#length| substring_~pt~0.base)) (and (= 0 (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset)) (= |substring_#t~mem3| (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset)))) (= substring_~pt~0.offset 0)), 2127#(and (or (not |substring_#t~short6|) (<= 2 (select |#length| substring_~pt~0.base))) (= substring_~pt~0.offset 0)), 2128#(and (<= 2 (select |#length| substring_~pt~0.base)) (= substring_~pt~0.offset 0)), 2129#(and (<= (+ substring_~pt~0.offset 1) (select |#length| substring_~pt~0.base)) (<= 1 substring_~pt~0.offset))] [2018-04-12 20:41:08,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:08,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-12 20:41:08,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-12 20:41:08,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-04-12 20:41:08,571 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 13 states. [2018-04-12 20:41:08,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:08,783 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2018-04-12 20:41:08,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-12 20:41:08,783 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-04-12 20:41:08,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:08,783 INFO L225 Difference]: With dead ends: 97 [2018-04-12 20:41:08,783 INFO L226 Difference]: Without dead ends: 95 [2018-04-12 20:41:08,784 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-04-12 20:41:08,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-12 20:41:08,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 82. [2018-04-12 20:41:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-04-12 20:41:08,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-04-12 20:41:08,786 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 29 [2018-04-12 20:41:08,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:08,786 INFO L459 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-04-12 20:41:08,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-12 20:41:08,786 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-04-12 20:41:08,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-12 20:41:08,787 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:08,787 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 20:41:08,787 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:08,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1864805931, now seen corresponding path program 1 times [2018-04-12 20:41:08,788 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:08,798 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:08,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 20:41:08,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-12 20:41:08,907 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:08,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:08,908 INFO L182 omatonBuilderFactory]: Interpolants [2325#true, 2326#false, 2327#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 2328#(and (= (select |#valid| |main_#t~malloc13.base|) 1) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= 0 |main_#t~malloc13.offset|)), 2329#(and (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 2330#(and (not (= main_~nondetString1~0.base |main_#t~malloc14.base|)) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 2331#(and (<= 1 main_~length1~0) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 2332#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 2333#(= 0 (select (select |#memory_int| |substring_#in~s.base|) |substring_#in~s.offset|)), 2334#(= 0 (select (select |#memory_int| substring_~ps~0.base) substring_~ps~0.offset)), 2335#(and (= 0 (select (select |#memory_int| substring_~ps~0.base) substring_~ps~0.offset)) (= |substring_#t~mem2| (select (select |#memory_int| substring_~ps~0.base) substring_~ps~0.offset)))] [2018-04-12 20:41:08,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:08,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 20:41:08,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 20:41:08,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-04-12 20:41:08,909 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 11 states. [2018-04-12 20:41:09,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:09,019 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2018-04-12 20:41:09,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-12 20:41:09,019 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-04-12 20:41:09,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:09,020 INFO L225 Difference]: With dead ends: 74 [2018-04-12 20:41:09,020 INFO L226 Difference]: Without dead ends: 62 [2018-04-12 20:41:09,020 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-04-12 20:41:09,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-04-12 20:41:09,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-04-12 20:41:09,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-04-12 20:41:09,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-04-12 20:41:09,022 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 31 [2018-04-12 20:41:09,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:09,022 INFO L459 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-04-12 20:41:09,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 20:41:09,022 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-04-12 20:41:09,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-12 20:41:09,023 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:09,023 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 20:41:09,023 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:09,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1724257321, now seen corresponding path program 1 times [2018-04-12 20:41:09,024 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:09,033 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:09,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:09,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:41:09,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-12 20:41:09,197 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:09,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:09,197 INFO L182 omatonBuilderFactory]: Interpolants [2496#(and (<= 1 substring_~ps~0.offset) (<= (+ substring_~ps~0.offset 1) (select |#length| substring_~ps~0.base))), 2484#true, 2485#false, 2486#(<= 1 main_~length1~0), 2487#(and (= (select |#valid| |main_#t~malloc13.base|) 1) (<= 1 main_~length1~0) (= 0 |main_#t~malloc13.offset|)), 2488#(and (= 0 main_~nondetString1~0.offset) (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length1~0)), 2489#(and (= 0 main_~nondetString1~0.offset) (not (= main_~nondetString1~0.base |main_#t~malloc14.base|)) (<= 1 main_~length1~0)), 2490#(and (= 0 main_~nondetString1~0.offset) (<= 1 main_~length1~0) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 2491#(and (= 0 main_~nondetString1~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset)) (<= 2 (select |#length| main_~nondetString1~0.base))) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 2492#(and (or (= 0 (select (select |#memory_int| |substring_#in~s.base|) |substring_#in~s.offset|)) (<= 2 (select |#length| |substring_#in~s.base|))) (= 0 |substring_#in~s.offset|)), 2493#(and (= substring_~ps~0.offset 0) (or (= 0 (select (select |#memory_int| substring_~ps~0.base) substring_~ps~0.offset)) (<= 2 (select |#length| substring_~ps~0.base)))), 2494#(and (or (<= 2 (select |#length| substring_~ps~0.base)) (and (= 0 (select (select |#memory_int| substring_~ps~0.base) substring_~ps~0.offset)) (= |substring_#t~mem2| (select (select |#memory_int| substring_~ps~0.base) substring_~ps~0.offset)))) (= substring_~ps~0.offset 0)), 2495#(and (= substring_~ps~0.offset 0) (<= 2 (select |#length| substring_~ps~0.base)))] [2018-04-12 20:41:09,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:09,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-12 20:41:09,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-12 20:41:09,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-04-12 20:41:09,198 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 13 states. [2018-04-12 20:41:09,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:09,347 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2018-04-12 20:41:09,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-12 20:41:09,347 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-04-12 20:41:09,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:09,348 INFO L225 Difference]: With dead ends: 125 [2018-04-12 20:41:09,348 INFO L226 Difference]: Without dead ends: 125 [2018-04-12 20:41:09,348 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2018-04-12 20:41:09,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-12 20:41:09,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2018-04-12 20:41:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-12 20:41:09,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2018-04-12 20:41:09,351 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 31 [2018-04-12 20:41:09,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:09,351 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2018-04-12 20:41:09,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-12 20:41:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2018-04-12 20:41:09,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-12 20:41:09,352 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:09,352 INFO L355 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] [2018-04-12 20:41:09,352 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:09,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1820036441, now seen corresponding path program 1 times [2018-04-12 20:41:09,353 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:09,363 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:09,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:09,537 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:41:09,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-12 20:41:09,537 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:09,538 INFO L182 omatonBuilderFactory]: Interpolants [2723#true, 2724#false, 2725#(<= 1 main_~length1~0), 2726#(and (= (select |#valid| |main_#t~malloc13.base|) 1) (<= 1 main_~length1~0) (= 0 |main_#t~malloc13.offset|)), 2727#(and (= 0 main_~nondetString1~0.offset) (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length1~0)), 2728#(and (= 0 main_~nondetString1~0.offset) (not (= main_~nondetString1~0.base |main_#t~malloc14.base|)) (<= 1 main_~length1~0)), 2729#(and (= 0 main_~nondetString1~0.offset) (<= 1 main_~length1~0) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 2730#(and (= 0 main_~nondetString1~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset)) (<= 2 (select |#length| main_~nondetString1~0.base))) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 2731#(and (or (= 0 (select (select |#memory_int| |substring_#in~s.base|) |substring_#in~s.offset|)) (<= 2 (select |#length| |substring_#in~s.base|))) (= 0 |substring_#in~s.offset|)), 2732#(and (= 0 substring_~ps~0.offset) (or (= 0 (select (select |#memory_int| substring_~ps~0.base) substring_~ps~0.offset)) (<= 2 (select |#length| substring_~ps~0.base)))), 2733#(and (= substring_~ps2~0.offset 0) (or (<= 2 (select |#length| substring_~ps2~0.base)) (= 0 (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset)))), 2734#(and (= substring_~ps2~0.offset 0) (or (<= 2 (select |#length| substring_~ps2~0.base)) (and (= 0 (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset)) (= |substring_#t~mem3| (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset))))), 2735#(and (= substring_~ps2~0.offset 0) (or (not |substring_#t~short6|) (<= 2 (select |#length| substring_~ps2~0.base)) (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset))))), 2736#(and (= substring_~ps2~0.offset 0) (or (<= 2 (select |#length| substring_~ps2~0.base)) (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset))))), 2737#(and (or (<= 2 (select |#length| substring_~ps2~0.base)) (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) |substring_#t~mem4|))) (= substring_~ps2~0.offset 0)), 2738#(and (= substring_~ps2~0.offset 0) (or (<= 2 (select |#length| substring_~ps2~0.base)) (and (= |substring_#t~mem5| (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset)) (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) |substring_#t~mem4|))))), 2739#(and (= substring_~ps2~0.offset 0) (or (not |substring_#t~short6|) (<= 2 (select |#length| substring_~ps2~0.base)))), 2740#(and (<= 1 substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 1) (select |#length| substring_~ps2~0.base)))] [2018-04-12 20:41:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:09,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-12 20:41:09,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-12 20:41:09,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-04-12 20:41:09,539 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand 18 states. [2018-04-12 20:41:09,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:09,974 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2018-04-12 20:41:09,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-12 20:41:09,974 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-04-12 20:41:09,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:09,975 INFO L225 Difference]: With dead ends: 100 [2018-04-12 20:41:09,975 INFO L226 Difference]: Without dead ends: 100 [2018-04-12 20:41:09,976 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=926, Unknown=0, NotChecked=0, Total=1122 [2018-04-12 20:41:09,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-12 20:41:09,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2018-04-12 20:41:09,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-12 20:41:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2018-04-12 20:41:09,979 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 33 [2018-04-12 20:41:09,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:09,980 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2018-04-12 20:41:09,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-12 20:41:09,980 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2018-04-12 20:41:09,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-12 20:41:09,980 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:09,980 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-12 20:41:09,981 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:09,981 INFO L82 PathProgramCache]: Analyzing trace with hash 2127994563, now seen corresponding path program 2 times [2018-04-12 20:41:09,981 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:09,996 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:10,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:10,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:41:10,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-12 20:41:10,231 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:10,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:10,231 INFO L182 omatonBuilderFactory]: Interpolants [2958#true, 2959#false, 2960#(and (= 0 |main_#t~malloc14.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc14.base|))), 2961#(and (= 0 main_~nondetString2~0.offset) (or (= (+ main_~nondetString2~0.offset main_~length2~0) 2) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))), 2962#(and (= 0 main_~nondetString2~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString2~0.base) 1)) (<= (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base)) 1) (<= 3 (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base))))), 2963#(and (or (<= (select |#length| |substring_#in~t.base|) 1) (= 0 (select (select |#memory_int| |substring_#in~t.base|) 1)) (<= 3 (select |#length| |substring_#in~t.base|))) (= 0 |substring_#in~t.offset|)), 2964#(and (or (= 0 (select (select |#memory_int| substring_~t.base) 1)) (<= 3 (select |#length| substring_~t.base)) (<= (select |#length| substring_~t.base) 1)) (= 0 substring_~t.offset)), 2965#(and (or (<= (select |#length| substring_~pt~0.base) 1) (<= 3 (select |#length| substring_~pt~0.base)) (= 0 (select (select |#memory_int| substring_~pt~0.base) 1))) (= substring_~pt~0.offset 0)), 2966#(or (and (= 0 (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset)) (= 1 substring_~pt~0.offset)) (and (or (<= (+ substring_~pt~0.offset 2) (select |#length| substring_~pt~0.base)) (<= (select |#length| substring_~pt~0.base) substring_~pt~0.offset)) (<= 1 substring_~pt~0.offset))), 2967#(or (and (= 0 (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset)) (= 1 substring_~pt~0.offset) (= |substring_#t~mem3| (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset))) (and (<= (+ substring_~pt~0.offset 2) (select |#length| substring_~pt~0.base)) (<= 1 substring_~pt~0.offset))), 2968#(or (and (<= (+ substring_~pt~0.offset 2) (select |#length| substring_~pt~0.base)) (<= 1 substring_~pt~0.offset)) (and (not |substring_#t~short6|) (= 1 substring_~pt~0.offset))), 2969#(and (<= (+ substring_~pt~0.offset 2) (select |#length| substring_~pt~0.base)) (<= 1 substring_~pt~0.offset)), 2970#(and (<= 2 substring_~pt~0.offset) (<= (+ substring_~pt~0.offset 1) (select |#length| substring_~pt~0.base)))] [2018-04-12 20:41:10,231 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:10,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-12 20:41:10,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-12 20:41:10,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-04-12 20:41:10,231 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand 13 states. [2018-04-12 20:41:10,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:10,637 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2018-04-12 20:41:10,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-12 20:41:10,637 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-04-12 20:41:10,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:10,639 INFO L225 Difference]: With dead ends: 134 [2018-04-12 20:41:10,639 INFO L226 Difference]: Without dead ends: 132 [2018-04-12 20:41:10,639 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2018-04-12 20:41:10,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-12 20:41:10,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 101. [2018-04-12 20:41:10,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-12 20:41:10,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 119 transitions. [2018-04-12 20:41:10,643 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 119 transitions. Word has length 37 [2018-04-12 20:41:10,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:10,643 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 119 transitions. [2018-04-12 20:41:10,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-12 20:41:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 119 transitions. [2018-04-12 20:41:10,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-12 20:41:10,644 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:10,644 INFO L355 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] [2018-04-12 20:41:10,644 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:10,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1372787131, now seen corresponding path program 1 times [2018-04-12 20:41:10,645 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:10,653 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:10,720 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:10,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:41:10,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-12 20:41:10,721 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:10,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:10,721 INFO L182 omatonBuilderFactory]: Interpolants [3232#(and (<= 1 substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 1) (select |#length| substring_~ps2~0.base))), 3224#true, 3225#false, 3226#(= 0 |main_#t~malloc13.offset|), 3227#(= 0 main_~nondetString1~0.offset), 3228#(= 0 |substring_#in~s.offset|), 3229#(= substring_~ps~0.offset 0), 3230#(<= 1 substring_~ps~0.offset), 3231#(and (<= 1 substring_~ps~0.offset) (<= (+ substring_~ps~0.offset 1) (select |#length| substring_~ps~0.base)))] [2018-04-12 20:41:10,721 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:10,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 20:41:10,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 20:41:10,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-04-12 20:41:10,722 INFO L87 Difference]: Start difference. First operand 101 states and 119 transitions. Second operand 9 states. [2018-04-12 20:41:10,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:10,793 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2018-04-12 20:41:10,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 20:41:10,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-04-12 20:41:10,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:10,794 INFO L225 Difference]: With dead ends: 113 [2018-04-12 20:41:10,794 INFO L226 Difference]: Without dead ends: 113 [2018-04-12 20:41:10,794 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-04-12 20:41:10,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-04-12 20:41:10,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2018-04-12 20:41:10,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-12 20:41:10,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 118 transitions. [2018-04-12 20:41:10,796 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 118 transitions. Word has length 38 [2018-04-12 20:41:10,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:10,796 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 118 transitions. [2018-04-12 20:41:10,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 20:41:10,797 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 118 transitions. [2018-04-12 20:41:10,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-12 20:41:10,797 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:10,797 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-12 20:41:10,797 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:10,797 INFO L82 PathProgramCache]: Analyzing trace with hash -518903735, now seen corresponding path program 2 times [2018-04-12 20:41:10,798 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:10,807 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:11,126 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:11,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:41:11,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-12 20:41:11,126 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:11,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:11,126 INFO L182 omatonBuilderFactory]: Interpolants [3459#true, 3460#false, 3461#(and (= main_~length1~0 (select |#length| |main_#t~malloc13.base|)) (= (select |#valid| |main_#t~malloc13.base|) 1) (= 0 |main_#t~malloc13.offset|)), 3462#(and (= 0 main_~nondetString1~0.offset) (= (select |#valid| main_~nondetString1~0.base) 1) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 3463#(and (= 0 main_~nondetString1~0.offset) (not (= main_~nondetString1~0.base |main_#t~malloc14.base|)) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 3464#(and (= 0 main_~nondetString1~0.offset) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 3465#(and (= 0 main_~nondetString1~0.offset) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (or (= 0 (select (select |#memory_int| main_~nondetString1~0.base) 1)) (<= 3 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (<= (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base)) 1))), 3466#(and (or (<= 3 (select |#length| |substring_#in~s.base|)) (<= (select |#length| |substring_#in~s.base|) 1) (= 0 (select (select |#memory_int| |substring_#in~s.base|) 1))) (= 0 |substring_#in~s.offset|)), 3467#(and (= 0 substring_~ps~0.offset) (or (= 0 (select (select |#memory_int| substring_~ps~0.base) 1)) (<= 3 (select |#length| substring_~ps~0.base)) (<= (select |#length| substring_~ps~0.base) 1))), 3468#(and (= substring_~ps2~0.offset 0) (or (= 0 (select (select |#memory_int| substring_~ps2~0.base) 1)) (<= 3 (select |#length| substring_~ps2~0.base)) (<= (select |#length| substring_~ps2~0.base) 1))), 3469#(and (= 1 substring_~ps2~0.offset) (or (= 0 (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset)) (<= (select |#length| substring_~ps2~0.base) substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base)))), 3470#(and (or (and (= 0 (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset)) (= |substring_#t~mem3| (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset))) (<= (select |#length| substring_~ps2~0.base) substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base))) (= 1 substring_~ps2~0.offset)), 3471#(and (= 1 substring_~ps2~0.offset) (or (not |substring_#t~short6|) (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset))) (<= (select |#length| substring_~ps2~0.base) substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base)))), 3472#(and (= 1 substring_~ps2~0.offset) (or (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset))) (<= (select |#length| substring_~ps2~0.base) substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base)))), 3473#(and (= 1 substring_~ps2~0.offset) (or (<= (select |#length| substring_~ps2~0.base) substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base)) (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) |substring_#t~mem4|)))), 3474#(and (= 1 substring_~ps2~0.offset) (or (and (= |substring_#t~mem5| (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset)) (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) |substring_#t~mem4|))) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base)))), 3475#(and (= 1 substring_~ps2~0.offset) (or (not |substring_#t~short6|) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base)))), 3476#(and (<= 2 substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 1) (select |#length| substring_~ps2~0.base)))] [2018-04-12 20:41:11,127 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:11,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-12 20:41:11,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-12 20:41:11,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-04-12 20:41:11,127 INFO L87 Difference]: Start difference. First operand 101 states and 118 transitions. Second operand 18 states. [2018-04-12 20:41:11,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:11,777 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2018-04-12 20:41:11,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-12 20:41:11,777 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-04-12 20:41:11,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:11,778 INFO L225 Difference]: With dead ends: 121 [2018-04-12 20:41:11,778 INFO L226 Difference]: Without dead ends: 121 [2018-04-12 20:41:11,779 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=1061, Unknown=0, NotChecked=0, Total=1260 [2018-04-12 20:41:11,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-04-12 20:41:11,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 101. [2018-04-12 20:41:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-12 20:41:11,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2018-04-12 20:41:11,780 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 41 [2018-04-12 20:41:11,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:11,781 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2018-04-12 20:41:11,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-12 20:41:11,781 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2018-04-12 20:41:11,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-12 20:41:11,781 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:11,781 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-12 20:41:11,781 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:11,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1224572237, now seen corresponding path program 2 times [2018-04-12 20:41:11,782 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:11,788 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:11,951 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:41:11,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-12 20:41:11,951 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:11,951 INFO L182 omatonBuilderFactory]: Interpolants [3744#(or (<= (select |#length| substring_~ps~0.base) substring_~ps~0.offset) (and (<= 1 substring_~ps~0.offset) (<= (+ substring_~ps~0.offset 2) (select |#length| substring_~ps~0.base))) (and (<= substring_~ps~0.offset 1) (= 0 (select (select |#memory_int| substring_~ps~0.base) 1)) (<= 1 substring_~ps~0.offset))), 3745#(or (and (<= 1 substring_~ps~0.offset) (<= (+ substring_~ps~0.offset 2) (select |#length| substring_~ps~0.base))) (and (<= substring_~ps~0.offset 1) (= 0 (select (select |#memory_int| substring_~ps~0.base) 1)) (<= 1 substring_~ps~0.offset) (= |substring_#t~mem2| (select (select |#memory_int| substring_~ps~0.base) substring_~ps~0.offset)))), 3746#(and (= substring_~ps~0.offset substring_~ps2~0.offset) (<= 1 substring_~ps~0.offset) (<= (+ substring_~ps~0.offset 2) (select |#length| substring_~ps~0.base))), 3747#(and (<= 1 substring_~ps~0.offset) (<= (+ substring_~ps~0.offset 2) (select |#length| substring_~ps~0.base))), 3748#(and (<= (+ substring_~ps~0.offset 1) (select |#length| substring_~ps~0.base)) (<= 2 substring_~ps~0.offset)), 3735#true, 3736#false, 3737#(and (= main_~length1~0 (select |#length| |main_#t~malloc13.base|)) (= (select |#valid| |main_#t~malloc13.base|) 1) (= 0 |main_#t~malloc13.offset|)), 3738#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 3739#(and (not (= main_~nondetString1~0.base |main_#t~malloc14.base|)) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 3740#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 3741#(and (or (<= 3 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (<= (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base)) 1) (and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) 1)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)))) (= main_~nondetString1~0.offset 0)), 3742#(and (or (<= 3 (select |#length| |substring_#in~s.base|)) (<= (select |#length| |substring_#in~s.base|) 1) (= 0 (select (select |#memory_int| |substring_#in~s.base|) 1))) (= 0 |substring_#in~s.offset|)), 3743#(and (= substring_~ps~0.offset 0) (or (= 0 (select (select |#memory_int| substring_~ps~0.base) 1)) (<= 3 (select |#length| substring_~ps~0.base)) (<= (select |#length| substring_~ps~0.base) 1)))] [2018-04-12 20:41:11,952 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:11,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-12 20:41:11,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-12 20:41:11,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-04-12 20:41:11,952 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand 14 states. [2018-04-12 20:41:12,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:12,289 INFO L93 Difference]: Finished difference Result 195 states and 221 transitions. [2018-04-12 20:41:12,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-12 20:41:12,289 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-04-12 20:41:12,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:12,289 INFO L225 Difference]: With dead ends: 195 [2018-04-12 20:41:12,290 INFO L226 Difference]: Without dead ends: 195 [2018-04-12 20:41:12,290 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-04-12 20:41:12,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-04-12 20:41:12,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 139. [2018-04-12 20:41:12,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-04-12 20:41:12,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 166 transitions. [2018-04-12 20:41:12,292 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 166 transitions. Word has length 44 [2018-04-12 20:41:12,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:12,292 INFO L459 AbstractCegarLoop]: Abstraction has 139 states and 166 transitions. [2018-04-12 20:41:12,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-12 20:41:12,292 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 166 transitions. [2018-04-12 20:41:12,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-12 20:41:12,293 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:12,293 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 20:41:12,293 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:12,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1069957555, now seen corresponding path program 3 times [2018-04-12 20:41:12,293 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:12,299 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:12,425 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-04-12 20:41:12,425 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:41:12,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-12 20:41:12,426 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:12,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:12,426 INFO L182 omatonBuilderFactory]: Interpolants [4103#true, 4104#false, 4105#(and (= 0 |main_#t~malloc14.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc14.base|))), 4106#(and (= main_~nondetString2~0.offset 0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 4107#(and (= main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) (+ (select |#length| main_~nondetString2~0.base) (+ main_~nondetString2~0.offset (- 1)))))), 4108#(= 0 (select (select |#memory_int| |substring_#in~t.base|) (+ (select |#length| |substring_#in~t.base|) (- 1)))), 4109#(= 0 (select (select |#memory_int| substring_~t.base) (+ (select |#length| substring_~t.base) (- 1)))), 4110#(= 0 (select (select |#memory_int| substring_~pt~0.base) (+ (select |#length| substring_~pt~0.base) (- 1)))), 4111#(or (= 0 (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset)) (<= (+ substring_~pt~0.offset 2) (select |#length| substring_~pt~0.base)) (<= (select |#length| substring_~pt~0.base) substring_~pt~0.offset)), 4112#(and (or (<= (+ substring_~pt~0.offset 2) (select |#length| substring_~pt~0.base)) (and (= 0 (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset)) (= |substring_#t~mem3| (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset)))) (<= 0 substring_~pt~0.offset)), 4113#(and (<= 0 substring_~pt~0.offset) (or (not |substring_#t~short6|) (<= (+ substring_~pt~0.offset 2) (select |#length| substring_~pt~0.base)))), 4114#(and (<= (+ substring_~pt~0.offset 2) (select |#length| substring_~pt~0.base)) (<= 0 substring_~pt~0.offset)), 4115#(and (<= (+ substring_~pt~0.offset 1) (select |#length| substring_~pt~0.base)) (<= 1 substring_~pt~0.offset))] [2018-04-12 20:41:12,426 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-04-12 20:41:12,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-12 20:41:12,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-12 20:41:12,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-04-12 20:41:12,427 INFO L87 Difference]: Start difference. First operand 139 states and 166 transitions. Second operand 13 states. [2018-04-12 20:41:12,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:12,657 INFO L93 Difference]: Finished difference Result 151 states and 171 transitions. [2018-04-12 20:41:12,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 20:41:12,657 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2018-04-12 20:41:12,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:12,658 INFO L225 Difference]: With dead ends: 151 [2018-04-12 20:41:12,658 INFO L226 Difference]: Without dead ends: 149 [2018-04-12 20:41:12,658 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-04-12 20:41:12,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-04-12 20:41:12,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 93. [2018-04-12 20:41:12,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-04-12 20:41:12,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2018-04-12 20:41:12,661 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 45 [2018-04-12 20:41:12,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:12,661 INFO L459 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2018-04-12 20:41:12,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-12 20:41:12,661 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-04-12 20:41:12,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-12 20:41:12,661 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:12,661 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-12 20:41:12,661 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:12,661 INFO L82 PathProgramCache]: Analyzing trace with hash 981065013, now seen corresponding path program 1 times [2018-04-12 20:41:12,662 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:12,669 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:12,933 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:41:12,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-12 20:41:12,933 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:12,934 INFO L182 omatonBuilderFactory]: Interpolants [4384#(and (= main_~length1~0 (select |#length| |main_#t~malloc13.base|)) (= (select |#valid| |main_#t~malloc13.base|) 1) (= 0 |main_#t~malloc13.offset|)), 4385#(and (= 0 main_~nondetString1~0.offset) (= (select |#valid| main_~nondetString1~0.base) 1) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 4386#(and (= 0 main_~nondetString1~0.offset) (or (not (= main_~nondetString1~0.base |main_#t~malloc14.base|)) (not (= (+ main_~nondetString1~0.offset main_~length1~0) 2))) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 4387#(and (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 2)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (= 0 main_~nondetString1~0.offset) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 4388#(and (= 0 main_~nondetString1~0.offset) (or (<= 3 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (<= (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base)) 1) (and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) 1)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))))), 4389#(and (or (<= 3 (select |#length| |substring_#in~s.base|)) (<= (select |#length| |substring_#in~s.base|) 1) (= 0 (select (select |#memory_int| |substring_#in~s.base|) 1))) (= 0 |substring_#in~s.offset|)), 4390#(and (= substring_~ps~0.offset 0) (or (= 0 (select (select |#memory_int| substring_~ps~0.base) 1)) (<= 3 (select |#length| substring_~ps~0.base)) (<= (select |#length| substring_~ps~0.base) 1))), 4391#(or (<= (select |#length| substring_~ps~0.base) substring_~ps~0.offset) (and (= 0 (select (select |#memory_int| substring_~ps~0.base) 1)) (= 1 substring_~ps~0.offset)) (<= (+ substring_~ps~0.offset 2) (select |#length| substring_~ps~0.base))), 4392#(or (and (= 0 (select (select |#memory_int| substring_~ps~0.base) 1)) (= 1 substring_~ps~0.offset)) (<= (+ substring_~ps~0.offset 2) (select |#length| substring_~ps~0.base))), 4393#(or (= 0 (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset)) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base))), 4394#(or (and (= 0 (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset)) (= |substring_#t~mem3| (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset))) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base))), 4395#(or (not |substring_#t~short6|) (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset))) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base))), 4396#(or (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset))) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base))), 4397#(or (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base)) (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) |substring_#t~mem4|))), 4398#(or (and (= |substring_#t~mem5| (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset)) (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) |substring_#t~mem4|))) (and (<= 0 substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base)))), 4399#(or (not |substring_#t~short6|) (and (<= 0 substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base)))), 4400#(and (<= 1 substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 1) (select |#length| substring_~ps2~0.base))), 4382#true, 4383#false] [2018-04-12 20:41:12,934 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:12,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-12 20:41:12,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-12 20:41:12,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-04-12 20:41:12,935 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 19 states. [2018-04-12 20:41:13,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:13,534 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2018-04-12 20:41:13,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-12 20:41:13,534 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2018-04-12 20:41:13,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:13,534 INFO L225 Difference]: With dead ends: 115 [2018-04-12 20:41:13,534 INFO L226 Difference]: Without dead ends: 115 [2018-04-12 20:41:13,535 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=1113, Unknown=0, NotChecked=0, Total=1332 [2018-04-12 20:41:13,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-04-12 20:41:13,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2018-04-12 20:41:13,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-12 20:41:13,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2018-04-12 20:41:13,536 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 46 [2018-04-12 20:41:13,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:13,537 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2018-04-12 20:41:13,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-12 20:41:13,537 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2018-04-12 20:41:13,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-12 20:41:13,537 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:13,537 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 20:41:13,537 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:13,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1969827015, now seen corresponding path program 3 times [2018-04-12 20:41:13,538 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:13,547 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:13,743 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-04-12 20:41:13,743 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:41:13,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-12 20:41:13,743 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:13,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:13,744 INFO L182 omatonBuilderFactory]: Interpolants [4653#true, 4654#false, 4655#(and (= main_~length1~0 (select |#length| |main_#t~malloc13.base|)) (= (select |#valid| |main_#t~malloc13.base|) 1) (= 0 |main_#t~malloc13.offset|)), 4656#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 4657#(and (not (= main_~nondetString1~0.base |main_#t~malloc14.base|)) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 4658#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 4659#(and (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= 0 (select (select |#memory_int| main_~nondetString1~0.base) (+ (select |#length| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset (- 1))))) (= main_~nondetString1~0.offset 0)), 4660#(= 0 (select (select |#memory_int| |substring_#in~s.base|) (+ (select |#length| |substring_#in~s.base|) (- 1)))), 4661#(= 0 (select (select |#memory_int| substring_~ps~0.base) (+ (select |#length| substring_~ps~0.base) (- 1)))), 4662#(= 0 (select (select |#memory_int| substring_~ps2~0.base) (+ (select |#length| substring_~ps2~0.base) (- 1)))), 4663#(or (= 0 (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset)) (<= (select |#length| substring_~ps2~0.base) substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base))), 4664#(or (and (= 0 (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset)) (= |substring_#t~mem3| (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset))) (<= (select |#length| substring_~ps2~0.base) substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base))), 4665#(or (not |substring_#t~short6|) (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset))) (<= (select |#length| substring_~ps2~0.base) substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base))), 4666#(or (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset))) (<= (select |#length| substring_~ps2~0.base) substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base))), 4667#(or (<= (select |#length| substring_~ps2~0.base) substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base)) (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) |substring_#t~mem4|))), 4668#(and (<= 0 substring_~ps2~0.offset) (or (and (= |substring_#t~mem5| (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset)) (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) |substring_#t~mem4|))) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base)))), 4669#(and (<= 0 substring_~ps2~0.offset) (or (not |substring_#t~short6|) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base)))), 4670#(and (<= 1 substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 1) (select |#length| substring_~ps2~0.base)))] [2018-04-12 20:41:13,744 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-04-12 20:41:13,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-12 20:41:13,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-12 20:41:13,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-04-12 20:41:13,745 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 18 states. [2018-04-12 20:41:14,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:14,471 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-04-12 20:41:14,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-12 20:41:14,471 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-04-12 20:41:14,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:14,472 INFO L225 Difference]: With dead ends: 117 [2018-04-12 20:41:14,472 INFO L226 Difference]: Without dead ends: 117 [2018-04-12 20:41:14,472 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=322, Invalid=1160, Unknown=0, NotChecked=0, Total=1482 [2018-04-12 20:41:14,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-04-12 20:41:14,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 58. [2018-04-12 20:41:14,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-04-12 20:41:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-04-12 20:41:14,474 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 49 [2018-04-12 20:41:14,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:14,475 INFO L459 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-04-12 20:41:14,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-12 20:41:14,475 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-04-12 20:41:14,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-12 20:41:14,475 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:41:14,475 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 20:41:14,475 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 20:41:14,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1291252055, now seen corresponding path program 3 times [2018-04-12 20:41:14,476 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:41:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:41:14,487 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:41:14,646 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-04-12 20:41:14,647 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:41:14,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-12 20:41:14,647 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:41:14,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:41:14,647 INFO L182 omatonBuilderFactory]: Interpolants [4896#(= 0 (select (select |#memory_int| substring_~ps~0.base) (+ (select |#length| substring_~ps~0.base) (- 1)))), 4897#(and (or (and (= 0 (select (select |#memory_int| substring_~ps~0.base) (+ (+ substring_~ps~0.offset 1) (- 1)))) (= |substring_#t~mem2| (select (select |#memory_int| substring_~ps~0.base) substring_~ps~0.offset))) (<= (+ substring_~ps~0.offset 2) (select |#length| substring_~ps~0.base))) (<= (+ substring_~ps~0.offset 1) (select |#length| substring_~ps~0.base)) (<= 0 substring_~ps~0.offset)), 4898#(and (= substring_~ps~0.offset substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps~0.base)) (<= 0 substring_~ps~0.offset)), 4899#(and (<= 0 substring_~ps~0.offset) (<= (+ substring_~ps~0.offset 2) (select |#length| substring_~ps~0.base))), 4900#(and (<= 1 substring_~ps~0.offset) (<= (+ substring_~ps~0.offset 1) (select |#length| substring_~ps~0.base))), 4888#true, 4889#false, 4890#(and (= main_~length1~0 (select |#length| |main_#t~malloc13.base|)) (= (select |#valid| |main_#t~malloc13.base|) 1) (= 0 |main_#t~malloc13.offset|)), 4891#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 4892#(and (not (= main_~nondetString1~0.base |main_#t~malloc14.base|)) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 4893#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 4894#(and (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= 0 (select (select |#memory_int| main_~nondetString1~0.base) (+ (select |#length| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset (- 1))))) (= main_~nondetString1~0.offset 0)), 4895#(= 0 (select (select |#memory_int| |substring_#in~s.base|) (+ (select |#length| |substring_#in~s.base|) (- 1))))] [2018-04-12 20:41:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-04-12 20:41:14,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-12 20:41:14,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-12 20:41:14,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-04-12 20:41:14,648 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 13 states. [2018-04-12 20:41:14,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:41:14,949 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2018-04-12 20:41:14,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-12 20:41:14,949 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-04-12 20:41:14,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:41:14,949 INFO L225 Difference]: With dead ends: 87 [2018-04-12 20:41:14,949 INFO L226 Difference]: Without dead ends: 0 [2018-04-12 20:41:14,950 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2018-04-12 20:41:14,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-12 20:41:14,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-12 20:41:14,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-12 20:41:14,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-12 20:41:14,950 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2018-04-12 20:41:14,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:41:14,950 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-12 20:41:14,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-12 20:41:14,950 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-12 20:41:14,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-12 20:41:14,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.04 08:41:14 BoogieIcfgContainer [2018-04-12 20:41:14,953 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-12 20:41:14,953 INFO L168 Benchmark]: Toolchain (without parser) took 9716.28 ms. Allocated memory was 396.4 MB in the beginning and 825.2 MB in the end (delta: 428.9 MB). Free memory was 332.6 MB in the beginning and 754.3 MB in the end (delta: -421.7 MB). Peak memory consumption was 7.1 MB. Max. memory is 5.3 GB. [2018-04-12 20:41:14,954 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 396.4 MB. Free memory is still 356.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 20:41:14,954 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.29 ms. Allocated memory is still 396.4 MB. Free memory was 332.6 MB in the beginning and 308.8 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-12 20:41:14,955 INFO L168 Benchmark]: Boogie Preprocessor took 41.82 ms. Allocated memory is still 396.4 MB. Free memory was 308.8 MB in the beginning and 306.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-12 20:41:14,955 INFO L168 Benchmark]: RCFGBuilder took 380.31 ms. Allocated memory was 396.4 MB in the beginning and 595.1 MB in the end (delta: 198.7 MB). Free memory was 306.2 MB in the beginning and 528.3 MB in the end (delta: -222.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 5.3 GB. [2018-04-12 20:41:14,955 INFO L168 Benchmark]: TraceAbstraction took 9050.71 ms. Allocated memory was 595.1 MB in the beginning and 825.2 MB in the end (delta: 230.2 MB). Free memory was 528.3 MB in the beginning and 754.3 MB in the end (delta: -226.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 5.3 GB. [2018-04-12 20:41:14,957 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 396.4 MB. Free memory is still 356.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 240.29 ms. Allocated memory is still 396.4 MB. Free memory was 332.6 MB in the beginning and 308.8 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.82 ms. Allocated memory is still 396.4 MB. Free memory was 308.8 MB in the beginning and 306.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 380.31 ms. Allocated memory was 396.4 MB in the beginning and 595.1 MB in the end (delta: 198.7 MB). Free memory was 306.2 MB in the beginning and 528.3 MB in the end (delta: -222.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 9050.71 ms. Allocated memory was 595.1 MB in the beginning and 825.2 MB in the end (delta: 230.2 MB). Free memory was 528.3 MB in the beginning and 754.3 MB in the end (delta: -226.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 62 locations, 15 error locations. SAFE Result, 9.0s OverallTime, 27 OverallIterations, 4 TraceHistogramMax, 5.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 925 SDtfs, 2238 SDslu, 3349 SDs, 0 SdLazy, 4233 SolverSat, 267 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 477 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 413 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 43/218 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 27 MinimizatonAttempts, 424 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 803 NumberOfCodeBlocks, 803 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 776 ConstructedInterpolants, 0 QuantifiedInterpolants, 254790 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 16 PerfectInterpolantSequences, 43/218 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-12_20-41-14-964.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-12_20-41-14-964.csv Received shutdown request...