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_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-12 06:14:40,481 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 06:14:40,482 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 06:14:40,494 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 06:14:40,494 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 06:14:40,495 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 06:14:40,496 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 06:14:40,497 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 06:14:40,499 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 06:14:40,500 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 06:14:40,500 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 06:14:40,501 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 06:14:40,501 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 06:14:40,502 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 06:14:40,503 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 06:14:40,505 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 06:14:40,506 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 06:14:40,507 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 06:14:40,508 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 06:14:40,509 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 06:14:40,510 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 06:14:40,511 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 06:14:40,511 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 06:14:40,512 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 06:14:40,512 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 06:14:40,513 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 06:14:40,513 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 06:14:40,514 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 06:14:40,514 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 06:14:40,515 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 06:14:40,515 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 06:14:40,515 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_NoArray.epf [2018-04-12 06:14:40,536 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 06:14:40,536 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 06:14:40,537 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-12 06:14:40,537 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-12 06:14:40,537 INFO L133 SettingsManager]: * Use SBE=true [2018-04-12 06:14:40,537 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 06:14:40,537 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 06:14:40,537 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 06:14:40,537 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 06:14:40,538 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 06:14:40,538 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 06:14:40,538 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 06:14:40,538 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-12 06:14:40,538 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 06:14:40,538 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 06:14:40,538 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 06:14:40,538 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-12 06:14:40,538 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-12 06:14:40,538 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 06:14:40,539 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 06:14:40,539 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 06:14:40,539 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-12 06:14:40,539 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-12 06:14:40,539 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-12 06:14:40,565 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 06:14:40,572 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 06:14:40,575 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 06:14:40,575 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 06:14:40,576 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 06:14:40,576 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 06:14:40,865 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe7e5296bb [2018-04-12 06:14:41,024 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 06:14:41,025 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 06:14:41,025 INFO L168 CDTParser]: Scanning substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 06:14:41,033 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 06:14:41,034 INFO L215 ultiparseSymbolTable]: [2018-04-12 06:14:41,034 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 06:14:41,034 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 06:14:41,034 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 06:14:41,034 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 06:14:41,034 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 06:14:41,034 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 06:14:41,034 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 06:14:41,035 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 06:14:41,035 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 06:14:41,035 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 06:14:41,035 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 06:14:41,035 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 06:14:41,035 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 06:14:41,035 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 06:14:41,035 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 06:14:41,035 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 06:14:41,035 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 06:14:41,035 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 06:14:41,036 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 06:14:41,036 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 06:14:41,036 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 06:14:41,036 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 06:14:41,036 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 06:14:41,036 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 06:14:41,036 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 06:14:41,036 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 06:14:41,036 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 06:14:41,036 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 06:14:41,036 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 06:14:41,036 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 06:14:41,037 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 06:14:41,037 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 06:14:41,037 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 06:14:41,037 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 06:14:41,037 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 06:14:41,037 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 06:14:41,037 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 06:14:41,037 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 06:14:41,037 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 06:14:41,037 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 06:14:41,037 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 06:14:41,038 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 06:14:41,038 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 06:14:41,038 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 06:14:41,038 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 06:14:41,038 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 06:14:41,038 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 06:14:41,038 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 06:14:41,038 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 06:14:41,038 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 06:14:41,038 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 06:14:41,038 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 06:14:41,039 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 06:14:41,039 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 06:14:41,039 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 06:14:41,039 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 06:14:41,039 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 06:14:41,039 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 06:14:41,039 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 06:14:41,039 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 06:14:41,039 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 06:14:41,039 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 06:14:41,039 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 06:14:41,040 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 06:14:41,040 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 06:14:41,040 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 06:14:41,040 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 06:14:41,040 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 06:14:41,040 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 06:14:41,040 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 06:14:41,040 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 06:14:41,040 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 06:14:41,040 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 06:14:41,040 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 06:14:41,041 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 06:14:41,041 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 06:14:41,041 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 06:14:41,041 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 06:14:41,041 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 06:14:41,041 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 06:14:41,041 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 06:14:41,041 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 06:14:41,041 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 06:14:41,041 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 06:14:41,042 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 06:14:41,042 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 06:14:41,042 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 06:14:41,042 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 06:14:41,042 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 06:14:41,042 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 06:14:41,042 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 06:14:41,042 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 06:14:41,042 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 06:14:41,042 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 06:14:41,042 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 06:14:41,042 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 06:14:41,043 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 06:14:41,043 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 06:14:41,043 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 06:14:41,043 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 06:14:41,043 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 06:14:41,043 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 06:14:41,043 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 06:14:41,043 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 06:14:41,043 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 06:14:41,043 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 06:14:41,043 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 06:14:41,043 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 06:14:41,043 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 06:14:41,043 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 06:14:41,044 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 06:14:41,044 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 06:14:41,044 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 06:14:41,044 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 06:14:41,044 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 06:14:41,044 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 06:14:41,044 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 06:14:41,044 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 06:14:41,044 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 06:14:41,044 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 06:14:41,044 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 06:14:41,044 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 06:14:41,044 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 06:14:41,044 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 06:14:41,045 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 06:14:41,045 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 06:14:41,059 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe7e5296bb [2018-04-12 06:14:41,061 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 06:14:41,062 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 06:14:41,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 06:14:41,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 06:14:41,066 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 06:14:41,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 06:14:41" (1/1) ... [2018-04-12 06:14:41,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e85043a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:14:41, skipping insertion in model container [2018-04-12 06:14:41,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 06:14:41" (1/1) ... [2018-04-12 06:14:41,079 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 06:14:41,101 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 06:14:41,219 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 06:14:41,253 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 06:14:41,258 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-12 06:14:41,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:14:41 WrapperNode [2018-04-12 06:14:41,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 06:14:41,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 06:14:41,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 06:14:41,285 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 06:14:41,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:14:41" (1/1) ... [2018-04-12 06:14:41,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:14:41" (1/1) ... [2018-04-12 06:14:41,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:14:41" (1/1) ... [2018-04-12 06:14:41,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:14:41" (1/1) ... [2018-04-12 06:14:41,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:14:41" (1/1) ... [2018-04-12 06:14:41,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:14:41" (1/1) ... [2018-04-12 06:14:41,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:14:41" (1/1) ... [2018-04-12 06:14:41,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 06:14:41,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 06:14:41,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 06:14:41,320 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 06:14:41,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:14:41" (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 06:14:41,420 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 06:14:41,420 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 06:14:41,420 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-12 06:14:41,420 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-12 06:14:41,420 INFO L136 BoogieDeclarations]: Found implementation of procedure substring [2018-04-12 06:14:41,420 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 06:14:41,421 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-12 06:14:41,421 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-12 06:14:41,421 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-12 06:14:41,421 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-12 06:14:41,421 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-12 06:14:41,421 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-12 06:14:41,421 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-12 06:14:41,421 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-12 06:14:41,421 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-12 06:14:41,421 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-12 06:14:41,421 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-12 06:14:41,421 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-12 06:14:41,422 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-12 06:14:41,422 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-12 06:14:41,422 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-12 06:14:41,422 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-12 06:14:41,422 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-12 06:14:41,422 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-12 06:14:41,422 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-12 06:14:41,422 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-12 06:14:41,422 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-12 06:14:41,422 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-12 06:14:41,422 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-12 06:14:41,422 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-12 06:14:41,422 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-12 06:14:41,422 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-12 06:14:41,422 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-12 06:14:41,423 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-12 06:14:41,423 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-12 06:14:41,423 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-12 06:14:41,423 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-12 06:14:41,423 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-12 06:14:41,423 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-12 06:14:41,423 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-12 06:14:41,423 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-12 06:14:41,423 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-12 06:14:41,423 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-12 06:14:41,424 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-12 06:14:41,424 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-12 06:14:41,424 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-12 06:14:41,424 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-12 06:14:41,424 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-12 06:14:41,424 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-12 06:14:41,424 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-12 06:14:41,424 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-12 06:14:41,424 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-12 06:14:41,425 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-12 06:14:41,425 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-12 06:14:41,425 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-12 06:14:41,425 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-12 06:14:41,425 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-12 06:14:41,425 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-12 06:14:41,425 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-12 06:14:41,425 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-12 06:14:41,425 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-12 06:14:41,425 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-12 06:14:41,426 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-12 06:14:41,426 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-12 06:14:41,426 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-12 06:14:41,426 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-12 06:14:41,426 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-12 06:14:41,426 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-12 06:14:41,426 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-12 06:14:41,426 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-12 06:14:41,426 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-12 06:14:41,426 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-12 06:14:41,427 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-12 06:14:41,427 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-12 06:14:41,427 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-12 06:14:41,427 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-12 06:14:41,427 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-12 06:14:41,427 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-12 06:14:41,427 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-12 06:14:41,427 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-12 06:14:41,427 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-12 06:14:41,427 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-12 06:14:41,428 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-12 06:14:41,428 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-12 06:14:41,428 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-12 06:14:41,428 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-12 06:14:41,428 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-12 06:14:41,428 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-12 06:14:41,428 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-12 06:14:41,428 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-12 06:14:41,428 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-12 06:14:41,428 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-12 06:14:41,428 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-12 06:14:41,429 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-12 06:14:41,429 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-12 06:14:41,429 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-12 06:14:41,429 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-12 06:14:41,429 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-12 06:14:41,429 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-12 06:14:41,429 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-12 06:14:41,429 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-12 06:14:41,429 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-12 06:14:41,429 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-12 06:14:41,430 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-12 06:14:41,430 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-12 06:14:41,430 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-12 06:14:41,430 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-12 06:14:41,430 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-12 06:14:41,430 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-12 06:14:41,430 INFO L128 BoogieDeclarations]: Found specification of procedure substring [2018-04-12 06:14:41,430 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-12 06:14:41,430 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 06:14:41,430 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-12 06:14:41,431 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-12 06:14:41,431 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-12 06:14:41,431 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 06:14:41,431 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 06:14:41,431 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-12 06:14:41,719 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 06:14:41,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 06:14:41 BoogieIcfgContainer [2018-04-12 06:14:41,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 06:14:41,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 06:14:41,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 06:14:41,722 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 06:14:41,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 06:14:41" (1/3) ... [2018-04-12 06:14:41,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36bb70d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 06:14:41, skipping insertion in model container [2018-04-12 06:14:41,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:14:41" (2/3) ... [2018-04-12 06:14:41,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36bb70d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 06:14:41, skipping insertion in model container [2018-04-12 06:14:41,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 06:14:41" (3/3) ... [2018-04-12 06:14:41,724 INFO L107 eAbstractionObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-04-12 06:14:41,729 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-12 06:14:41,734 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-04-12 06:14:41,760 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 06:14:41,760 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 06:14:41,760 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-12 06:14:41,760 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-12 06:14:41,761 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-12 06:14:41,761 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 06:14:41,761 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 06:14:41,761 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 06:14:41,761 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 06:14:41,761 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 06:14:41,770 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-04-12 06:14:41,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-12 06:14:41,777 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:14:41,777 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:14:41,777 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:14:41,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1359245197, now seen corresponding path program 1 times [2018-04-12 06:14:41,781 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:14:41,781 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:14:41,809 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:41,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:41,809 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:41,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:14:41,860 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:14:41,860 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:14:41,860 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:14:41,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:41,897 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:14:41,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:14:41,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:41,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:41,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-12 06:14:41,950 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:14:41,950 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:14:41,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 06:14:41,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:41,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:14:41,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-12 06:14:41,972 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 06:14:41,974 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:14:41,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 06:14:41,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 06:14:41,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 06:14:41,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-12 06:14:41,984 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 5 states. [2018-04-12 06:14:42,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:14:42,086 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-04-12 06:14:42,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 06:14:42,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-04-12 06:14:42,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:14:42,093 INFO L225 Difference]: With dead ends: 55 [2018-04-12 06:14:42,093 INFO L226 Difference]: Without dead ends: 52 [2018-04-12 06:14:42,095 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-12 06:14:42,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-12 06:14:42,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-04-12 06:14:42,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-12 06:14:42,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-04-12 06:14:42,123 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 13 [2018-04-12 06:14:42,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:14:42,123 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-04-12 06:14:42,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 06:14:42,124 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-04-12 06:14:42,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-12 06:14:42,124 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:14:42,124 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:14:42,124 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:14:42,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1359245198, now seen corresponding path program 1 times [2018-04-12 06:14:42,124 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:14:42,125 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:14:42,125 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:42,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:42,125 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:42,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:14:42,143 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:14:42,143 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:14:42,143 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:14:42,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:42,168 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:14:42,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:14:42,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:42,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:14:42,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:42,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:42,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-12 06:14:42,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:14:42,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-12 06:14:42,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:42,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:14:42,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:14:42,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 06:14:42,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:42,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:42,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-12 06:14:42,230 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 06:14:42,230 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:14:42,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 06:14:42,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 06:14:42,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 06:14:42,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-12 06:14:42,231 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 6 states. [2018-04-12 06:14:42,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:14:42,335 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-04-12 06:14:42,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 06:14:42,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-12 06:14:42,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:14:42,337 INFO L225 Difference]: With dead ends: 69 [2018-04-12 06:14:42,337 INFO L226 Difference]: Without dead ends: 69 [2018-04-12 06:14:42,338 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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 06:14:42,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-04-12 06:14:42,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2018-04-12 06:14:42,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-04-12 06:14:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-04-12 06:14:42,346 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 13 [2018-04-12 06:14:42,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:14:42,346 INFO L459 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-04-12 06:14:42,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 06:14:42,346 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-04-12 06:14:42,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-12 06:14:42,346 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:14:42,346 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:14:42,347 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:14:42,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1160714736, now seen corresponding path program 1 times [2018-04-12 06:14:42,347 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:14:42,347 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:14:42,347 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:42,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:42,348 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:42,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:14:42,362 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:14:42,362 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:14:42,362 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:14:42,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:42,383 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:14:42,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:14:42,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:42,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:14:42,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:42,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:42,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-12 06:14:42,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:14:42,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:14:42,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 06:14:42,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:42,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-12 06:14:42,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:42,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:42,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-12 06:14:42,449 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 06:14:42,449 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:14:42,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 06:14:42,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 06:14:42,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 06:14:42,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-12 06:14:42,450 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 6 states. [2018-04-12 06:14:42,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:14:42,511 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-04-12 06:14:42,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 06:14:42,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-12 06:14:42,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:14:42,512 INFO L225 Difference]: With dead ends: 57 [2018-04-12 06:14:42,512 INFO L226 Difference]: Without dead ends: 57 [2018-04-12 06:14:42,512 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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 06:14:42,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-12 06:14:42,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2018-04-12 06:14:42,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-12 06:14:42,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-04-12 06:14:42,514 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2018-04-12 06:14:42,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:14:42,515 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-04-12 06:14:42,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 06:14:42,515 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-04-12 06:14:42,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-12 06:14:42,515 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:14:42,515 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:14:42,516 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:14:42,516 INFO L82 PathProgramCache]: Analyzing trace with hash -813071859, now seen corresponding path program 1 times [2018-04-12 06:14:42,516 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:14:42,516 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:14:42,517 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:42,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:42,517 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:42,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:14:42,546 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 06:14:42,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:14:42,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 06:14:42,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 06:14:42,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 06:14:42,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 06:14:42,546 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 4 states. [2018-04-12 06:14:42,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:14:42,575 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-04-12 06:14:42,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 06:14:42,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-12 06:14:42,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:14:42,576 INFO L225 Difference]: With dead ends: 50 [2018-04-12 06:14:42,576 INFO L226 Difference]: Without dead ends: 50 [2018-04-12 06:14:42,576 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 06:14:42,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-12 06:14:42,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-04-12 06:14:42,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-12 06:14:42,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-04-12 06:14:42,578 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 14 [2018-04-12 06:14:42,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:14:42,578 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-04-12 06:14:42,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 06:14:42,578 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-04-12 06:14:42,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-12 06:14:42,579 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:14:42,579 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:14:42,579 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:14:42,579 INFO L82 PathProgramCache]: Analyzing trace with hash -813071858, now seen corresponding path program 1 times [2018-04-12 06:14:42,579 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:14:42,579 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:14:42,580 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:42,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:42,580 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:42,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:14:42,622 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 06:14:42,622 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:14:42,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 06:14:42,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 06:14:42,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 06:14:42,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 06:14:42,622 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 5 states. [2018-04-12 06:14:42,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:14:42,647 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-04-12 06:14:42,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 06:14:42,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-12 06:14:42,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:14:42,648 INFO L225 Difference]: With dead ends: 49 [2018-04-12 06:14:42,648 INFO L226 Difference]: Without dead ends: 49 [2018-04-12 06:14:42,648 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 06:14:42,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-12 06:14:42,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-04-12 06:14:42,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-12 06:14:42,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-04-12 06:14:42,651 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 14 [2018-04-12 06:14:42,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:14:42,652 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-04-12 06:14:42,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 06:14:42,652 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-04-12 06:14:42,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-12 06:14:42,652 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:14:42,652 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 06:14:42,652 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:14:42,653 INFO L82 PathProgramCache]: Analyzing trace with hash 198035442, now seen corresponding path program 1 times [2018-04-12 06:14:42,653 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:14:42,653 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:14:42,653 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:42,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:42,654 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:42,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:14:42,686 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 06:14:42,686 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:14:42,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 06:14:42,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 06:14:42,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 06:14:42,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 06:14:42,687 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2018-04-12 06:14:42,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:14:42,731 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-04-12 06:14:42,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 06:14:42,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-12 06:14:42,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:14:42,732 INFO L225 Difference]: With dead ends: 48 [2018-04-12 06:14:42,732 INFO L226 Difference]: Without dead ends: 48 [2018-04-12 06:14:42,732 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 06:14:42,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-12 06:14:42,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-04-12 06:14:42,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-04-12 06:14:42,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-04-12 06:14:42,735 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 18 [2018-04-12 06:14:42,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:14:42,735 INFO L459 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-04-12 06:14:42,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 06:14:42,736 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-04-12 06:14:42,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-12 06:14:42,736 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:14:42,736 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 06:14:42,736 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:14:42,736 INFO L82 PathProgramCache]: Analyzing trace with hash 198035443, now seen corresponding path program 1 times [2018-04-12 06:14:42,736 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:14:42,736 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:14:42,737 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:42,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:42,737 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:42,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:14:42,810 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 06:14:42,810 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:14:42,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 06:14:42,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 06:14:42,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 06:14:42,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-12 06:14:42,811 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 8 states. [2018-04-12 06:14:42,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:14:42,890 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-04-12 06:14:42,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 06:14:42,890 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-04-12 06:14:42,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:14:42,892 INFO L225 Difference]: With dead ends: 72 [2018-04-12 06:14:42,892 INFO L226 Difference]: Without dead ends: 72 [2018-04-12 06:14:42,892 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 06:14:42,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-12 06:14:42,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2018-04-12 06:14:42,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-12 06:14:42,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-04-12 06:14:42,894 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 18 [2018-04-12 06:14:42,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:14:42,894 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-04-12 06:14:42,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 06:14:42,895 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-04-12 06:14:42,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-12 06:14:42,895 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:14:42,895 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 06:14:42,895 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:14:42,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1611194078, now seen corresponding path program 1 times [2018-04-12 06:14:42,896 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:14:42,896 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:14:42,896 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:42,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:42,896 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:42,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:14:42,926 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 06:14:42,927 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:14:42,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 06:14:42,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 06:14:42,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 06:14:42,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 06:14:42,928 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 6 states. [2018-04-12 06:14:43,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:14:43,021 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-04-12 06:14:43,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 06:14:43,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-04-12 06:14:43,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:14:43,022 INFO L225 Difference]: With dead ends: 51 [2018-04-12 06:14:43,022 INFO L226 Difference]: Without dead ends: 51 [2018-04-12 06:14:43,022 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 06:14:43,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-12 06:14:43,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-04-12 06:14:43,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-12 06:14:43,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-04-12 06:14:43,025 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 21 [2018-04-12 06:14:43,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:14:43,025 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-04-12 06:14:43,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 06:14:43,025 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-04-12 06:14:43,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-12 06:14:43,026 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:14:43,026 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 06:14:43,026 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:14:43,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1611194077, now seen corresponding path program 1 times [2018-04-12 06:14:43,026 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:14:43,026 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:14:43,027 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:43,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:43,027 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:43,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:14:43,098 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 06:14:43,099 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:14:43,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-12 06:14:43,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 06:14:43,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 06:14:43,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-12 06:14:43,100 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 9 states. [2018-04-12 06:14:43,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:14:43,186 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-04-12 06:14:43,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 06:14:43,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-04-12 06:14:43,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:14:43,187 INFO L225 Difference]: With dead ends: 66 [2018-04-12 06:14:43,187 INFO L226 Difference]: Without dead ends: 66 [2018-04-12 06:14:43,187 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 06:14:43,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-12 06:14:43,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-04-12 06:14:43,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-12 06:14:43,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2018-04-12 06:14:43,189 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 21 [2018-04-12 06:14:43,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:14:43,191 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2018-04-12 06:14:43,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 06:14:43,191 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-04-12 06:14:43,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-12 06:14:43,192 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:14:43,192 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 06:14:43,192 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:14:43,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1620411736, now seen corresponding path program 1 times [2018-04-12 06:14:43,192 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:14:43,192 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:14:43,192 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:43,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:43,193 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:43,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:14:43,222 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 06:14:43,223 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:14:43,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 06:14:43,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 06:14:43,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 06:14:43,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 06:14:43,227 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 6 states. [2018-04-12 06:14:43,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:14:43,272 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-04-12 06:14:43,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 06:14:43,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-04-12 06:14:43,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:14:43,273 INFO L225 Difference]: With dead ends: 59 [2018-04-12 06:14:43,273 INFO L226 Difference]: Without dead ends: 59 [2018-04-12 06:14:43,273 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 06:14:43,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-12 06:14:43,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-04-12 06:14:43,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-12 06:14:43,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-04-12 06:14:43,277 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 25 [2018-04-12 06:14:43,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:14:43,277 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-04-12 06:14:43,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 06:14:43,277 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-04-12 06:14:43,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-12 06:14:43,277 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:14:43,278 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 06:14:43,278 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:14:43,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1620411735, now seen corresponding path program 1 times [2018-04-12 06:14:43,278 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:14:43,278 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:14:43,279 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:43,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:43,279 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:43,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:14:43,334 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 06:14:43,334 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:14:43,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 06:14:43,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 06:14:43,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 06:14:43,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-12 06:14:43,335 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 8 states. [2018-04-12 06:14:43,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:14:43,427 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2018-04-12 06:14:43,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 06:14:43,427 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-04-12 06:14:43,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:14:43,428 INFO L225 Difference]: With dead ends: 92 [2018-04-12 06:14:43,428 INFO L226 Difference]: Without dead ends: 92 [2018-04-12 06:14:43,428 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 06:14:43,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-04-12 06:14:43,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2018-04-12 06:14:43,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-04-12 06:14:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-04-12 06:14:43,432 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 25 [2018-04-12 06:14:43,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:14:43,432 INFO L459 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-04-12 06:14:43,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 06:14:43,432 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-04-12 06:14:43,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-12 06:14:43,433 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:14:43,433 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 06:14:43,433 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:14:43,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1307124962, now seen corresponding path program 1 times [2018-04-12 06:14:43,433 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:14:43,433 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:14:43,434 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:43,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:43,434 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:43,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:14:43,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 06:14:43,456 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:14:43,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 06:14:43,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 06:14:43,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 06:14:43,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 06:14:43,457 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 3 states. [2018-04-12 06:14:43,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:14:43,461 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-04-12 06:14:43,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 06:14:43,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-04-12 06:14:43,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:14:43,461 INFO L225 Difference]: With dead ends: 64 [2018-04-12 06:14:43,461 INFO L226 Difference]: Without dead ends: 64 [2018-04-12 06:14:43,462 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 06:14:43,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-04-12 06:14:43,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-04-12 06:14:43,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-12 06:14:43,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2018-04-12 06:14:43,464 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 26 [2018-04-12 06:14:43,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:14:43,464 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-04-12 06:14:43,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 06:14:43,464 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2018-04-12 06:14:43,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 06:14:43,464 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:14:43,464 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 06:14:43,465 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:14:43,465 INFO L82 PathProgramCache]: Analyzing trace with hash 2015624486, now seen corresponding path program 1 times [2018-04-12 06:14:43,465 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:14:43,465 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:14:43,465 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:43,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:43,465 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:43,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:14:43,498 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 06:14:43,498 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:14:43,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 06:14:43,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 06:14:43,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 06:14:43,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-12 06:14:43,499 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 6 states. [2018-04-12 06:14:43,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:14:43,559 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-04-12 06:14:43,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 06:14:43,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-04-12 06:14:43,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:14:43,560 INFO L225 Difference]: With dead ends: 70 [2018-04-12 06:14:43,560 INFO L226 Difference]: Without dead ends: 70 [2018-04-12 06:14:43,560 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 06:14:43,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-04-12 06:14:43,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-04-12 06:14:43,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-12 06:14:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-04-12 06:14:43,563 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 28 [2018-04-12 06:14:43,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:14:43,563 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-04-12 06:14:43,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 06:14:43,563 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-04-12 06:14:43,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 06:14:43,564 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:14:43,564 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 06:14:43,564 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:14:43,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1801524697, now seen corresponding path program 1 times [2018-04-12 06:14:43,564 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:14:43,564 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:14:43,565 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:43,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:43,565 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:43,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:14:43,576 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:14:43,576 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:14:43,576 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:14:43,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:43,592 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:14:43,639 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:14:43,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-12 06:14:43,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:14:43,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 06:14:43,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:43,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:43,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:14:43,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-12 06:14:43,679 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |c_main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0))))) is different from true [2018-04-12 06:14:43,683 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc14.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0))))) is different from true [2018-04-12 06:14:43,686 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 06:14:43,686 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:14:43,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 06:14:43,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 06:14:43,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 06:14:43,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-12 06:14:43,686 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 8 states. [2018-04-12 06:14:43,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:14:43,751 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-04-12 06:14:43,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 06:14:43,751 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-04-12 06:14:43,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:14:43,752 INFO L225 Difference]: With dead ends: 66 [2018-04-12 06:14:43,752 INFO L226 Difference]: Without dead ends: 54 [2018-04-12 06:14:43,752 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=30, Unknown=2, NotChecked=22, Total=72 [2018-04-12 06:14:43,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-12 06:14:43,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-12 06:14:43,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-12 06:14:43,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-04-12 06:14:43,753 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 28 [2018-04-12 06:14:43,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:14:43,753 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-04-12 06:14:43,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 06:14:43,753 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-04-12 06:14:43,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-12 06:14:43,753 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:14:43,754 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 06:14:43,754 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:14:43,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1695652845, now seen corresponding path program 1 times [2018-04-12 06:14:43,754 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:14:43,754 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:14:43,754 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:43,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:43,754 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:43,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:14:43,764 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:14:43,764 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:14:43,764 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:14:43,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:43,794 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:14:43,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:14:43,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:43,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:43,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-12 06:14:43,820 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:14:43,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:14:43,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 06:14:43,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:43,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:43,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-12 06:14:43,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-12 06:14:43,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-12 06:14:43,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:43,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:43,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:14:43,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-12 06:14:43,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-12 06:14:43,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-12 06:14:43,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:43,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:43,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-12 06:14:43,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:36 [2018-04-12 06:14:43,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-12 06:14:43,987 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:14:43,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-12 06:14:43,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-12 06:14:43,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-12 06:14:43,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-04-12 06:14:43,988 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 12 states. [2018-04-12 06:14:44,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:14:44,173 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-04-12 06:14:44,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 06:14:44,173 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-04-12 06:14:44,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:14:44,173 INFO L225 Difference]: With dead ends: 66 [2018-04-12 06:14:44,173 INFO L226 Difference]: Without dead ends: 54 [2018-04-12 06:14:44,174 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-04-12 06:14:44,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-12 06:14:44,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-12 06:14:44,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-12 06:14:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-04-12 06:14:44,175 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 29 [2018-04-12 06:14:44,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:14:44,176 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-04-12 06:14:44,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-12 06:14:44,176 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-04-12 06:14:44,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-12 06:14:44,176 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:14:44,177 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 06:14:44,177 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:14:44,177 INFO L82 PathProgramCache]: Analyzing trace with hash 793876117, now seen corresponding path program 1 times [2018-04-12 06:14:44,177 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:14:44,177 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:14:44,178 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:44,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:44,178 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:44,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:14:44,288 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 06:14:44,288 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:14:44,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-12 06:14:44,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 06:14:44,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 06:14:44,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-04-12 06:14:44,289 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 11 states. [2018-04-12 06:14:44,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:14:44,432 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-04-12 06:14:44,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 06:14:44,432 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-04-12 06:14:44,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:14:44,433 INFO L225 Difference]: With dead ends: 69 [2018-04-12 06:14:44,433 INFO L226 Difference]: Without dead ends: 54 [2018-04-12 06:14:44,433 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 06:14:44,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-12 06:14:44,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-12 06:14:44,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-12 06:14:44,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-04-12 06:14:44,435 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 29 [2018-04-12 06:14:44,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:14:44,435 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-04-12 06:14:44,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 06:14:44,435 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-04-12 06:14:44,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-12 06:14:44,435 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:14:44,435 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 06:14:44,435 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:14:44,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1012730835, now seen corresponding path program 1 times [2018-04-12 06:14:44,435 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:14:44,436 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:14:44,436 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:44,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:44,436 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:44,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:14:44,572 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 06:14:44,572 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:14:44,572 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:14:44,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:44,591 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:14:44,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:14:44,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:44,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:44,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 06:14:44,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-12 06:14:44,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-12 06:14:44,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:44,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:44,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:44,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-12 06:14:44,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-12 06:14:44,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-12 06:14:44,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 06:14:44,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:14:44,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:14:44,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:54 [2018-04-12 06:14:44,848 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 06:14:44,849 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 06:14:44,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-04-12 06:14:44,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 06:14:44,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 06:14:44,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-04-12 06:14:44,849 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 22 states. [2018-04-12 06:14:45,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:14:45,352 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-04-12 06:14:45,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-12 06:14:45,352 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2018-04-12 06:14:45,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:14:45,352 INFO L225 Difference]: With dead ends: 77 [2018-04-12 06:14:45,352 INFO L226 Difference]: Without dead ends: 75 [2018-04-12 06:14:45,353 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2018-04-12 06:14:45,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-12 06:14:45,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 62. [2018-04-12 06:14:45,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-04-12 06:14:45,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-04-12 06:14:45,354 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 29 [2018-04-12 06:14:45,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:14:45,355 INFO L459 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-04-12 06:14:45,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 06:14:45,355 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-04-12 06:14:45,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-12 06:14:45,355 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:14:45,356 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 06:14:45,356 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:14:45,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1724257321, now seen corresponding path program 1 times [2018-04-12 06:14:45,356 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:14:45,356 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:14:45,356 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:45,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:45,357 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:45,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:14:45,370 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:14:45,370 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:14:45,370 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:14:45,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:45,395 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:14:45,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:14:45,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:45,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:14:45,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:45,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:45,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-12 06:14:45,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:14:45,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-12 06:14:45,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:45,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:14:45,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:14:45,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 06:14:45,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:45,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:45,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-12 06:14:45,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-12 06:14:45,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-12 06:14:45,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:45,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:45,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:45,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-12 06:14:45,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-12 06:14:45,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-12 06:14:45,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:45,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:45,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:14:45,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:39 [2018-04-12 06:14:45,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-04-12 06:14:45,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-12 06:14:45,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 06:14:45,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-12 06:14:45,584 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:45,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:14:45,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:14:45,596 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:54 [2018-04-12 06:14:45,652 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 06:14:45,652 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:14:45,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-12 06:14:45,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-12 06:14:45,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-12 06:14:45,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-04-12 06:14:45,653 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 13 states. [2018-04-12 06:14:47,005 WARN L151 SmtUtils]: Spent 1216ms on a formula simplification. DAG size of input: 47 DAG size of output 43 [2018-04-12 06:14:47,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:14:47,458 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2018-04-12 06:14:47,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-12 06:14:47,458 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-04-12 06:14:47,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:14:47,459 INFO L225 Difference]: With dead ends: 125 [2018-04-12 06:14:47,459 INFO L226 Difference]: Without dead ends: 125 [2018-04-12 06:14:47,459 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-04-12 06:14:47,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-12 06:14:47,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2018-04-12 06:14:47,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-12 06:14:47,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2018-04-12 06:14:47,462 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 31 [2018-04-12 06:14:47,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:14:47,462 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2018-04-12 06:14:47,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-12 06:14:47,462 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2018-04-12 06:14:47,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-12 06:14:47,463 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:14:47,463 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 06:14:47,463 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:14:47,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1820036441, now seen corresponding path program 1 times [2018-04-12 06:14:47,463 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:14:47,464 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:14:47,464 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:47,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:47,464 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:47,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:14:47,479 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:14:47,480 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:14:47,480 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:14:47,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:47,508 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:14:47,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:14:47,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:47,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:47,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-04-12 06:14:47,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-12 06:14:47,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-12 06:14:47,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:47,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:47,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:14:47,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-04-12 06:14:47,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 39 [2018-04-12 06:14:47,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-12 06:14:47,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:47,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:47,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:14:47,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:49 [2018-04-12 06:14:47,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 42 [2018-04-12 06:14:47,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 51 [2018-04-12 06:14:47,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-12 06:14:47,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 36 [2018-04-12 06:14:47,974 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 06:14:48,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-04-12 06:14:48,013 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:48,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-04-12 06:14:48,019 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:48,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-12 06:14:48,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-12 06:14:48,084 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:72, output treesize:387 [2018-04-12 06:14:48,223 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 53 DAG size of output 42 [2018-04-12 06:14:48,408 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 06:14:48,408 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:14:48,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-12 06:14:48,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-12 06:14:48,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-12 06:14:48,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-04-12 06:14:48,409 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand 20 states. [2018-04-12 06:14:48,861 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 81 DAG size of output 81 [2018-04-12 06:14:49,239 WARN L151 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 112 DAG size of output 103 [2018-04-12 06:14:49,590 WARN L151 SmtUtils]: Spent 325ms on a formula simplification. DAG size of input: 116 DAG size of output 111 [2018-04-12 06:14:49,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:14:49,873 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2018-04-12 06:14:49,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-12 06:14:49,873 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2018-04-12 06:14:49,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:14:49,873 INFO L225 Difference]: With dead ends: 100 [2018-04-12 06:14:49,873 INFO L226 Difference]: Without dead ends: 100 [2018-04-12 06:14:49,874 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=215, Invalid=1117, Unknown=0, NotChecked=0, Total=1332 [2018-04-12 06:14:49,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-12 06:14:49,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2018-04-12 06:14:49,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-12 06:14:49,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2018-04-12 06:14:49,876 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 33 [2018-04-12 06:14:49,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:14:49,876 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2018-04-12 06:14:49,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-12 06:14:49,876 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2018-04-12 06:14:49,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-12 06:14:49,876 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:14:49,876 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 06:14:49,876 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:14:49,877 INFO L82 PathProgramCache]: Analyzing trace with hash 2127994563, now seen corresponding path program 2 times [2018-04-12 06:14:49,877 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:14:49,877 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:14:49,877 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:49,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:49,877 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:49,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:14:50,086 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 06:14:50,087 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:14:50,087 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:14:50,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 06:14:50,113 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 06:14:50,113 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 06:14:50,116 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:14:50,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:14:50,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:50,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:50,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-12 06:14:50,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-12 06:14:50,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-12 06:14:50,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:50,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:50,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:50,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-12 06:14:50,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-04-12 06:14:50,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-04-12 06:14:50,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:50,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-04-12 06:14:50,384 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:50,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2018-04-12 06:14:50,412 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-04-12 06:14:50,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-12 06:14:50,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-12 06:14:50,461 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:85 [2018-04-12 06:14:50,533 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 06:14:50,534 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 06:14:50,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 28 [2018-04-12 06:14:50,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-12 06:14:50,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-12 06:14:50,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2018-04-12 06:14:50,534 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand 29 states. [2018-04-12 06:14:51,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:14:51,162 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2018-04-12 06:14:51,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-12 06:14:51,162 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2018-04-12 06:14:51,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:14:51,163 INFO L225 Difference]: With dead ends: 134 [2018-04-12 06:14:51,163 INFO L226 Difference]: Without dead ends: 132 [2018-04-12 06:14:51,163 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=268, Invalid=1454, Unknown=0, NotChecked=0, Total=1722 [2018-04-12 06:14:51,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-12 06:14:51,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 101. [2018-04-12 06:14:51,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-12 06:14:51,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 119 transitions. [2018-04-12 06:14:51,165 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 119 transitions. Word has length 37 [2018-04-12 06:14:51,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:14:51,165 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 119 transitions. [2018-04-12 06:14:51,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-12 06:14:51,166 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 119 transitions. [2018-04-12 06:14:51,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-12 06:14:51,166 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:14:51,166 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 06:14:51,166 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:14:51,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1372787131, now seen corresponding path program 1 times [2018-04-12 06:14:51,166 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:14:51,166 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:14:51,167 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:51,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 06:14:51,167 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:51,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:14:51,207 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 06:14:51,208 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:14:51,208 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:14:51,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:51,223 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:14:51,291 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 06:14:51,292 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 06:14:51,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-04-12 06:14:51,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-12 06:14:51,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-12 06:14:51,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-04-12 06:14:51,292 INFO L87 Difference]: Start difference. First operand 101 states and 119 transitions. Second operand 16 states. [2018-04-12 06:14:51,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:14:51,471 INFO L93 Difference]: Finished difference Result 161 states and 181 transitions. [2018-04-12 06:14:51,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 06:14:51,471 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2018-04-12 06:14:51,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:14:51,472 INFO L225 Difference]: With dead ends: 161 [2018-04-12 06:14:51,472 INFO L226 Difference]: Without dead ends: 161 [2018-04-12 06:14:51,472 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2018-04-12 06:14:51,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-12 06:14:51,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 101. [2018-04-12 06:14:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-12 06:14:51,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 118 transitions. [2018-04-12 06:14:51,474 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 118 transitions. Word has length 38 [2018-04-12 06:14:51,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:14:51,474 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 118 transitions. [2018-04-12 06:14:51,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-12 06:14:51,474 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 118 transitions. [2018-04-12 06:14:51,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-12 06:14:51,475 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:14:51,475 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 06:14:51,475 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:14:51,475 INFO L82 PathProgramCache]: Analyzing trace with hash -518903735, now seen corresponding path program 2 times [2018-04-12 06:14:51,475 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:14:51,475 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:14:51,476 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:51,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:14:51,476 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:51,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:14:51,484 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:14:51,484 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:14:51,484 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:14:51,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 06:14:51,503 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 06:14:51,503 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 06:14:51,505 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:14:51,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:14:51,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:51,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:14:51,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:51,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:51,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-12 06:14:51,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:14:51,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-12 06:14:51,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:51,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:14:51,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:14:51,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 06:14:51,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:51,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:51,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-12 06:14:51,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-12 06:14:51,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-12 06:14:51,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:51,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:51,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:51,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-12 06:14:51,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-12 06:14:51,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-12 06:14:51,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:51,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:14:51,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:14:51,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-04-12 06:14:53,900 WARN L148 SmtUtils]: Spent 2026ms on a formula simplification that was a NOOP. DAG size: 36 [2018-04-12 06:14:53,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2018-04-12 06:14:53,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:14:53,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 29 [2018-04-12 06:14:53,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 06:14:53,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-04-12 06:14:53,969 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:14:53,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:14:53,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:14:53,991 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:69, output treesize:54 [2018-04-12 06:14:54,069 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 06:14:54,069 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:14:54,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-12 06:14:54,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-12 06:14:54,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-12 06:14:54,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2018-04-12 06:14:54,070 INFO L87 Difference]: Start difference. First operand 101 states and 118 transitions. Second operand 20 states. [2018-04-12 06:14:58,656 WARN L151 SmtUtils]: Spent 4117ms on a formula simplification. DAG size of input: 75 DAG size of output 75 [2018-04-12 06:14:59,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:14:59,973 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2018-04-12 06:14:59,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-12 06:14:59,974 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2018-04-12 06:14:59,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:14:59,975 INFO L225 Difference]: With dead ends: 117 [2018-04-12 06:14:59,975 INFO L226 Difference]: Without dead ends: 117 [2018-04-12 06:14:59,975 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2018-04-12 06:14:59,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-04-12 06:14:59,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 101. [2018-04-12 06:14:59,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-12 06:14:59,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2018-04-12 06:14:59,977 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 41 [2018-04-12 06:14:59,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:14:59,977 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2018-04-12 06:14:59,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-12 06:14:59,977 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2018-04-12 06:14:59,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-12 06:14:59,978 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:14:59,978 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 06:14:59,978 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:14:59,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1224572237, now seen corresponding path program 2 times [2018-04-12 06:14:59,978 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:14:59,978 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:14:59,978 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:59,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 06:14:59,979 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:14:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:14:59,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:14:59,989 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:14:59,989 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:14:59,989 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:14:59,990 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 06:15:00,006 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 06:15:00,006 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 06:15:00,009 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:15:00,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:15:00,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:00,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:15:00,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:00,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:15:00,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-12 06:15:00,033 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:15:00,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-12 06:15:00,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:00,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:15:00,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:15:00,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 06:15:00,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:00,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:15:00,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-12 06:15:00,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-12 06:15:00,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-12 06:15:00,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:00,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:15:00,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:15:00,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-12 06:15:00,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-12 06:15:00,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-12 06:15:00,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:00,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:15:00,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:15:00,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-04-12 06:15:00,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-04-12 06:15:00,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-12 06:15:00,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:00,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-12 06:15:00,248 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 06:15:00,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:15:00,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:15:00,261 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:48 [2018-04-12 06:15:00,338 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 06:15:00,339 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:15:00,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-12 06:15:00,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-12 06:15:00,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-12 06:15:00,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-04-12 06:15:00,339 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand 15 states. [2018-04-12 06:15:00,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:15:00,898 INFO L93 Difference]: Finished difference Result 193 states and 219 transitions. [2018-04-12 06:15:00,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 06:15:00,898 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-04-12 06:15:00,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:15:00,899 INFO L225 Difference]: With dead ends: 193 [2018-04-12 06:15:00,899 INFO L226 Difference]: Without dead ends: 193 [2018-04-12 06:15:00,899 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-04-12 06:15:00,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-12 06:15:00,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 139. [2018-04-12 06:15:00,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-04-12 06:15:00,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 166 transitions. [2018-04-12 06:15:00,902 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 166 transitions. Word has length 44 [2018-04-12 06:15:00,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:15:00,903 INFO L459 AbstractCegarLoop]: Abstraction has 139 states and 166 transitions. [2018-04-12 06:15:00,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-12 06:15:00,903 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 166 transitions. [2018-04-12 06:15:00,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-12 06:15:00,903 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:15:00,903 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 06:15:00,904 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:15:00,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1069957555, now seen corresponding path program 3 times [2018-04-12 06:15:00,904 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:15:00,904 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:15:00,904 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:15:00,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 06:15:00,905 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:15:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:15:00,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:15:01,048 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 06:15:01,049 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:15:01,049 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:15:01,049 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-12 06:15:01,082 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-12 06:15:01,083 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 06:15:01,085 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:15:01,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:15:01,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:01,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:15:01,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 06:15:01,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-12 06:15:01,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 06:15:01,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:01,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:15:01,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:15:01,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-12 06:15:01,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-12 06:15:01,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-12 06:15:01,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 06:15:01,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:15:01,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:15:01,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-04-12 06:15:01,236 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-12 06:15:01,236 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 06:15:01,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 15 [2018-04-12 06:15:01,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-12 06:15:01,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-12 06:15:01,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-04-12 06:15:01,237 INFO L87 Difference]: Start difference. First operand 139 states and 166 transitions. Second operand 16 states. [2018-04-12 06:15:01,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:15:01,795 INFO L93 Difference]: Finished difference Result 151 states and 171 transitions. [2018-04-12 06:15:01,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 06:15:01,795 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2018-04-12 06:15:01,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:15:01,796 INFO L225 Difference]: With dead ends: 151 [2018-04-12 06:15:01,796 INFO L226 Difference]: Without dead ends: 149 [2018-04-12 06:15:01,796 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2018-04-12 06:15:01,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-04-12 06:15:01,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 93. [2018-04-12 06:15:01,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-04-12 06:15:01,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2018-04-12 06:15:01,799 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 45 [2018-04-12 06:15:01,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:15:01,799 INFO L459 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2018-04-12 06:15:01,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-12 06:15:01,800 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-04-12 06:15:01,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-12 06:15:01,800 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:15:01,800 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 06:15:01,800 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:15:01,801 INFO L82 PathProgramCache]: Analyzing trace with hash 981065013, now seen corresponding path program 1 times [2018-04-12 06:15:01,801 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:15:01,801 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:15:01,801 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:15:01,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 06:15:01,801 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:15:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:15:01,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:15:01,841 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:15:01,841 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:15:01,841 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:15:01,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:15:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:15:01,870 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:15:01,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:15:01,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:01,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:15:01,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:01,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:15:01,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-12 06:15:01,950 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:15:01,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:15:01,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 06:15:01,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:01,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-12 06:15:01,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:01,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:15:01,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-12 06:15:01,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-12 06:15:02,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-12 06:15:02,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:02,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:15:02,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:15:02,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-12 06:15:02,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-12 06:15:02,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-12 06:15:02,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:02,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:15:02,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:15:02,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-04-12 06:15:02,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-04-12 06:15:02,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-04-12 06:15:02,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:02,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-12 06:15:02,247 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 06:15:02,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:15:02,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:15:02,278 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:66, output treesize:64 [2018-04-12 06:15:02,360 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 06:15:02,361 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:15:02,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-12 06:15:02,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-12 06:15:02,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-12 06:15:02,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-04-12 06:15:02,361 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 18 states. [2018-04-12 06:15:03,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:15:03,174 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2018-04-12 06:15:03,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-12 06:15:03,174 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-04-12 06:15:03,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:15:03,174 INFO L225 Difference]: With dead ends: 115 [2018-04-12 06:15:03,175 INFO L226 Difference]: Without dead ends: 115 [2018-04-12 06:15:03,175 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122 [2018-04-12 06:15:03,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-04-12 06:15:03,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2018-04-12 06:15:03,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-12 06:15:03,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2018-04-12 06:15:03,177 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 46 [2018-04-12 06:15:03,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:15:03,177 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2018-04-12 06:15:03,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-12 06:15:03,177 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2018-04-12 06:15:03,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-12 06:15:03,177 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:15:03,177 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 06:15:03,178 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:15:03,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1969827015, now seen corresponding path program 3 times [2018-04-12 06:15:03,178 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:15:03,178 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:15:03,178 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:15:03,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:15:03,179 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:15:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:15:03,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:15:03,205 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:15:03,206 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:15:03,206 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:15:03,206 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-12 06:15:03,242 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-12 06:15:03,242 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 06:15:03,246 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:15:03,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:15:03,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:03,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:15:03,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:03,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:15:03,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-12 06:15:03,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:15:03,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-12 06:15:03,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:03,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:15:03,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:15:03,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 06:15:03,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:03,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:15:03,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-12 06:15:03,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-12 06:15:03,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 06:15:03,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:03,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:15:03,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:15:03,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-12 06:15:03,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-12 06:15:03,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-12 06:15:03,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:03,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:15:03,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:15:03,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-04-12 06:15:05,530 WARN L148 SmtUtils]: Spent 2019ms on a formula simplification that was a NOOP. DAG size: 32 [2018-04-12 06:15:05,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2018-04-12 06:15:05,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2018-04-12 06:15:05,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:05,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 47 [2018-04-12 06:15:05,668 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-12 06:15:05,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2018-04-12 06:15:05,715 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:05,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2018-04-12 06:15:05,717 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:05,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2018-04-12 06:15:05,718 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:05,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-04-12 06:15:05,764 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:05,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-04-12 06:15:05,805 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:05,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2018-04-12 06:15:05,844 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-12 06:15:05,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2018-04-12 06:15:05,904 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-12 06:15:05,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-12 06:15:06,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-12 06:15:06,027 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:60, output treesize:86 [2018-04-12 06:15:06,109 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-12 06:15:06,109 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:15:06,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-12 06:15:06,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-12 06:15:06,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-12 06:15:06,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-04-12 06:15:06,110 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 19 states. [2018-04-12 06:15:06,497 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 72 DAG size of output 62 [2018-04-12 06:15:06,625 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 72 DAG size of output 59 [2018-04-12 06:15:11,434 WARN L151 SmtUtils]: Spent 4109ms on a formula simplification. DAG size of input: 78 DAG size of output 78 [2018-04-12 06:15:12,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:15:12,025 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-04-12 06:15:12,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-12 06:15:12,025 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-04-12 06:15:12,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:15:12,026 INFO L225 Difference]: With dead ends: 117 [2018-04-12 06:15:12,026 INFO L226 Difference]: Without dead ends: 117 [2018-04-12 06:15:12,026 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=320, Invalid=1320, Unknown=0, NotChecked=0, Total=1640 [2018-04-12 06:15:12,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-04-12 06:15:12,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 58. [2018-04-12 06:15:12,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-04-12 06:15:12,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-04-12 06:15:12,028 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 49 [2018-04-12 06:15:12,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:15:12,028 INFO L459 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-04-12 06:15:12,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-12 06:15:12,029 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-04-12 06:15:12,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-12 06:15:12,029 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:15:12,029 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 06:15:12,029 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-12 06:15:12,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1291252055, now seen corresponding path program 3 times [2018-04-12 06:15:12,029 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:15:12,029 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:15:12,030 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:15:12,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 06:15:12,030 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:15:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:15:12,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:15:12,049 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:15:12,049 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:15:12,049 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:15:12,049 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-12 06:15:12,070 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-12 06:15:12,070 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 06:15:12,073 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:15:12,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:15:12,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:12,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:15:12,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:12,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:15:12,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-12 06:15:12,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:15:12,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-12 06:15:12,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:12,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:15:12,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:15:12,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 06:15:12,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:12,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:15:12,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-12 06:15:12,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-12 06:15:12,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 06:15:12,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:12,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:15:12,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:15:12,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-12 06:15:12,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-12 06:15:12,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-12 06:15:12,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:12,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:15:12,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:15:12,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-04-12 06:15:12,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-04-12 06:15:12,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-12 06:15:12,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 06:15:12,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-12 06:15:12,219 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:15:12,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:15:12,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:15:12,231 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-04-12 06:15:12,298 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 06:15:12,299 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:15:12,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-12 06:15:12,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-12 06:15:12,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-12 06:15:12,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-04-12 06:15:12,300 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 13 states. [2018-04-12 06:15:14,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:15:14,354 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-04-12 06:15:14,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 06:15:14,355 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-04-12 06:15:14,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:15:14,355 INFO L225 Difference]: With dead ends: 57 [2018-04-12 06:15:14,355 INFO L226 Difference]: Without dead ends: 0 [2018-04-12 06:15:14,355 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2018-04-12 06:15:14,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-12 06:15:14,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-12 06:15:14,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-12 06:15:14,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-12 06:15:14,355 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2018-04-12 06:15:14,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:15:14,356 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-12 06:15:14,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-12 06:15:14,356 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-12 06:15:14,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-12 06:15:14,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.04 06:15:14 BoogieIcfgContainer [2018-04-12 06:15:14,358 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-12 06:15:14,359 INFO L168 Benchmark]: Toolchain (without parser) took 33297.16 ms. Allocated memory was 487.6 MB in the beginning and 926.9 MB in the end (delta: 439.4 MB). Free memory was 421.8 MB in the beginning and 379.8 MB in the end (delta: 42.0 MB). Peak memory consumption was 481.3 MB. Max. memory is 5.3 GB. [2018-04-12 06:15:14,360 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 487.6 MB. Free memory is still 450.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 06:15:14,360 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.32 ms. Allocated memory is still 487.6 MB. Free memory was 421.8 MB in the beginning and 398.0 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-12 06:15:14,360 INFO L168 Benchmark]: Boogie Preprocessor took 34.74 ms. Allocated memory is still 487.6 MB. Free memory was 398.0 MB in the beginning and 395.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-12 06:15:14,360 INFO L168 Benchmark]: RCFGBuilder took 399.41 ms. Allocated memory was 487.6 MB in the beginning and 626.0 MB in the end (delta: 138.4 MB). Free memory was 395.3 MB in the beginning and 552.6 MB in the end (delta: -157.2 MB). Peak memory consumption was 36.1 MB. Max. memory is 5.3 GB. [2018-04-12 06:15:14,360 INFO L168 Benchmark]: TraceAbstraction took 32638.36 ms. Allocated memory was 626.0 MB in the beginning and 926.9 MB in the end (delta: 300.9 MB). Free memory was 552.6 MB in the beginning and 379.8 MB in the end (delta: 172.8 MB). Peak memory consumption was 473.7 MB. Max. memory is 5.3 GB. [2018-04-12 06:15:14,361 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.13 ms. Allocated memory is still 487.6 MB. Free memory is still 450.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 222.32 ms. Allocated memory is still 487.6 MB. Free memory was 421.8 MB in the beginning and 398.0 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.74 ms. Allocated memory is still 487.6 MB. Free memory was 398.0 MB in the beginning and 395.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 399.41 ms. Allocated memory was 487.6 MB in the beginning and 626.0 MB in the end (delta: 138.4 MB). Free memory was 395.3 MB in the beginning and 552.6 MB in the end (delta: -157.2 MB). Peak memory consumption was 36.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 32638.36 ms. Allocated memory was 626.0 MB in the beginning and 926.9 MB in the end (delta: 300.9 MB). Free memory was 552.6 MB in the beginning and 379.8 MB in the end (delta: 172.8 MB). Peak memory consumption was 473.7 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, 32.6s OverallTime, 27 OverallIterations, 4 TraceHistogramMax, 21.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 955 SDtfs, 2550 SDslu, 4124 SDs, 0 SdLazy, 5061 SolverSat, 297 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 833 GetRequests, 377 SyntacticMatches, 12 SemanticMatches, 444 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1614 ImplicationChecksByTransitivity, 23.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 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, 448 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 1331 NumberOfCodeBlocks, 1331 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 903 ConstructedInterpolants, 158 QuantifiedInterpolants, 467586 SizeOfPredicates, 188 NumberOfNonLiveVariables, 2476 ConjunctsInSsa, 545 ConjunctsInUnsatCore, 31 InterpolantComputations, 16 PerfectInterpolantSequences, 51/269 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_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-12_06-15-14-365.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_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-12_06-15-14-365.csv Received shutdown request...