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-408c70d-m [2018-04-13 04:54:58,800 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 04:54:58,801 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 04:54:58,814 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 04:54:58,814 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 04:54:58,815 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 04:54:58,815 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 04:54:58,816 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 04:54:58,818 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 04:54:58,819 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 04:54:58,819 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 04:54:58,820 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 04:54:58,820 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 04:54:58,821 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 04:54:58,822 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 04:54:58,824 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 04:54:58,825 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 04:54:58,826 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 04:54:58,827 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 04:54:58,828 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 04:54:58,830 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 04:54:58,830 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 04:54:58,830 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 04:54:58,831 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 04:54:58,832 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 04:54:58,833 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 04:54:58,833 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 04:54:58,834 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 04:54:58,835 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 04:54:58,835 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 04:54:58,835 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 04:54:58,835 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-13 04:54:58,846 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 04:54:58,846 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 04:54:58,847 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 04:54:58,847 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 04:54:58,847 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 04:54:58,848 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 04:54:58,848 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 04:54:58,848 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 04:54:58,848 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 04:54:58,848 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 04:54:58,849 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 04:54:58,849 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 04:54:58,849 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 04:54:58,849 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 04:54:58,849 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 04:54:58,850 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 04:54:58,850 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 04:54:58,850 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 04:54:58,850 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 04:54:58,850 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 04:54:58,850 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 04:54:58,851 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 04:54:58,851 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 04:54:58,851 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 04:54:58,881 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 04:54:58,891 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 04:54:58,895 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 04:54:58,896 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 04:54:58,896 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 04:54:58,897 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-13 04:54:59,238 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG29c71d15e [2018-04-13 04:54:59,370 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 04:54:59,371 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 04:54:59,371 INFO L168 CDTParser]: Scanning substring-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:59,377 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 04:54:59,378 INFO L215 ultiparseSymbolTable]: [2018-04-13 04:54:59,378 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 04:54:59,378 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-13 04:54:59,378 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-13 04:54:59,378 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-13 04:54:59,378 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:54:59,378 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 04:54:59,378 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-13 04:54:59,379 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-13 04:54:59,379 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-13 04:54:59,379 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-13 04:54:59,379 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-13 04:54:59,379 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-13 04:54:59,379 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-13 04:54:59,379 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-13 04:54:59,379 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-13 04:54:59,379 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-13 04:54:59,379 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-13 04:54:59,379 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-13 04:54:59,380 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-13 04:54:59,380 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-13 04:54:59,380 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-13 04:54:59,380 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-13 04:54:59,380 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-13 04:54:59,380 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-13 04:54:59,380 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-13 04:54:59,380 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-13 04:54:59,380 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-13 04:54:59,381 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-13 04:54:59,381 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-13 04:54:59,381 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-13 04:54:59,381 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-13 04:54:59,381 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-13 04:54:59,381 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-13 04:54:59,381 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-13 04:54:59,381 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-13 04:54:59,381 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-13 04:54:59,381 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-13 04:54:59,382 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-13 04:54:59,382 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-13 04:54:59,382 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-13 04:54:59,382 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-13 04:54:59,382 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-13 04:54:59,382 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-13 04:54:59,382 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-13 04:54:59,382 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-13 04:54:59,382 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-13 04:54:59,382 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-13 04:54:59,383 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-13 04:54:59,383 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-13 04:54:59,383 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-13 04:54:59,383 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-13 04:54:59,383 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-13 04:54:59,383 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-13 04:54:59,383 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-13 04:54:59,383 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-13 04:54:59,383 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-13 04:54:59,383 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-13 04:54:59,383 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-13 04:54:59,383 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-13 04:54:59,384 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-13 04:54:59,384 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-13 04:54:59,384 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-13 04:54:59,384 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-13 04:54:59,384 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-13 04:54:59,384 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-13 04:54:59,384 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-13 04:54:59,384 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-13 04:54:59,384 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-13 04:54:59,384 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-13 04:54:59,384 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-13 04:54:59,385 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-13 04:54:59,385 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-13 04:54:59,385 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-13 04:54:59,385 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-13 04:54:59,385 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-13 04:54:59,385 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-13 04:54:59,385 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-13 04:54:59,385 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-13 04:54:59,385 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-13 04:54:59,385 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-13 04:54:59,385 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-13 04:54:59,385 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-13 04:54:59,385 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-13 04:54:59,385 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-13 04:54:59,386 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-13 04:54:59,386 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-13 04:54:59,386 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-13 04:54:59,386 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-13 04:54:59,386 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-13 04:54:59,386 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-13 04:54:59,386 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-13 04:54:59,386 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-13 04:54:59,386 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-13 04:54:59,386 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-13 04:54:59,386 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-13 04:54:59,386 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-13 04:54:59,387 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-13 04:54:59,387 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-13 04:54:59,387 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-13 04:54:59,387 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-13 04:54:59,387 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-13 04:54:59,387 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-13 04:54:59,387 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-13 04:54:59,387 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-13 04:54:59,387 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-13 04:54:59,387 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-13 04:54:59,387 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-13 04:54:59,387 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-13 04:54:59,387 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-13 04:54:59,388 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-13 04:54:59,388 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-13 04:54:59,388 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-13 04:54:59,388 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-13 04:54:59,388 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-13 04:54:59,388 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-13 04:54:59,388 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-13 04:54:59,388 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-13 04:54:59,388 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-13 04:54:59,388 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-13 04:54:59,388 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-13 04:54:59,388 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-13 04:54:59,388 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-13 04:54:59,389 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-13 04:54:59,389 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-13 04:54:59,389 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-13 04:54:59,389 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-13 04:54:59,402 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG29c71d15e [2018-04-13 04:54:59,405 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 04:54:59,406 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 04:54:59,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 04:54:59,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 04:54:59,410 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 04:54:59,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:54:59" (1/1) ... [2018-04-13 04:54:59,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39b84259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:59, skipping insertion in model container [2018-04-13 04:54:59,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:54:59" (1/1) ... [2018-04-13 04:54:59,423 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 04:54:59,445 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 04:54:59,564 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 04:54:59,599 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 04:54:59,604 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-13 04:54:59,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:59 WrapperNode [2018-04-13 04:54:59,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 04:54:59,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 04:54:59,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 04:54:59,634 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 04:54:59,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:59" (1/1) ... [2018-04-13 04:54:59,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:59" (1/1) ... [2018-04-13 04:54:59,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:59" (1/1) ... [2018-04-13 04:54:59,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:59" (1/1) ... [2018-04-13 04:54:59,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:59" (1/1) ... [2018-04-13 04:54:59,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:59" (1/1) ... [2018-04-13 04:54:59,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:59" (1/1) ... [2018-04-13 04:54:59,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 04:54:59,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 04:54:59,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 04:54:59,673 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 04:54:59,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:59" (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-13 04:54:59,773 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 04:54:59,773 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 04:54:59,773 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 04:54:59,773 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 04:54:59,773 INFO L136 BoogieDeclarations]: Found implementation of procedure substring [2018-04-13 04:54:59,773 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 04:54:59,773 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 04:54:59,773 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 04:54:59,773 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-13 04:54:59,773 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-13 04:54:59,773 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-13 04:54:59,773 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-13 04:54:59,774 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-13 04:54:59,774 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-13 04:54:59,774 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-13 04:54:59,774 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-13 04:54:59,774 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-13 04:54:59,774 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-13 04:54:59,774 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-13 04:54:59,774 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-13 04:54:59,774 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-13 04:54:59,774 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-13 04:54:59,774 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-13 04:54:59,774 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-13 04:54:59,774 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-13 04:54:59,774 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-13 04:54:59,774 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-13 04:54:59,774 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-13 04:54:59,774 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-13 04:54:59,774 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-13 04:54:59,775 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-13 04:54:59,775 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-13 04:54:59,775 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-13 04:54:59,775 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-13 04:54:59,775 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-13 04:54:59,775 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-13 04:54:59,775 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-13 04:54:59,775 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-13 04:54:59,775 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-13 04:54:59,775 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-13 04:54:59,775 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-13 04:54:59,775 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-13 04:54:59,775 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-13 04:54:59,775 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-13 04:54:59,775 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-13 04:54:59,775 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-13 04:54:59,775 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-13 04:54:59,775 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-13 04:54:59,775 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-13 04:54:59,776 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-13 04:54:59,776 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-13 04:54:59,776 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-13 04:54:59,776 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-13 04:54:59,776 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-13 04:54:59,776 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-13 04:54:59,776 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-13 04:54:59,776 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-13 04:54:59,776 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-13 04:54:59,776 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 04:54:59,776 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-13 04:54:59,776 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-13 04:54:59,776 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 04:54:59,776 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-13 04:54:59,776 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-13 04:54:59,776 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-13 04:54:59,776 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-13 04:54:59,776 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-13 04:54:59,776 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-13 04:54:59,777 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-13 04:54:59,777 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-13 04:54:59,777 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-13 04:54:59,777 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-13 04:54:59,777 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-13 04:54:59,777 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-13 04:54:59,777 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-13 04:54:59,777 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-13 04:54:59,777 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-13 04:54:59,777 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-13 04:54:59,777 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-13 04:54:59,777 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-13 04:54:59,777 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-13 04:54:59,777 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-13 04:54:59,777 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-13 04:54:59,777 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-13 04:54:59,777 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-13 04:54:59,777 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-13 04:54:59,777 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-13 04:54:59,778 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-13 04:54:59,778 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-13 04:54:59,778 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-13 04:54:59,778 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-13 04:54:59,778 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-13 04:54:59,778 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-13 04:54:59,778 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-13 04:54:59,778 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-13 04:54:59,778 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-13 04:54:59,778 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-13 04:54:59,778 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-13 04:54:59,778 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-13 04:54:59,778 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-13 04:54:59,778 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-13 04:54:59,778 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-13 04:54:59,778 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-13 04:54:59,778 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-13 04:54:59,778 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-13 04:54:59,779 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-13 04:54:59,779 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-13 04:54:59,779 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-13 04:54:59,779 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 04:54:59,779 INFO L128 BoogieDeclarations]: Found specification of procedure substring [2018-04-13 04:54:59,779 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 04:54:59,779 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 04:54:59,779 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 04:54:59,779 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 04:54:59,779 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 04:54:59,779 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 04:54:59,779 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 04:54:59,779 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 04:55:00,034 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 04:55:00,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:55:00 BoogieIcfgContainer [2018-04-13 04:55:00,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 04:55:00,035 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 04:55:00,035 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 04:55:00,037 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 04:55:00,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 04:54:59" (1/3) ... [2018-04-13 04:55:00,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2505a1b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:55:00, skipping insertion in model container [2018-04-13 04:55:00,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:54:59" (2/3) ... [2018-04-13 04:55:00,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2505a1b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:55:00, skipping insertion in model container [2018-04-13 04:55:00,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:55:00" (3/3) ... [2018-04-13 04:55:00,040 INFO L107 eAbstractionObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:55:00,049 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 04:55:00,056 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-04-13 04:55:00,084 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 04:55:00,085 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 04:55:00,085 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 04:55:00,085 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 04:55:00,085 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 04:55:00,085 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 04:55:00,085 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 04:55:00,086 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 04:55:00,086 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 04:55:00,086 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 04:55:00,095 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-04-13 04:55:00,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 04:55:00,101 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:00,102 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:55:00,102 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:00,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1359245197, now seen corresponding path program 1 times [2018-04-13 04:55:00,106 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:00,106 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:00,136 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:00,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:00,136 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:00,184 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:00,198 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:55:00,198 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:55:00,198 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:55:00,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:00,230 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:55:00,260 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-13 04:55:00,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:00,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:00,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 04:55:00,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:00,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:00,295 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-13 04:55:00,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:00,301 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-13 04:55:00,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-13 04:55:00,319 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-13 04:55:00,320 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:55:00,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 04:55:00,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 04:55:00,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 04:55:00,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:55:00,332 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 5 states. [2018-04-13 04:55:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:00,455 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-04-13 04:55:00,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 04:55:00,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-04-13 04:55:00,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:00,464 INFO L225 Difference]: With dead ends: 55 [2018-04-13 04:55:00,464 INFO L226 Difference]: Without dead ends: 52 [2018-04-13 04:55:00,466 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-13 04:55:00,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-13 04:55:00,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-04-13 04:55:00,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-13 04:55:00,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-04-13 04:55:00,495 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 13 [2018-04-13 04:55:00,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:00,495 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-04-13 04:55:00,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 04:55:00,495 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-04-13 04:55:00,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 04:55:00,496 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:00,496 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:55:00,496 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:00,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1359245198, now seen corresponding path program 1 times [2018-04-13 04:55:00,496 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:00,497 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:00,497 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:00,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:00,498 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:00,510 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:00,516 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:55:00,516 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:55:00,516 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:55:00,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:00,539 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:55:00,547 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-13 04:55:00,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:00,553 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-13 04:55:00,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:00,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:00,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:55:00,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:00,580 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-13 04:55:00,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:00,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:00,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:00,604 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-13 04:55:00,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:00,615 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-13 04:55:00,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 04:55:00,628 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-13 04:55:00,628 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:55:00,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 04:55:00,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 04:55:00,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 04:55:00,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:55:00,629 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 6 states. [2018-04-13 04:55:00,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:00,769 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-04-13 04:55:00,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:55:00,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-13 04:55:00,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:00,772 INFO L225 Difference]: With dead ends: 69 [2018-04-13 04:55:00,772 INFO L226 Difference]: Without dead ends: 69 [2018-04-13 04:55:00,772 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-13 04:55:00,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-04-13 04:55:00,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2018-04-13 04:55:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-04-13 04:55:00,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-04-13 04:55:00,780 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 13 [2018-04-13 04:55:00,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:00,780 INFO L459 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-04-13 04:55:00,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 04:55:00,781 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-04-13 04:55:00,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 04:55:00,781 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:00,781 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:55:00,781 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:00,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1160714736, now seen corresponding path program 1 times [2018-04-13 04:55:00,781 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:00,782 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:00,782 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:00,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:00,783 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:00,791 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:00,794 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:55:00,794 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:55:00,794 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:55:00,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:00,813 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:55:00,819 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-13 04:55:00,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:00,825 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-13 04:55:00,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:00,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:00,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:55:00,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:00,855 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:00,856 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-13 04:55:00,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:00,868 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-13 04:55:00,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:00,877 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-13 04:55:00,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 04:55:00,884 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-13 04:55:00,884 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:55:00,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 04:55:00,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 04:55:00,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 04:55:00,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:55:00,885 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 6 states. [2018-04-13 04:55:00,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:00,936 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-04-13 04:55:00,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:55:00,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-13 04:55:00,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:00,937 INFO L225 Difference]: With dead ends: 57 [2018-04-13 04:55:00,937 INFO L226 Difference]: Without dead ends: 57 [2018-04-13 04:55:00,937 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-13 04:55:00,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-13 04:55:00,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2018-04-13 04:55:00,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-13 04:55:00,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-04-13 04:55:00,940 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2018-04-13 04:55:00,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:00,940 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-04-13 04:55:00,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 04:55:00,940 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-04-13 04:55:00,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 04:55:00,940 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:00,940 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:55:00,940 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:00,940 INFO L82 PathProgramCache]: Analyzing trace with hash -813071859, now seen corresponding path program 1 times [2018-04-13 04:55:00,941 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:00,941 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:00,941 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:00,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:00,941 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:00,948 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:00,969 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-13 04:55:00,969 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:55:00,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 04:55:00,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 04:55:00,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 04:55:00,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 04:55:00,970 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 4 states. [2018-04-13 04:55:01,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:01,002 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-04-13 04:55:01,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 04:55:01,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-13 04:55:01,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:01,003 INFO L225 Difference]: With dead ends: 50 [2018-04-13 04:55:01,003 INFO L226 Difference]: Without dead ends: 50 [2018-04-13 04:55:01,003 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-13 04:55:01,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-13 04:55:01,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-04-13 04:55:01,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-13 04:55:01,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-04-13 04:55:01,005 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 14 [2018-04-13 04:55:01,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:01,006 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-04-13 04:55:01,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 04:55:01,006 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-04-13 04:55:01,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 04:55:01,006 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:01,006 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:55:01,006 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:01,006 INFO L82 PathProgramCache]: Analyzing trace with hash -813071858, now seen corresponding path program 1 times [2018-04-13 04:55:01,006 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:01,006 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:01,007 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:01,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:01,007 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:01,024 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:01,054 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-13 04:55:01,054 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:55:01,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 04:55:01,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 04:55:01,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 04:55:01,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:55:01,056 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 5 states. [2018-04-13 04:55:01,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:01,082 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-04-13 04:55:01,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:55:01,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-13 04:55:01,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:01,083 INFO L225 Difference]: With dead ends: 49 [2018-04-13 04:55:01,083 INFO L226 Difference]: Without dead ends: 49 [2018-04-13 04:55:01,084 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-13 04:55:01,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-13 04:55:01,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-04-13 04:55:01,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-13 04:55:01,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-04-13 04:55:01,086 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 14 [2018-04-13 04:55:01,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:01,086 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-04-13 04:55:01,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 04:55:01,086 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-04-13 04:55:01,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-13 04:55:01,087 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:01,087 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-13 04:55:01,087 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:01,087 INFO L82 PathProgramCache]: Analyzing trace with hash 198035442, now seen corresponding path program 1 times [2018-04-13 04:55:01,087 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:01,087 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:01,088 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:01,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:01,088 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:01,097 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:01,120 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-13 04:55:01,120 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:55:01,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 04:55:01,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 04:55:01,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 04:55:01,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:55:01,122 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2018-04-13 04:55:01,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:01,165 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-04-13 04:55:01,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 04:55:01,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-13 04:55:01,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:01,166 INFO L225 Difference]: With dead ends: 48 [2018-04-13 04:55:01,166 INFO L226 Difference]: Without dead ends: 48 [2018-04-13 04:55:01,166 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-13 04:55:01,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-13 04:55:01,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-04-13 04:55:01,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-04-13 04:55:01,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-04-13 04:55:01,168 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 18 [2018-04-13 04:55:01,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:01,168 INFO L459 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-04-13 04:55:01,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 04:55:01,168 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-04-13 04:55:01,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-13 04:55:01,169 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:01,169 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-13 04:55:01,169 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:01,169 INFO L82 PathProgramCache]: Analyzing trace with hash 198035443, now seen corresponding path program 1 times [2018-04-13 04:55:01,169 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:01,169 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:01,170 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:01,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:01,170 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:01,179 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:01,226 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-13 04:55:01,226 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:55:01,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 04:55:01,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 04:55:01,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 04:55:01,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-13 04:55:01,227 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 8 states. [2018-04-13 04:55:01,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:01,297 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-04-13 04:55:01,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 04:55:01,298 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-04-13 04:55:01,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:01,299 INFO L225 Difference]: With dead ends: 72 [2018-04-13 04:55:01,299 INFO L226 Difference]: Without dead ends: 72 [2018-04-13 04:55:01,299 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-13 04:55:01,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-13 04:55:01,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2018-04-13 04:55:01,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-13 04:55:01,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-04-13 04:55:01,301 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 18 [2018-04-13 04:55:01,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:01,302 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-04-13 04:55:01,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 04:55:01,302 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-04-13 04:55:01,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-13 04:55:01,302 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:01,302 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-13 04:55:01,302 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:01,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1611194078, now seen corresponding path program 1 times [2018-04-13 04:55:01,302 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:01,302 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:01,303 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:01,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:01,303 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:01,309 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:01,330 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-13 04:55:01,330 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:55:01,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 04:55:01,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 04:55:01,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 04:55:01,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:55:01,331 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 6 states. [2018-04-13 04:55:01,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:01,377 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-04-13 04:55:01,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:55:01,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-04-13 04:55:01,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:01,378 INFO L225 Difference]: With dead ends: 51 [2018-04-13 04:55:01,378 INFO L226 Difference]: Without dead ends: 51 [2018-04-13 04:55:01,378 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-13 04:55:01,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-13 04:55:01,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-04-13 04:55:01,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-13 04:55:01,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-04-13 04:55:01,381 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 21 [2018-04-13 04:55:01,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:01,381 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-04-13 04:55:01,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 04:55:01,381 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-04-13 04:55:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-13 04:55:01,381 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:01,381 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-13 04:55:01,381 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:01,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1611194077, now seen corresponding path program 1 times [2018-04-13 04:55:01,382 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:01,382 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:01,382 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:01,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:01,382 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:01,390 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:01,448 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-13 04:55:01,448 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:55:01,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 04:55:01,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 04:55:01,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 04:55:01,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-13 04:55:01,449 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 9 states. [2018-04-13 04:55:01,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:01,565 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-04-13 04:55:01,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 04:55:01,566 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-04-13 04:55:01,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:01,566 INFO L225 Difference]: With dead ends: 66 [2018-04-13 04:55:01,566 INFO L226 Difference]: Without dead ends: 66 [2018-04-13 04:55:01,566 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-13 04:55:01,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-13 04:55:01,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-04-13 04:55:01,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-13 04:55:01,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2018-04-13 04:55:01,570 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 21 [2018-04-13 04:55:01,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:01,570 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2018-04-13 04:55:01,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 04:55:01,570 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-04-13 04:55:01,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-13 04:55:01,571 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:01,571 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-13 04:55:01,571 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:01,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1620411736, now seen corresponding path program 1 times [2018-04-13 04:55:01,572 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:01,572 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:01,572 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:01,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:01,572 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:01,581 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:01,609 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-13 04:55:01,609 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:55:01,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 04:55:01,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 04:55:01,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 04:55:01,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:55:01,609 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 6 states. [2018-04-13 04:55:01,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:01,657 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-04-13 04:55:01,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:55:01,657 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-04-13 04:55:01,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:01,658 INFO L225 Difference]: With dead ends: 59 [2018-04-13 04:55:01,658 INFO L226 Difference]: Without dead ends: 59 [2018-04-13 04:55:01,658 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-13 04:55:01,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-13 04:55:01,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-04-13 04:55:01,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-13 04:55:01,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-04-13 04:55:01,661 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 25 [2018-04-13 04:55:01,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:01,661 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-04-13 04:55:01,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 04:55:01,661 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-04-13 04:55:01,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-13 04:55:01,662 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:01,662 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-13 04:55:01,662 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:01,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1620411735, now seen corresponding path program 1 times [2018-04-13 04:55:01,662 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:01,662 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:01,662 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:01,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:01,663 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:01,668 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:55:01,725 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:55:01,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 04:55:01,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 04:55:01,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 04:55:01,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-13 04:55:01,726 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 8 states. [2018-04-13 04:55:01,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:01,806 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2018-04-13 04:55:01,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 04:55:01,806 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-04-13 04:55:01,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:01,807 INFO L225 Difference]: With dead ends: 92 [2018-04-13 04:55:01,807 INFO L226 Difference]: Without dead ends: 92 [2018-04-13 04:55:01,807 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-13 04:55:01,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-04-13 04:55:01,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2018-04-13 04:55:01,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-04-13 04:55:01,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-04-13 04:55:01,810 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 25 [2018-04-13 04:55:01,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:01,811 INFO L459 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-04-13 04:55:01,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 04:55:01,811 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-04-13 04:55:01,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-13 04:55:01,812 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:01,812 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-13 04:55:01,812 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:01,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1307124962, now seen corresponding path program 1 times [2018-04-13 04:55:01,812 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:01,812 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:01,813 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:01,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:01,813 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:01,820 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:01,832 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-13 04:55:01,832 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:55:01,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 04:55:01,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 04:55:01,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 04:55:01,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 04:55:01,833 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 3 states. [2018-04-13 04:55:01,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:01,839 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-04-13 04:55:01,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 04:55:01,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-04-13 04:55:01,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:01,840 INFO L225 Difference]: With dead ends: 64 [2018-04-13 04:55:01,840 INFO L226 Difference]: Without dead ends: 64 [2018-04-13 04:55:01,841 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-13 04:55:01,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-04-13 04:55:01,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-04-13 04:55:01,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-13 04:55:01,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2018-04-13 04:55:01,843 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 26 [2018-04-13 04:55:01,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:01,843 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-04-13 04:55:01,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 04:55:01,844 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2018-04-13 04:55:01,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 04:55:01,844 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:01,844 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-13 04:55:01,844 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:01,844 INFO L82 PathProgramCache]: Analyzing trace with hash 2015624486, now seen corresponding path program 1 times [2018-04-13 04:55:01,845 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:01,845 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:01,845 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:01,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:01,845 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:01,853 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:01,880 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-13 04:55:01,881 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:55:01,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 04:55:01,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 04:55:01,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 04:55:01,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:55:01,881 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 6 states. [2018-04-13 04:55:01,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:01,938 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-04-13 04:55:01,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 04:55:01,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-04-13 04:55:01,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:01,939 INFO L225 Difference]: With dead ends: 70 [2018-04-13 04:55:01,939 INFO L226 Difference]: Without dead ends: 70 [2018-04-13 04:55:01,939 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-13 04:55:01,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-04-13 04:55:01,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-04-13 04:55:01,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-13 04:55:01,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-04-13 04:55:01,942 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 28 [2018-04-13 04:55:01,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:01,942 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-04-13 04:55:01,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 04:55:01,942 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-04-13 04:55:01,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 04:55:01,943 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:01,943 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-13 04:55:01,943 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:01,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1801524697, now seen corresponding path program 1 times [2018-04-13 04:55:01,944 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:01,944 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:01,944 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:01,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:01,945 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:01,954 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:01,956 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:55:01,956 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:55:01,957 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:55:01,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:01,974 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:55:02,220 WARN L148 SmtUtils]: Spent 103ms on a formula simplification that was a NOOP. DAG size: 16 [2018-04-13 04:55:02,223 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:02,224 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-13 04:55:02,228 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:02,229 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-13 04:55:02,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:02,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:02,245 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-13 04:55:02,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-13 04:55:02,290 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-13 04:55:02,295 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-13 04:55:02,298 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-13 04:55:02,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:55:02,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 04:55:02,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 04:55:02,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 04:55:02,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-13 04:55:02,299 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 8 states. [2018-04-13 04:55:02,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:02,388 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-04-13 04:55:02,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 04:55:02,389 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-04-13 04:55:02,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:02,389 INFO L225 Difference]: With dead ends: 66 [2018-04-13 04:55:02,389 INFO L226 Difference]: Without dead ends: 54 [2018-04-13 04:55:02,390 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=30, Unknown=2, NotChecked=22, Total=72 [2018-04-13 04:55:02,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-13 04:55:02,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-13 04:55:02,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-13 04:55:02,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-04-13 04:55:02,392 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 28 [2018-04-13 04:55:02,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:02,392 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-04-13 04:55:02,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 04:55:02,392 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-04-13 04:55:02,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 04:55:02,392 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:02,392 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-13 04:55:02,392 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:02,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1695652845, now seen corresponding path program 1 times [2018-04-13 04:55:02,393 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:02,393 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:02,393 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:02,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:02,393 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:02,400 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:02,402 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:55:02,402 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:55:02,402 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:55:02,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:02,425 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:55:02,434 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-13 04:55:02,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:02,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:02,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 04:55:02,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:02,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:02,462 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-13 04:55:02,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:02,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:02,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-13 04:55:02,634 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-13 04:55:02,639 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-13 04:55:02,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:02,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:02,676 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-13 04:55:02,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-13 04:55:02,692 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-13 04:55:02,695 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-13 04:55:02,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:02,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:02,706 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-13 04:55:02,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:36 [2018-04-13 04:55:02,803 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-13 04:55:02,803 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:55:02,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-13 04:55:02,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 04:55:02,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 04:55:02,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-04-13 04:55:02,805 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 12 states. [2018-04-13 04:55:03,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:03,006 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-04-13 04:55:03,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 04:55:03,006 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-04-13 04:55:03,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:03,006 INFO L225 Difference]: With dead ends: 66 [2018-04-13 04:55:03,006 INFO L226 Difference]: Without dead ends: 54 [2018-04-13 04:55:03,007 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-13 04:55:03,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-13 04:55:03,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-13 04:55:03,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-13 04:55:03,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-04-13 04:55:03,008 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 29 [2018-04-13 04:55:03,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:03,008 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-04-13 04:55:03,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 04:55:03,008 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-04-13 04:55:03,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 04:55:03,009 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:03,009 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-13 04:55:03,009 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:03,009 INFO L82 PathProgramCache]: Analyzing trace with hash 793876117, now seen corresponding path program 1 times [2018-04-13 04:55:03,010 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:03,010 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:03,010 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:03,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:03,010 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:03,020 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:03,092 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-13 04:55:03,092 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:55:03,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-13 04:55:03,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 04:55:03,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 04:55:03,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-04-13 04:55:03,093 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 11 states. [2018-04-13 04:55:03,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:03,183 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-04-13 04:55:03,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 04:55:03,183 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-04-13 04:55:03,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:03,184 INFO L225 Difference]: With dead ends: 69 [2018-04-13 04:55:03,184 INFO L226 Difference]: Without dead ends: 54 [2018-04-13 04:55:03,184 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-04-13 04:55:03,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-13 04:55:03,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-13 04:55:03,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-13 04:55:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-04-13 04:55:03,186 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 29 [2018-04-13 04:55:03,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:03,186 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-04-13 04:55:03,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 04:55:03,186 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-04-13 04:55:03,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 04:55:03,186 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:03,186 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-13 04:55:03,186 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:03,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1012730835, now seen corresponding path program 1 times [2018-04-13 04:55:03,187 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:03,187 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:03,187 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:03,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:03,188 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:03,197 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:03,300 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-13 04:55:03,300 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:55:03,300 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:55:03,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:03,330 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:55:03,334 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-13 04:55:03,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:03,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:03,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 04:55:03,359 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-13 04:55:03,360 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-13 04:55:03,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:03,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:03,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:03,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-13 04:55:03,452 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-13 04:55:03,463 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-13 04:55:03,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:55:03,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:55:03,481 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-13 04:55:03,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:54 [2018-04-13 04:55:03,614 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-13 04:55:03,615 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:55:03,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-04-13 04:55:03,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 04:55:03,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 04:55:03,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-04-13 04:55:03,616 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 22 states. [2018-04-13 04:55:04,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:04,213 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-04-13 04:55:04,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 04:55:04,213 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2018-04-13 04:55:04,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:04,214 INFO L225 Difference]: With dead ends: 77 [2018-04-13 04:55:04,214 INFO L226 Difference]: Without dead ends: 75 [2018-04-13 04:55:04,214 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-13 04:55:04,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-13 04:55:04,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 62. [2018-04-13 04:55:04,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-04-13 04:55:04,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-04-13 04:55:04,215 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 29 [2018-04-13 04:55:04,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:04,215 INFO L459 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-04-13 04:55:04,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 04:55:04,216 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-04-13 04:55:04,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-13 04:55:04,216 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:04,216 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-13 04:55:04,216 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:04,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1724257321, now seen corresponding path program 1 times [2018-04-13 04:55:04,216 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:04,216 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:04,217 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:04,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:04,217 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:04,223 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:04,224 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:55:04,224 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:55:04,224 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:55:04,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:04,247 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:55:04,263 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-13 04:55:04,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:04,271 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-13 04:55:04,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:04,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:04,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:55:04,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:04,286 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-13 04:55:04,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:04,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:04,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:04,298 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-13 04:55:04,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:04,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:04,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-13 04:55:04,319 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-13 04:55:04,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 13 treesize of output 12 [2018-04-13 04:55:04,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:04,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:04,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:04,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-13 04:55:04,339 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-13 04:55:04,341 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-13 04:55:04,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:04,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:04,351 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-13 04:55:04,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:39 [2018-04-13 04:55:04,413 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-13 04:55:04,418 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-13 04:55:04,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:55:04,424 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-13 04:55:04,424 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:04,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:55:04,439 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-13 04:55:04,439 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:54 [2018-04-13 04:55:04,503 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-13 04:55:04,503 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:55:04,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 04:55:04,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 04:55:04,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 04:55:04,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-04-13 04:55:04,504 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 13 states. [2018-04-13 04:55:05,865 WARN L151 SmtUtils]: Spent 1230ms on a formula simplification. DAG size of input: 47 DAG size of output 43 [2018-04-13 04:55:06,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:06,310 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2018-04-13 04:55:06,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 04:55:06,310 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-04-13 04:55:06,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:06,311 INFO L225 Difference]: With dead ends: 125 [2018-04-13 04:55:06,311 INFO L226 Difference]: Without dead ends: 125 [2018-04-13 04:55:06,311 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-13 04:55:06,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-13 04:55:06,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2018-04-13 04:55:06,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-13 04:55:06,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2018-04-13 04:55:06,313 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 31 [2018-04-13 04:55:06,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:06,313 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2018-04-13 04:55:06,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 04:55:06,314 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2018-04-13 04:55:06,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 04:55:06,314 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:06,314 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-13 04:55:06,314 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:06,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1820036441, now seen corresponding path program 1 times [2018-04-13 04:55:06,314 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:06,314 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:06,315 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:06,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:06,315 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:06,324 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:06,327 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:55:06,328 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:55:06,328 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:55:06,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:06,355 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:55:06,373 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-13 04:55:06,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:06,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:06,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-04-13 04:55:06,398 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-13 04:55:06,400 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-13 04:55:06,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:06,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:06,408 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-13 04:55:06,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-04-13 04:55:06,431 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-13 04:55:06,434 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-13 04:55:06,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:06,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:06,454 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-13 04:55:06,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:49 [2018-04-13 04:55:06,743 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-13 04:55:06,764 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-13 04:55:06,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-13 04:55:06,830 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-13 04:55:06,830 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 04:55:06,868 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-13 04:55:06,868 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:06,870 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-13 04:55:06,870 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:06,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 04:55:06,937 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-13 04:55:06,937 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:72, output treesize:387 [2018-04-13 04:55:07,083 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 53 DAG size of output 42 [2018-04-13 04:55:07,274 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-13 04:55:07,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:55:07,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 04:55:07,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 04:55:07,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 04:55:07,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-04-13 04:55:07,275 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand 20 states. [2018-04-13 04:55:07,699 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 81 DAG size of output 81 [2018-04-13 04:55:08,071 WARN L151 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 112 DAG size of output 103 [2018-04-13 04:55:08,420 WARN L151 SmtUtils]: Spent 314ms on a formula simplification. DAG size of input: 116 DAG size of output 111 [2018-04-13 04:55:08,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:08,734 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2018-04-13 04:55:08,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 04:55:08,734 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2018-04-13 04:55:08,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:08,735 INFO L225 Difference]: With dead ends: 100 [2018-04-13 04:55:08,735 INFO L226 Difference]: Without dead ends: 100 [2018-04-13 04:55:08,735 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=215, Invalid=1117, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 04:55:08,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-13 04:55:08,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2018-04-13 04:55:08,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-13 04:55:08,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2018-04-13 04:55:08,738 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 33 [2018-04-13 04:55:08,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:08,738 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2018-04-13 04:55:08,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 04:55:08,738 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2018-04-13 04:55:08,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-13 04:55:08,738 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:08,738 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-13 04:55:08,738 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:08,739 INFO L82 PathProgramCache]: Analyzing trace with hash 2127994563, now seen corresponding path program 2 times [2018-04-13 04:55:08,739 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:08,739 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:08,739 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:08,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:08,739 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:08,748 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:08,971 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-13 04:55:08,972 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:55:08,972 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:55:08,972 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:55:08,993 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:55:08,993 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:55:08,997 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:55:09,014 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-13 04:55:09,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:09,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:09,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 04:55:09,049 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-13 04:55:09,051 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-13 04:55:09,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:09,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:09,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:09,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-13 04:55:09,278 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-13 04:55:09,281 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-13 04:55:09,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:09,304 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-13 04:55:09,304 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:09,325 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-13 04:55:09,326 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-04-13 04:55:09,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 04:55:09,361 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-13 04:55:09,361 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:85 [2018-04-13 04:55:09,427 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-13 04:55:09,427 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:55:09,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 28 [2018-04-13 04:55:09,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-13 04:55:09,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-13 04:55:09,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2018-04-13 04:55:09,428 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand 29 states. [2018-04-13 04:55:10,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:10,056 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2018-04-13 04:55:10,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 04:55:10,057 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2018-04-13 04:55:10,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:10,058 INFO L225 Difference]: With dead ends: 134 [2018-04-13 04:55:10,058 INFO L226 Difference]: Without dead ends: 132 [2018-04-13 04:55:10,059 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=268, Invalid=1454, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 04:55:10,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-13 04:55:10,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 101. [2018-04-13 04:55:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-13 04:55:10,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 119 transitions. [2018-04-13 04:55:10,061 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 119 transitions. Word has length 37 [2018-04-13 04:55:10,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:10,061 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 119 transitions. [2018-04-13 04:55:10,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-13 04:55:10,061 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 119 transitions. [2018-04-13 04:55:10,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-13 04:55:10,061 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:10,062 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-13 04:55:10,062 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:10,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1372787131, now seen corresponding path program 1 times [2018-04-13 04:55:10,062 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:10,062 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:10,062 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:10,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:55:10,062 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:10,067 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:10,113 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-13 04:55:10,113 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:55:10,113 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:55:10,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:10,127 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:55:10,190 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-13 04:55:10,190 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:55:10,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-04-13 04:55:10,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 04:55:10,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 04:55:10,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-04-13 04:55:10,191 INFO L87 Difference]: Start difference. First operand 101 states and 119 transitions. Second operand 16 states. [2018-04-13 04:55:10,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:10,349 INFO L93 Difference]: Finished difference Result 161 states and 181 transitions. [2018-04-13 04:55:10,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 04:55:10,350 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2018-04-13 04:55:10,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:10,350 INFO L225 Difference]: With dead ends: 161 [2018-04-13 04:55:10,350 INFO L226 Difference]: Without dead ends: 161 [2018-04-13 04:55:10,351 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-13 04:55:10,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-13 04:55:10,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 101. [2018-04-13 04:55:10,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-13 04:55:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 118 transitions. [2018-04-13 04:55:10,352 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 118 transitions. Word has length 38 [2018-04-13 04:55:10,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:10,353 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 118 transitions. [2018-04-13 04:55:10,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 04:55:10,353 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 118 transitions. [2018-04-13 04:55:10,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-13 04:55:10,353 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:10,353 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-13 04:55:10,353 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:10,353 INFO L82 PathProgramCache]: Analyzing trace with hash -518903735, now seen corresponding path program 2 times [2018-04-13 04:55:10,353 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:10,354 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:10,354 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:10,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:10,354 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:10,360 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:10,362 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:55:10,362 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:55:10,362 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:55:10,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:55:10,380 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:55:10,380 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:55:10,383 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:55:10,389 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-13 04:55:10,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:10,395 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-13 04:55:10,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:10,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:10,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:55:10,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:10,418 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-13 04:55:10,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:10,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:10,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:10,428 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-13 04:55:10,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:10,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:10,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-13 04:55:10,454 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-13 04:55:10,456 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-13 04:55:10,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:10,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:10,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:10,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-13 04:55:10,482 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-13 04:55:10,483 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-13 04:55:10,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:10,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:10,503 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-13 04:55:10,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-04-13 04:55:12,700 WARN L148 SmtUtils]: Spent 2026ms on a formula simplification that was a NOOP. DAG size: 36 [2018-04-13 04:55:12,750 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-13 04:55:12,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:12,757 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-13 04:55:12,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:55:12,769 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-13 04:55:12,769 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:12,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:55:12,790 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-13 04:55:12,790 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:69, output treesize:54 [2018-04-13 04:55:12,863 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-13 04:55:12,863 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:55:12,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 04:55:12,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 04:55:12,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 04:55:12,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2018-04-13 04:55:12,864 INFO L87 Difference]: Start difference. First operand 101 states and 118 transitions. Second operand 20 states. [2018-04-13 04:55:17,400 WARN L151 SmtUtils]: Spent 4097ms on a formula simplification. DAG size of input: 75 DAG size of output 75 [2018-04-13 04:55:17,877 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 91 DAG size of output 85 [2018-04-13 04:55:18,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:18,199 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2018-04-13 04:55:18,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 04:55:18,199 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2018-04-13 04:55:18,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:18,200 INFO L225 Difference]: With dead ends: 121 [2018-04-13 04:55:18,200 INFO L226 Difference]: Without dead ends: 121 [2018-04-13 04:55:18,200 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=214, Invalid=1346, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 04:55:18,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-04-13 04:55:18,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 101. [2018-04-13 04:55:18,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-13 04:55:18,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2018-04-13 04:55:18,203 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 41 [2018-04-13 04:55:18,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:18,203 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2018-04-13 04:55:18,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 04:55:18,204 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2018-04-13 04:55:18,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-13 04:55:18,204 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:18,204 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-13 04:55:18,204 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:18,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1224572237, now seen corresponding path program 2 times [2018-04-13 04:55:18,205 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:18,205 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:18,205 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:18,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:55:18,205 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:18,214 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:18,218 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:55:18,218 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:55:18,218 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:55:18,219 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:55:18,242 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:55:18,242 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:55:18,246 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:55:18,249 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-13 04:55:18,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:18,254 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-13 04:55:18,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:18,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:18,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:55:18,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:18,277 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-13 04:55:18,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:18,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:18,291 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:18,292 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-13 04:55:18,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:18,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:18,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-13 04:55:18,317 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-13 04:55:18,319 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-13 04:55:18,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:18,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:18,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:18,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-13 04:55:18,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 29 treesize of output 30 [2018-04-13 04:55:18,344 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-13 04:55:18,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:18,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:18,362 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-13 04:55:18,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-04-13 04:55:18,469 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-13 04:55:18,471 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-13 04:55:18,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:18,505 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-13 04:55:18,505 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 04:55:18,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:55:18,517 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-13 04:55:18,517 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:48, output treesize:48 [2018-04-13 04:55:18,598 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-13 04:55:18,598 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:55:18,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 04:55:18,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 04:55:18,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 04:55:18,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-04-13 04:55:18,599 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand 15 states. [2018-04-13 04:55:19,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:19,338 INFO L93 Difference]: Finished difference Result 193 states and 219 transitions. [2018-04-13 04:55:19,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 04:55:19,338 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-04-13 04:55:19,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:19,339 INFO L225 Difference]: With dead ends: 193 [2018-04-13 04:55:19,339 INFO L226 Difference]: Without dead ends: 193 [2018-04-13 04:55:19,339 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-13 04:55:19,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-13 04:55:19,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 139. [2018-04-13 04:55:19,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-04-13 04:55:19,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 166 transitions. [2018-04-13 04:55:19,341 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 166 transitions. Word has length 44 [2018-04-13 04:55:19,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:19,341 INFO L459 AbstractCegarLoop]: Abstraction has 139 states and 166 transitions. [2018-04-13 04:55:19,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 04:55:19,341 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 166 transitions. [2018-04-13 04:55:19,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-13 04:55:19,342 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:19,342 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-13 04:55:19,342 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:19,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1069957555, now seen corresponding path program 3 times [2018-04-13 04:55:19,342 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:19,342 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:19,343 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:19,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:55:19,343 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:19,350 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:19,480 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-13 04:55:19,480 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:55:19,480 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:55:19,481 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:55:19,515 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 04:55:19,516 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:55:19,519 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:55:19,535 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-13 04:55:19,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:19,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:19,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 04:55:19,555 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-13 04:55:19,558 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-13 04:55:19,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:19,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:19,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:19,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-13 04:55:19,610 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-13 04:55:19,618 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-13 04:55:19,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:55:19,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:55:19,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:55:19,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-04-13 04:55:19,717 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-13 04:55:19,717 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:55:19,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 15 [2018-04-13 04:55:19,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 04:55:19,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 04:55:19,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-04-13 04:55:19,718 INFO L87 Difference]: Start difference. First operand 139 states and 166 transitions. Second operand 16 states. [2018-04-13 04:55:20,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:20,055 INFO L93 Difference]: Finished difference Result 151 states and 171 transitions. [2018-04-13 04:55:20,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 04:55:20,055 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2018-04-13 04:55:20,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:20,055 INFO L225 Difference]: With dead ends: 151 [2018-04-13 04:55:20,056 INFO L226 Difference]: Without dead ends: 149 [2018-04-13 04:55:20,056 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2018-04-13 04:55:20,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-04-13 04:55:20,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 93. [2018-04-13 04:55:20,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-04-13 04:55:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2018-04-13 04:55:20,057 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 45 [2018-04-13 04:55:20,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:20,057 INFO L459 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2018-04-13 04:55:20,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 04:55:20,058 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-04-13 04:55:20,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-13 04:55:20,058 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:20,058 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-13 04:55:20,058 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:20,058 INFO L82 PathProgramCache]: Analyzing trace with hash 981065013, now seen corresponding path program 1 times [2018-04-13 04:55:20,058 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:20,058 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:20,059 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:20,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:55:20,059 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:20,066 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:20,070 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:55:20,070 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:55:20,070 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:55:20,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:20,096 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:55:20,103 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-13 04:55:20,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:20,107 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-13 04:55:20,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:20,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:20,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:55:20,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:20,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:20,129 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-13 04:55:20,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:20,135 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-13 04:55:20,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:20,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:20,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-13 04:55:20,151 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-13 04:55:20,153 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-13 04:55:20,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:20,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:20,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:20,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-13 04:55:20,172 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-13 04:55:20,174 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-13 04:55:20,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:20,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:20,183 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-13 04:55:20,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-04-13 04:55:20,381 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-13 04:55:20,384 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-13 04:55:20,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:20,399 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-13 04:55:20,400 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 04:55:20,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:55:20,427 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-13 04:55:20,427 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:66, output treesize:64 [2018-04-13 04:55:20,536 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-13 04:55:20,536 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:55:20,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 04:55:20,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 04:55:20,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 04:55:20,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-04-13 04:55:20,537 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 18 states. [2018-04-13 04:55:21,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:21,426 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2018-04-13 04:55:21,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 04:55:21,426 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-04-13 04:55:21,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:21,426 INFO L225 Difference]: With dead ends: 115 [2018-04-13 04:55:21,426 INFO L226 Difference]: Without dead ends: 115 [2018-04-13 04:55:21,427 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 04:55:21,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-04-13 04:55:21,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2018-04-13 04:55:21,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-13 04:55:21,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2018-04-13 04:55:21,428 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 46 [2018-04-13 04:55:21,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:21,428 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2018-04-13 04:55:21,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 04:55:21,428 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2018-04-13 04:55:21,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-13 04:55:21,429 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:21,429 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-13 04:55:21,429 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:21,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1969827015, now seen corresponding path program 3 times [2018-04-13 04:55:21,429 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:21,429 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:21,429 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:21,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:55:21,429 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:21,448 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:21,452 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:55:21,452 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:55:21,452 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:55:21,453 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:55:21,485 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 04:55:21,485 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:55:21,489 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:55:21,493 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-13 04:55:21,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:21,499 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-13 04:55:21,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:21,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:21,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:55:21,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:21,522 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-13 04:55:21,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:21,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:21,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:21,534 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-13 04:55:21,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:21,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:21,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-13 04:55:21,562 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-13 04:55:21,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 12 treesize of output 11 [2018-04-13 04:55:21,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:21,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:21,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:21,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-13 04:55:21,587 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-13 04:55:21,589 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-13 04:55:21,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:21,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:21,598 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-13 04:55:21,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-04-13 04:55:23,728 WARN L148 SmtUtils]: Spent 2015ms on a formula simplification that was a NOOP. DAG size: 32 [2018-04-13 04:55:23,787 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-13 04:55:23,791 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-13 04:55:23,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:23,841 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-13 04:55:23,841 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-13 04:55:23,887 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-13 04:55:23,887 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:23,889 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-13 04:55:23,889 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:23,891 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-13 04:55:23,891 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:23,928 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-13 04:55:23,928 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:23,967 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-13 04:55:23,967 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:24,012 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-13 04:55:24,013 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-13 04:55:24,064 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-13 04:55:24,064 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-13 04:55:24,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-13 04:55:24,169 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-13 04:55:24,169 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:60, output treesize:86 [2018-04-13 04:55:24,246 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-13 04:55:24,247 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:55:24,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 04:55:24,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 04:55:24,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 04:55:24,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-04-13 04:55:24,247 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 19 states. [2018-04-13 04:55:24,618 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 72 DAG size of output 62 [2018-04-13 04:55:25,326 WARN L151 SmtUtils]: Spent 487ms on a formula simplification. DAG size of input: 90 DAG size of output 75 [2018-04-13 04:55:30,440 WARN L151 SmtUtils]: Spent 4103ms on a formula simplification. DAG size of input: 78 DAG size of output 78 [2018-04-13 04:55:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:31,560 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-04-13 04:55:31,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 04:55:31,560 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-04-13 04:55:31,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:31,561 INFO L225 Difference]: With dead ends: 117 [2018-04-13 04:55:31,561 INFO L226 Difference]: Without dead ends: 117 [2018-04-13 04:55:31,561 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=351, Invalid=1455, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 04:55:31,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-04-13 04:55:31,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 58. [2018-04-13 04:55:31,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-04-13 04:55:31,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-04-13 04:55:31,563 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 49 [2018-04-13 04:55:31,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:31,563 INFO L459 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-04-13 04:55:31,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 04:55:31,563 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-04-13 04:55:31,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-13 04:55:31,563 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:55:31,563 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-13 04:55:31,563 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-13 04:55:31,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1291252055, now seen corresponding path program 3 times [2018-04-13 04:55:31,564 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:55:31,564 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:55:31,564 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:31,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:55:31,564 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:55:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:55:31,570 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:55:31,573 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:55:31,573 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:55:31,574 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:55:31,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:55:31,593 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 04:55:31,593 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:55:31,597 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:55:31,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 6 treesize of output 5 [2018-04-13 04:55:31,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:31,609 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-13 04:55:31,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:31,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:31,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:55:31,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:31,628 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-13 04:55:31,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:31,636 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:31,636 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:55:31,637 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-13 04:55:31,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:31,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:31,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-13 04:55:31,659 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-13 04:55:31,662 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-13 04:55:31,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:31,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:31,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:31,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-13 04:55:31,680 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-13 04:55:31,681 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-13 04:55:31,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:31,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:55:31,689 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-13 04:55:31,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-04-13 04:55:31,734 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-13 04:55:31,742 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-13 04:55:31,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:55:31,748 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-13 04:55:31,748 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:55:31,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:55:31,757 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-13 04:55:31,757 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-04-13 04:55:31,810 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-13 04:55:31,811 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:55:31,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 04:55:31,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 04:55:31,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 04:55:31,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-04-13 04:55:31,812 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 13 states. [2018-04-13 04:55:32,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:55:32,200 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-04-13 04:55:32,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 04:55:32,200 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-04-13 04:55:32,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:55:32,200 INFO L225 Difference]: With dead ends: 57 [2018-04-13 04:55:32,201 INFO L226 Difference]: Without dead ends: 0 [2018-04-13 04:55:32,201 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2018-04-13 04:55:32,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-13 04:55:32,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-13 04:55:32,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-13 04:55:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-13 04:55:32,201 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2018-04-13 04:55:32,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:55:32,201 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-13 04:55:32,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 04:55:32,201 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-13 04:55:32,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-13 04:55:32,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 04:55:32 BoogieIcfgContainer [2018-04-13 04:55:32,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 04:55:32,205 INFO L168 Benchmark]: Toolchain (without parser) took 32799.48 ms. Allocated memory was 401.1 MB in the beginning and 856.7 MB in the end (delta: 455.6 MB). Free memory was 337.5 MB in the beginning and 595.7 MB in the end (delta: -258.2 MB). Peak memory consumption was 197.4 MB. Max. memory is 5.3 GB. [2018-04-13 04:55:32,206 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 401.1 MB. Free memory is still 362.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 04:55:32,206 INFO L168 Benchmark]: CACSL2BoogieTranslator took 227.17 ms. Allocated memory is still 401.1 MB. Free memory was 337.5 MB in the beginning and 313.7 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-13 04:55:32,206 INFO L168 Benchmark]: Boogie Preprocessor took 37.94 ms. Allocated memory is still 401.1 MB. Free memory was 313.7 MB in the beginning and 311.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-13 04:55:32,206 INFO L168 Benchmark]: RCFGBuilder took 362.02 ms. Allocated memory was 401.1 MB in the beginning and 607.1 MB in the end (delta: 206.0 MB). Free memory was 311.1 MB in the beginning and 541.5 MB in the end (delta: -230.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 5.3 GB. [2018-04-13 04:55:32,206 INFO L168 Benchmark]: TraceAbstraction took 32169.67 ms. Allocated memory was 607.1 MB in the beginning and 856.7 MB in the end (delta: 249.6 MB). Free memory was 541.5 MB in the beginning and 595.7 MB in the end (delta: -54.2 MB). Peak memory consumption was 195.3 MB. Max. memory is 5.3 GB. [2018-04-13 04:55:32,207 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.14 ms. Allocated memory is still 401.1 MB. Free memory is still 362.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 227.17 ms. Allocated memory is still 401.1 MB. Free memory was 337.5 MB in the beginning and 313.7 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.94 ms. Allocated memory is still 401.1 MB. Free memory was 313.7 MB in the beginning and 311.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 362.02 ms. Allocated memory was 401.1 MB in the beginning and 607.1 MB in the end (delta: 206.0 MB). Free memory was 311.1 MB in the beginning and 541.5 MB in the end (delta: -230.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 32169.67 ms. Allocated memory was 607.1 MB in the beginning and 856.7 MB in the end (delta: 249.6 MB). Free memory was 541.5 MB in the beginning and 595.7 MB in the end (delta: -54.2 MB). Peak memory consumption was 195.3 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.1s OverallTime, 27 OverallIterations, 4 TraceHistogramMax, 20.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 957 SDtfs, 2576 SDslu, 4110 SDs, 0 SdLazy, 5082 SolverSat, 301 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 837 GetRequests, 377 SyntacticMatches, 12 SemanticMatches, 448 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1693 ImplicationChecksByTransitivity, 23.8s 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, 452 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.3s 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-13_04-55-32-212.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-13_04-55-32-212.csv Received shutdown request...