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/memsafety-ext2/length_test03_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-12 06:40:42,054 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 06:40:42,055 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 06:40:42,067 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 06:40:42,067 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 06:40:42,068 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 06:40:42,069 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 06:40:42,070 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 06:40:42,071 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 06:40:42,072 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 06:40:42,073 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 06:40:42,073 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 06:40:42,073 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 06:40:42,074 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 06:40:42,075 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 06:40:42,076 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 06:40:42,078 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 06:40:42,079 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 06:40:42,080 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 06:40:42,081 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 06:40:42,082 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 06:40:42,083 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 06:40:42,083 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 06:40:42,084 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 06:40:42,084 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 06:40:42,085 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 06:40:42,085 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 06:40:42,086 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 06:40:42,086 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 06:40:42,086 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 06:40:42,087 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 06:40:42,087 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-12 06:40:42,108 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 06:40:42,108 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 06:40:42,109 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-12 06:40:42,110 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-12 06:40:42,110 INFO L133 SettingsManager]: * Use SBE=true [2018-04-12 06:40:42,110 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 06:40:42,110 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 06:40:42,110 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 06:40:42,110 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 06:40:42,110 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 06:40:42,110 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 06:40:42,110 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 06:40:42,111 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-12 06:40:42,111 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 06:40:42,111 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 06:40:42,111 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 06:40:42,111 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-12 06:40:42,111 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-12 06:40:42,111 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 06:40:42,111 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 06:40:42,111 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 06:40:42,111 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-12 06:40:42,112 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-12 06:40:42,112 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-12 06:40:42,136 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 06:40:42,143 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 06:40:42,146 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 06:40:42,146 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 06:40:42,147 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 06:40:42,147 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,426 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG85df3c739 [2018-04-12 06:40:42,577 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 06:40:42,577 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 06:40:42,577 INFO L168 CDTParser]: Scanning length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,585 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 06:40:42,585 INFO L215 ultiparseSymbolTable]: [2018-04-12 06:40:42,585 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 06:40:42,585 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flength_test___true_valid_memsafety_i__append ('append') in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,585 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flength_test___true_valid_memsafety_i____bswap_64 ('__bswap_64') in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,585 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,585 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flength_test___true_valid_memsafety_i____bswap_32 ('__bswap_32') in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,586 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 06:40:42,586 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__nlink_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,586 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fd_mask in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,586 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__wchar_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,586 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_attr_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,586 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____sig_atomic_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,586 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_once_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,586 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_int8_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,586 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__dev_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,586 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_condattr_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,586 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__id_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,587 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____u_int in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,587 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,587 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____clock_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,587 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__timer_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,587 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__clockid_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,587 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__fsid_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,587 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____int8_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,587 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_spinlock_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,587 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____nlink_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,587 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____sigset_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,587 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__suseconds_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,587 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____blkcnt64_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,587 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____uint64_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,587 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__gid_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,587 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__ssize_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,587 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__fd_mask in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,587 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_short in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,588 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__uint in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,588 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_long in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,588 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____uid_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,588 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pid_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,588 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fsword_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,588 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____ino64_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,588 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____uint16_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,588 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__int8_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,588 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__daddr_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,588 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__clock_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,588 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____syscall_slong_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,589 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____loff_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,589 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____blkcnt_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,589 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__register_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,589 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__int64_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,589 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____daddr_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,589 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fsfilcnt_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,589 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_barrierattr_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,589 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__ldiv_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,589 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_quad_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,589 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__ushort in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,589 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_mutex_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,590 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____time_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,590 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_int64_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,590 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____useconds_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,590 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fsfilcnt64_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,590 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__loff_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,590 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____key_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,590 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__ino_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,590 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____uint8_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,590 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____int64_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,590 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____qaddr_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,590 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__int16_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,591 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__blksize_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,591 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____u_char in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,591 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____blksize_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,591 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_key_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,591 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_rwlock_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,591 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__lldiv_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,591 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____dev_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,591 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fsblkcnt_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,591 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__uid_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,591 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____rlim64_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,591 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____uint32_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,591 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__fsblkcnt_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,592 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__time_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,592 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__div_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,592 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____int32_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,592 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____id_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,592 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____syscall_ulong_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,592 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__ulong in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,592 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__mode_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,592 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__sigset_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,592 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____pthread_slist_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,592 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_int32_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,592 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____u_short in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,592 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__caddr_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,593 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__key_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,593 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_rwlockattr_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,593 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____caddr_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,593 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__fd_set in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,593 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____off_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,593 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____quad_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,593 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____mode_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,593 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__fsfilcnt_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,593 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fsid_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,593 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____gid_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,593 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__int32_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,593 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____pid_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,593 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____ssize_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,593 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____socklen_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,593 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_mutexattr_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,593 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____ino_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,593 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__off_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,593 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____timer_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,593 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____u_long in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_cond_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____int16_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__size_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____intptr_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_int16_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__blkcnt_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____rlim_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____clockid_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_char in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_int in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__quad_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fsblkcnt64_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____off64_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____suseconds_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_barrier_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____u_quad_t in length_test03_true-valid-memsafety.i [2018-04-12 06:40:42,624 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG85df3c739 [2018-04-12 06:40:42,626 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 06:40:42,627 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 06:40:42,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 06:40:42,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 06:40:42,631 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 06:40:42,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 06:40:42" (1/1) ... [2018-04-12 06:40:42,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@314e0fe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:40:42, skipping insertion in model container [2018-04-12 06:40:42,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 06:40:42" (1/1) ... [2018-04-12 06:40:42,644 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 06:40:42,669 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 06:40:42,814 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 06:40:42,852 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 06:40:42,858 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 119 non ball SCCs. Number of states in SCCs 119. [2018-04-12 06:40:42,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:40:42 WrapperNode [2018-04-12 06:40:42,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 06:40:42,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 06:40:42,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 06:40:42,896 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 06:40:42,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:40:42" (1/1) ... [2018-04-12 06:40:42,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:40:42" (1/1) ... [2018-04-12 06:40:42,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:40:42" (1/1) ... [2018-04-12 06:40:42,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:40:42" (1/1) ... [2018-04-12 06:40:42,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:40:42" (1/1) ... [2018-04-12 06:40:42,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:40:42" (1/1) ... [2018-04-12 06:40:42,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:40:42" (1/1) ... [2018-04-12 06:40:42,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 06:40:42,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 06:40:42,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 06:40:42,943 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 06:40:42,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:40:42" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 06:40:43,028 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 06:40:43,028 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 06:40:43,029 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___true_valid_memsafety_i____bswap_32 [2018-04-12 06:40:43,029 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___true_valid_memsafety_i____bswap_64 [2018-04-12 06:40:43,029 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___true_valid_memsafety_i__append [2018-04-12 06:40:43,029 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 06:40:43,029 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-12 06:40:43,029 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-12 06:40:43,029 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-12 06:40:43,029 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-12 06:40:43,029 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-12 06:40:43,029 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-12 06:40:43,029 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-12 06:40:43,029 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-12 06:40:43,029 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-12 06:40:43,030 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-12 06:40:43,030 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-12 06:40:43,030 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-12 06:40:43,030 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-12 06:40:43,030 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-12 06:40:43,030 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-12 06:40:43,030 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-12 06:40:43,030 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-12 06:40:43,031 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___true_valid_memsafety_i____bswap_32 [2018-04-12 06:40:43,031 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___true_valid_memsafety_i____bswap_64 [2018-04-12 06:40:43,031 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-12 06:40:43,031 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-12 06:40:43,031 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-12 06:40:43,031 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-12 06:40:43,031 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-12 06:40:43,031 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-12 06:40:43,031 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-12 06:40:43,032 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-12 06:40:43,032 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-12 06:40:43,032 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-12 06:40:43,032 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-12 06:40:43,032 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-12 06:40:43,032 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-12 06:40:43,032 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-12 06:40:43,032 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-12 06:40:43,032 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-12 06:40:43,032 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-12 06:40:43,033 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-12 06:40:43,033 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-12 06:40:43,033 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-12 06:40:43,033 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-12 06:40:43,033 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-12 06:40:43,033 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-12 06:40:43,033 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-12 06:40:43,033 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-12 06:40:43,033 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-12 06:40:43,033 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-12 06:40:43,034 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-12 06:40:43,034 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-12 06:40:43,034 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-12 06:40:43,034 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-12 06:40:43,034 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-12 06:40:43,034 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-12 06:40:43,034 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-12 06:40:43,034 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-12 06:40:43,034 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-12 06:40:43,035 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-12 06:40:43,035 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-12 06:40:43,035 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-12 06:40:43,035 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-12 06:40:43,035 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-12 06:40:43,035 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-12 06:40:43,035 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-12 06:40:43,035 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-12 06:40:43,035 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-12 06:40:43,035 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-12 06:40:43,035 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-12 06:40:43,036 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-12 06:40:43,036 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-12 06:40:43,036 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-12 06:40:43,036 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-12 06:40:43,036 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-12 06:40:43,036 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-12 06:40:43,036 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-12 06:40:43,036 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-12 06:40:43,036 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-12 06:40:43,036 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-12 06:40:43,036 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-12 06:40:43,037 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-12 06:40:43,037 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-12 06:40:43,037 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-12 06:40:43,037 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-12 06:40:43,037 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-12 06:40:43,037 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-12 06:40:43,037 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-12 06:40:43,037 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-12 06:40:43,037 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-12 06:40:43,037 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-12 06:40:43,037 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-12 06:40:43,038 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-12 06:40:43,038 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-12 06:40:43,038 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-12 06:40:43,038 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-12 06:40:43,038 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-12 06:40:43,038 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-12 06:40:43,038 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-12 06:40:43,038 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-12 06:40:43,038 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-12 06:40:43,038 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-12 06:40:43,039 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-12 06:40:43,039 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-12 06:40:43,039 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-12 06:40:43,039 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-12 06:40:43,039 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-12 06:40:43,039 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-12 06:40:43,039 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-12 06:40:43,039 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-12 06:40:43,039 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-04-12 06:40:43,039 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-12 06:40:43,039 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___true_valid_memsafety_i__append [2018-04-12 06:40:43,040 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-12 06:40:43,040 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-12 06:40:43,040 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-12 06:40:43,040 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-12 06:40:43,040 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 06:40:43,040 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-12 06:40:43,040 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 06:40:43,040 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 06:40:43,040 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-12 06:40:43,040 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-12 06:40:43,451 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 06:40:43,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 06:40:43 BoogieIcfgContainer [2018-04-12 06:40:43,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 06:40:43,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 06:40:43,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 06:40:43,455 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 06:40:43,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 06:40:42" (1/3) ... [2018-04-12 06:40:43,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4da4d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 06:40:43, skipping insertion in model container [2018-04-12 06:40:43,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:40:42" (2/3) ... [2018-04-12 06:40:43,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4da4d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 06:40:43, skipping insertion in model container [2018-04-12 06:40:43,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 06:40:43" (3/3) ... [2018-04-12 06:40:43,458 INFO L107 eAbstractionObserver]: Analyzing ICFG length_test03_true-valid-memsafety.i [2018-04-12 06:40:43,465 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-12 06:40:43,470 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-04-12 06:40:43,498 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 06:40:43,499 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 06:40:43,499 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-12 06:40:43,499 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-12 06:40:43,499 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-12 06:40:43,499 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 06:40:43,499 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 06:40:43,499 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 06:40:43,499 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 06:40:43,500 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 06:40:43,508 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2018-04-12 06:40:43,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 06:40:43,513 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:40:43,513 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:40:43,513 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:40:43,516 INFO L82 PathProgramCache]: Analyzing trace with hash 785922242, now seen corresponding path program 1 times [2018-04-12 06:40:43,518 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:40:43,518 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:40:43,549 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:43,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:40:43,549 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:40:43,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:40:43,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:40:43,622 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:40:43,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 06:40:43,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 06:40:43,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 06:40:43,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 06:40:43,637 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 4 states. [2018-04-12 06:40:43,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:40:43,815 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2018-04-12 06:40:43,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 06:40:43,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 06:40:43,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:40:43,825 INFO L225 Difference]: With dead ends: 175 [2018-04-12 06:40:43,826 INFO L226 Difference]: Without dead ends: 172 [2018-04-12 06:40:43,827 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 06:40:43,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-12 06:40:43,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 134. [2018-04-12 06:40:43,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-12 06:40:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2018-04-12 06:40:43,863 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 140 transitions. Word has length 8 [2018-04-12 06:40:43,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:40:43,863 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 140 transitions. [2018-04-12 06:40:43,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 06:40:43,863 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2018-04-12 06:40:43,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 06:40:43,864 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:40:43,864 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:40:43,864 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:40:43,864 INFO L82 PathProgramCache]: Analyzing trace with hash 785922243, now seen corresponding path program 1 times [2018-04-12 06:40:43,864 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:40:43,864 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:40:43,865 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:43,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:40:43,865 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:40:43,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:40:43,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:40:43,922 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:40:43,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 06:40:43,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 06:40:43,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 06:40:43,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 06:40:43,923 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. Second operand 4 states. [2018-04-12 06:40:44,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:40:44,022 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2018-04-12 06:40:44,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 06:40:44,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 06:40:44,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:40:44,023 INFO L225 Difference]: With dead ends: 134 [2018-04-12 06:40:44,023 INFO L226 Difference]: Without dead ends: 134 [2018-04-12 06:40:44,024 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 06:40:44,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-12 06:40:44,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-04-12 06:40:44,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-04-12 06:40:44,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 138 transitions. [2018-04-12 06:40:44,028 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 138 transitions. Word has length 8 [2018-04-12 06:40:44,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:40:44,029 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 138 transitions. [2018-04-12 06:40:44,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 06:40:44,029 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 138 transitions. [2018-04-12 06:40:44,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-12 06:40:44,029 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:40:44,029 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:40:44,029 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:40:44,029 INFO L82 PathProgramCache]: Analyzing trace with hash 580924999, now seen corresponding path program 1 times [2018-04-12 06:40:44,029 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:40:44,030 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:40:44,030 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:44,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:40:44,030 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:40:44,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:40:44,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:40:44,075 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:40:44,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 06:40:44,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 06:40:44,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 06:40:44,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 06:40:44,075 INFO L87 Difference]: Start difference. First operand 132 states and 138 transitions. Second operand 4 states. [2018-04-12 06:40:44,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:40:44,149 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2018-04-12 06:40:44,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 06:40:44,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-12 06:40:44,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:40:44,150 INFO L225 Difference]: With dead ends: 132 [2018-04-12 06:40:44,150 INFO L226 Difference]: Without dead ends: 132 [2018-04-12 06:40:44,150 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 06:40:44,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-12 06:40:44,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-04-12 06:40:44,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-12 06:40:44,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2018-04-12 06:40:44,154 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 12 [2018-04-12 06:40:44,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:40:44,154 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2018-04-12 06:40:44,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 06:40:44,154 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2018-04-12 06:40:44,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-12 06:40:44,154 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:40:44,154 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:40:44,155 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:40:44,155 INFO L82 PathProgramCache]: Analyzing trace with hash 580924998, now seen corresponding path program 1 times [2018-04-12 06:40:44,155 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:40:44,155 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:40:44,155 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:44,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:40:44,155 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:40:44,165 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:40:44,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:40:44,183 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:40:44,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 06:40:44,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 06:40:44,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 06:40:44,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 06:40:44,184 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand 4 states. [2018-04-12 06:40:44,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:40:44,263 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2018-04-12 06:40:44,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 06:40:44,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-12 06:40:44,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:40:44,264 INFO L225 Difference]: With dead ends: 146 [2018-04-12 06:40:44,264 INFO L226 Difference]: Without dead ends: 146 [2018-04-12 06:40:44,264 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 06:40:44,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-04-12 06:40:44,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 133. [2018-04-12 06:40:44,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-12 06:40:44,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-04-12 06:40:44,270 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 12 [2018-04-12 06:40:44,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:40:44,270 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-04-12 06:40:44,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 06:40:44,270 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-04-12 06:40:44,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-12 06:40:44,270 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:40:44,270 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] [2018-04-12 06:40:44,271 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:40:44,271 INFO L82 PathProgramCache]: Analyzing trace with hash 606155154, now seen corresponding path program 1 times [2018-04-12 06:40:44,271 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:40:44,271 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:40:44,271 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:44,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:40:44,271 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:40:44,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:40:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:40:44,305 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:40:44,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 06:40:44,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 06:40:44,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 06:40:44,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 06:40:44,306 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 4 states. [2018-04-12 06:40:44,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:40:44,380 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-04-12 06:40:44,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 06:40:44,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-12 06:40:44,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:40:44,381 INFO L225 Difference]: With dead ends: 128 [2018-04-12 06:40:44,381 INFO L226 Difference]: Without dead ends: 128 [2018-04-12 06:40:44,381 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 06:40:44,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-12 06:40:44,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-04-12 06:40:44,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-12 06:40:44,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-04-12 06:40:44,385 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 20 [2018-04-12 06:40:44,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:40:44,386 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-04-12 06:40:44,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 06:40:44,386 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-04-12 06:40:44,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-12 06:40:44,386 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:40:44,387 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] [2018-04-12 06:40:44,387 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:40:44,387 INFO L82 PathProgramCache]: Analyzing trace with hash 606155155, now seen corresponding path program 1 times [2018-04-12 06:40:44,387 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:40:44,387 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:40:44,388 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:44,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:40:44,388 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:40:44,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:40:44,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:40:44,430 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:40:44,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 06:40:44,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 06:40:44,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 06:40:44,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 06:40:44,430 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 4 states. [2018-04-12 06:40:44,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:40:44,475 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-04-12 06:40:44,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 06:40:44,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-12 06:40:44,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:40:44,475 INFO L225 Difference]: With dead ends: 123 [2018-04-12 06:40:44,476 INFO L226 Difference]: Without dead ends: 123 [2018-04-12 06:40:44,476 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 06:40:44,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-12 06:40:44,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-04-12 06:40:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-12 06:40:44,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-04-12 06:40:44,480 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 20 [2018-04-12 06:40:44,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:40:44,480 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-04-12 06:40:44,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 06:40:44,480 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-04-12 06:40:44,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-12 06:40:44,480 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:40:44,480 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:40:44,480 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:40:44,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1610940695, now seen corresponding path program 1 times [2018-04-12 06:40:44,480 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:40:44,481 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:40:44,481 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:44,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:40:44,481 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:40:44,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:40:44,499 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:40:44,499 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:40:44,499 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:40:44,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:40:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:40:44,541 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:40:44,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:40:44,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:44,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:44,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-12 06:40:44,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:44,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:44,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 06:40:44,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:44,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:40:44,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-12 06:40:44,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-04-12 06:40:44,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:44,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:40:44,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-04-12 06:40:44,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:40:44,633 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:40:44,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 06:40:44,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 06:40:44,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 06:40:44,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-12 06:40:44,634 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 7 states. [2018-04-12 06:40:44,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:40:44,881 INFO L93 Difference]: Finished difference Result 238 states and 254 transitions. [2018-04-12 06:40:44,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 06:40:44,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-04-12 06:40:44,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:40:44,882 INFO L225 Difference]: With dead ends: 238 [2018-04-12 06:40:44,882 INFO L226 Difference]: Without dead ends: 238 [2018-04-12 06:40:44,882 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-12 06:40:44,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-04-12 06:40:44,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 150. [2018-04-12 06:40:44,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-12 06:40:44,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 170 transitions. [2018-04-12 06:40:44,886 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 170 transitions. Word has length 21 [2018-04-12 06:40:44,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:40:44,886 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 170 transitions. [2018-04-12 06:40:44,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 06:40:44,886 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2018-04-12 06:40:44,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-12 06:40:44,887 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:40:44,887 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:40:44,887 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:40:44,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1610940696, now seen corresponding path program 1 times [2018-04-12 06:40:44,887 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:40:44,887 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:40:44,888 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:44,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:40:44,888 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:40:44,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:40:44,908 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:40:44,909 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:40:44,909 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:40:44,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:40:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:40:44,937 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:40:44,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:40:44,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:44,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:40:44,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:44,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:44,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-12 06:40:44,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:44,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-12 06:40:44,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:44,993 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:44,994 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:44,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 06:40:44,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:45,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:40:45,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-04-12 06:40:45,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:45,090 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 4 case distinctions, treesize of input 17 treesize of output 28 [2018-04-12 06:40:45,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-12 06:40:45,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-12 06:40:45,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:61 [2018-04-12 06:40:45,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:40:45,172 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:40:45,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-12 06:40:45,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 06:40:45,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 06:40:45,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-04-12 06:40:45,173 INFO L87 Difference]: Start difference. First operand 150 states and 170 transitions. Second operand 9 states. [2018-04-12 06:40:45,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:40:45,462 INFO L93 Difference]: Finished difference Result 178 states and 200 transitions. [2018-04-12 06:40:45,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 06:40:45,462 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-04-12 06:40:45,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:40:45,463 INFO L225 Difference]: With dead ends: 178 [2018-04-12 06:40:45,463 INFO L226 Difference]: Without dead ends: 178 [2018-04-12 06:40:45,463 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-04-12 06:40:45,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-12 06:40:45,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2018-04-12 06:40:45,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-12 06:40:45,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 200 transitions. [2018-04-12 06:40:45,467 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 200 transitions. Word has length 21 [2018-04-12 06:40:45,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:40:45,468 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 200 transitions. [2018-04-12 06:40:45,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 06:40:45,468 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 200 transitions. [2018-04-12 06:40:45,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-12 06:40:45,468 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:40:45,468 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, 1, 1] [2018-04-12 06:40:45,469 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:40:45,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1221998067, now seen corresponding path program 1 times [2018-04-12 06:40:45,469 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:40:45,469 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:40:45,469 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:45,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:40:45,470 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:40:45,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:40:45,489 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:40:45,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:40:45,489 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:40:45,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:40:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:40:45,537 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:40:45,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:40:45,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:45,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:45,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 06:40:45,574 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 11 treesize of output 8 [2018-04-12 06:40:45,576 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 8 treesize of output 7 [2018-04-12 06:40:45,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:45,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:45,589 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 11 treesize of output 8 [2018-04-12 06:40:45,591 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 8 treesize of output 7 [2018-04-12 06:40:45,591 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:45,592 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:45,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:45,597 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-12 06:40:45,607 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 21 treesize of output 16 [2018-04-12 06:40:45,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:45,610 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 16 treesize of output 23 [2018-04-12 06:40:45,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:45,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:45,623 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 21 treesize of output 16 [2018-04-12 06:40:45,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:45,625 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 16 treesize of output 23 [2018-04-12 06:40:45,625 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:45,632 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:45,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:45,639 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-04-12 06:40:45,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:45,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:45,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 06:40:45,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:45,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:45,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:56 [2018-04-12 06:40:45,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-12 06:40:45,702 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 8 treesize of output 7 [2018-04-12 06:40:45,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:45,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:45,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-12 06:40:45,722 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 8 treesize of output 7 [2018-04-12 06:40:45,722 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:45,727 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:45,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:45,738 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:70 [2018-04-12 06:40:45,769 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 35 treesize of output 34 [2018-04-12 06:40:45,772 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 14 treesize of output 15 [2018-04-12 06:40:45,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:45,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:45,794 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 35 treesize of output 34 [2018-04-12 06:40:45,796 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 14 treesize of output 15 [2018-04-12 06:40:45,796 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:45,801 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:45,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:40:45,824 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:89, output treesize:81 [2018-04-12 06:40:45,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:45,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:45,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:45,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-12 06:40:45,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:45,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:40:45,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:89, output treesize:82 [2018-04-12 06:40:46,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-04-12 06:40:46,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:46,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:46,026 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:40:46,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-04-12 06:40:46,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:46,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:46,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-12 06:40:46,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:99, output treesize:62 [2018-04-12 06:40:46,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:40:46,114 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:40:46,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-12 06:40:46,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-12 06:40:46,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-12 06:40:46,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=193, Unknown=2, NotChecked=0, Total=240 [2018-04-12 06:40:46,115 INFO L87 Difference]: Start difference. First operand 176 states and 200 transitions. Second operand 16 states. [2018-04-12 06:40:46,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:40:46,998 INFO L93 Difference]: Finished difference Result 178 states and 199 transitions. [2018-04-12 06:40:46,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-12 06:40:46,999 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-04-12 06:40:46,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:40:46,999 INFO L225 Difference]: With dead ends: 178 [2018-04-12 06:40:46,999 INFO L226 Difference]: Without dead ends: 178 [2018-04-12 06:40:47,000 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=155, Invalid=597, Unknown=4, NotChecked=0, Total=756 [2018-04-12 06:40:47,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-12 06:40:47,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2018-04-12 06:40:47,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-12 06:40:47,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 199 transitions. [2018-04-12 06:40:47,008 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 199 transitions. Word has length 30 [2018-04-12 06:40:47,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:40:47,008 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 199 transitions. [2018-04-12 06:40:47,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-12 06:40:47,008 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 199 transitions. [2018-04-12 06:40:47,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-12 06:40:47,009 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:40:47,009 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, 1, 1, 1, 1] [2018-04-12 06:40:47,009 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:40:47,009 INFO L82 PathProgramCache]: Analyzing trace with hash 547197936, now seen corresponding path program 1 times [2018-04-12 06:40:47,009 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:40:47,009 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:40:47,010 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:47,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:40:47,010 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:40:47,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:40:47,027 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:40:47,027 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:40:47,027 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:40:47,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:40:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:40:47,063 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:40:47,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:40:47,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:47,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:47,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-12 06:40:47,083 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 13 treesize of output 10 [2018-04-12 06:40:47,085 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 10 treesize of output 9 [2018-04-12 06:40:47,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:47,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:47,097 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 13 treesize of output 10 [2018-04-12 06:40:47,099 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 10 treesize of output 9 [2018-04-12 06:40:47,099 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:47,100 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:47,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:47,105 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2018-04-12 06:40:47,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:47,116 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:47,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 06:40:47,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:47,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:47,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:33 [2018-04-12 06:40:47,153 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 21 treesize of output 22 [2018-04-12 06:40:47,155 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 8 treesize of output 7 [2018-04-12 06:40:47,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:47,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:47,175 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 21 treesize of output 22 [2018-04-12 06:40:47,177 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 8 treesize of output 7 [2018-04-12 06:40:47,177 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:47,181 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:47,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:47,190 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:55, output treesize:47 [2018-04-12 06:40:47,217 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 30 treesize of output 29 [2018-04-12 06:40:47,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:47,220 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 16 treesize of output 23 [2018-04-12 06:40:47,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:47,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:47,247 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 30 treesize of output 29 [2018-04-12 06:40:47,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:47,250 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 16 treesize of output 23 [2018-04-12 06:40:47,251 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:47,258 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:47,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:40:47,271 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:73, output treesize:65 [2018-04-12 06:40:47,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:47,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:47,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:47,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-04-12 06:40:47,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:47,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:40:47,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:70, output treesize:63 [2018-04-12 06:40:47,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:40:47,481 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:40:47,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-04-12 06:40:47,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-12 06:40:47,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-12 06:40:47,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-04-12 06:40:47,482 INFO L87 Difference]: Start difference. First operand 176 states and 199 transitions. Second operand 15 states. [2018-04-12 06:40:47,735 WARN L148 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-12 06:40:48,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:40:48,242 INFO L93 Difference]: Finished difference Result 203 states and 225 transitions. [2018-04-12 06:40:48,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-12 06:40:48,242 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-04-12 06:40:48,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:40:48,243 INFO L225 Difference]: With dead ends: 203 [2018-04-12 06:40:48,243 INFO L226 Difference]: Without dead ends: 203 [2018-04-12 06:40:48,244 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2018-04-12 06:40:48,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-04-12 06:40:48,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 168. [2018-04-12 06:40:48,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-12 06:40:48,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 188 transitions. [2018-04-12 06:40:48,246 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 188 transitions. Word has length 32 [2018-04-12 06:40:48,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:40:48,246 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 188 transitions. [2018-04-12 06:40:48,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-12 06:40:48,246 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 188 transitions. [2018-04-12 06:40:48,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-12 06:40:48,247 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:40:48,247 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:40:48,247 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:40:48,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1510794234, now seen corresponding path program 1 times [2018-04-12 06:40:48,247 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:40:48,247 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:40:48,248 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:48,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:40:48,248 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:40:48,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:40:48,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:40:48,281 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:40:48,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 06:40:48,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 06:40:48,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 06:40:48,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 06:40:48,282 INFO L87 Difference]: Start difference. First operand 168 states and 188 transitions. Second operand 3 states. [2018-04-12 06:40:48,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:40:48,289 INFO L93 Difference]: Finished difference Result 177 states and 194 transitions. [2018-04-12 06:40:48,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 06:40:48,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-04-12 06:40:48,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:40:48,290 INFO L225 Difference]: With dead ends: 177 [2018-04-12 06:40:48,290 INFO L226 Difference]: Without dead ends: 177 [2018-04-12 06:40:48,291 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 06:40:48,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-12 06:40:48,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 164. [2018-04-12 06:40:48,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-12 06:40:48,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 180 transitions. [2018-04-12 06:40:48,293 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 180 transitions. Word has length 38 [2018-04-12 06:40:48,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:40:48,294 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 180 transitions. [2018-04-12 06:40:48,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 06:40:48,294 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 180 transitions. [2018-04-12 06:40:48,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-12 06:40:48,294 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:40:48,295 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:40:48,295 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:40:48,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1650874349, now seen corresponding path program 1 times [2018-04-12 06:40:48,295 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:40:48,295 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:40:48,296 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:48,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:40:48,296 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:40:48,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:40:48,310 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:40:48,310 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:40:48,310 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:40:48,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:40:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:40:48,339 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:40:48,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:48,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:48,401 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-12 06:40:48,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:48,410 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 14 treesize of output 17 [2018-04-12 06:40:48,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:48,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:40:48,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-12 06:40:48,437 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:40:48,437 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:40:48,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-12 06:40:48,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 06:40:48,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 06:40:48,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-12 06:40:48,438 INFO L87 Difference]: Start difference. First operand 164 states and 180 transitions. Second operand 10 states. [2018-04-12 06:40:48,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:40:48,783 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2018-04-12 06:40:48,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 06:40:48,859 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-04-12 06:40:48,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:40:48,860 INFO L225 Difference]: With dead ends: 177 [2018-04-12 06:40:48,860 INFO L226 Difference]: Without dead ends: 177 [2018-04-12 06:40:48,860 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-04-12 06:40:48,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-12 06:40:48,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 164. [2018-04-12 06:40:48,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-12 06:40:48,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2018-04-12 06:40:48,863 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 41 [2018-04-12 06:40:48,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:40:48,864 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2018-04-12 06:40:48,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 06:40:48,864 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2018-04-12 06:40:48,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-12 06:40:48,864 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:40:48,864 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:40:48,864 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:40:48,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1920567715, now seen corresponding path program 1 times [2018-04-12 06:40:48,865 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:40:48,865 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:40:48,865 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:48,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:40:48,866 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:40:48,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:40:48,879 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:40:48,879 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:40:48,879 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:40:48,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:40:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:40:48,901 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:40:48,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:40:48,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:48,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:48,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-12 06:40:48,927 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base|)) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| 1)))) is different from true [2018-04-12 06:40:48,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:48,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:48,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 06:40:48,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:48,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:40:48,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-12 06:40:48,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-04-12 06:40:48,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:48,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:40:48,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-04-12 06:40:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-04-12 06:40:48,980 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:40:48,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-12 06:40:48,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 06:40:48,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 06:40:48,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2018-04-12 06:40:48,981 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 9 states. [2018-04-12 06:40:49,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:40:49,244 INFO L93 Difference]: Finished difference Result 275 states and 300 transitions. [2018-04-12 06:40:49,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 06:40:49,245 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-04-12 06:40:49,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:40:49,246 INFO L225 Difference]: With dead ends: 275 [2018-04-12 06:40:49,246 INFO L226 Difference]: Without dead ends: 275 [2018-04-12 06:40:49,246 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2018-04-12 06:40:49,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-12 06:40:49,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 213. [2018-04-12 06:40:49,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-12 06:40:49,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 244 transitions. [2018-04-12 06:40:49,250 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 244 transitions. Word has length 43 [2018-04-12 06:40:49,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:40:49,250 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 244 transitions. [2018-04-12 06:40:49,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 06:40:49,250 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 244 transitions. [2018-04-12 06:40:49,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-12 06:40:49,251 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:40:49,251 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:40:49,251 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:40:49,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1920567716, now seen corresponding path program 1 times [2018-04-12 06:40:49,251 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:40:49,251 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:40:49,252 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:49,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:40:49,252 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:40:49,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:40:49,265 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:40:49,266 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:40:49,266 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:40:49,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:40:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:40:49,293 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:40:49,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:40:49,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:49,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:40:49,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:49,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:49,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-12 06:40:49,329 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| Int)) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| 9)) (= 0 (select |c_old(#valid)| |__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base|)))) is different from true [2018-04-12 06:40:49,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:49,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:49,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-12 06:40:49,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:49,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:49,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:49,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 06:40:49,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:49,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:40:49,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-12 06:40:49,404 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:49,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:49,412 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 2 case distinctions, treesize of input 17 treesize of output 24 [2018-04-12 06:40:49,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-12 06:40:49,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-12 06:40:49,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:44 [2018-04-12 06:40:49,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-04-12 06:40:49,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:40:49,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-12 06:40:49,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 06:40:49,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 06:40:49,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2018-04-12 06:40:49,481 INFO L87 Difference]: Start difference. First operand 213 states and 244 transitions. Second operand 11 states. [2018-04-12 06:40:49,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:40:49,845 INFO L93 Difference]: Finished difference Result 268 states and 313 transitions. [2018-04-12 06:40:49,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 06:40:49,845 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-04-12 06:40:49,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:40:49,848 INFO L225 Difference]: With dead ends: 268 [2018-04-12 06:40:49,848 INFO L226 Difference]: Without dead ends: 268 [2018-04-12 06:40:49,848 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=168, Unknown=1, NotChecked=26, Total=240 [2018-04-12 06:40:49,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-04-12 06:40:49,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 243. [2018-04-12 06:40:49,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-12 06:40:49,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 279 transitions. [2018-04-12 06:40:49,854 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 279 transitions. Word has length 43 [2018-04-12 06:40:49,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:40:49,854 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 279 transitions. [2018-04-12 06:40:49,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 06:40:49,854 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 279 transitions. [2018-04-12 06:40:49,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-12 06:40:49,855 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:40:49,855 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:40:49,855 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:40:49,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1552822926, now seen corresponding path program 1 times [2018-04-12 06:40:49,856 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:40:49,856 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:40:49,856 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:49,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:40:49,856 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:40:49,874 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:40:49,879 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:40:49,880 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:40:49,880 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:40:49,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:40:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:40:49,936 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:40:49,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:40:49,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:49,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:49,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 06:40:49,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:49,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:49,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 06:40:49,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:49,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:40:49,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2018-04-12 06:40:50,073 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 13 treesize of output 10 [2018-04-12 06:40:50,075 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 10 treesize of output 9 [2018-04-12 06:40:50,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:50,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:50,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:40:50,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-04-12 06:40:50,127 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 23 treesize of output 35 [2018-04-12 06:40:50,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:50,132 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 21 treesize of output 30 [2018-04-12 06:40:50,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:50,148 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 20 treesize of output 19 [2018-04-12 06:40:50,148 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:50,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:50,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:40:50,168 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:51, output treesize:47 [2018-04-12 06:40:50,212 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 61 [2018-04-12 06:40:50,218 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:50,219 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 57 treesize of output 72 [2018-04-12 06:40:50,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:50,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:50,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:50,260 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 2 case distinctions, treesize of input 48 treesize of output 62 [2018-04-12 06:40:50,261 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 06:40:50,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:40:50,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-12 06:40:50,316 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:81, output treesize:123 [2018-04-12 06:40:50,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:50,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:50,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:50,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 97 [2018-04-12 06:40:50,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:50,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 06:40:50,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:152, output treesize:91 [2018-04-12 06:40:50,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:50,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:50,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:50,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:50,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2018-04-12 06:40:50,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:50,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 06:40:50,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:102, output treesize:114 [2018-04-12 06:40:50,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 83 [2018-04-12 06:40:50,632 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 10 treesize of output 9 [2018-04-12 06:40:50,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:50,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:50,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 06:40:50,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:127, output treesize:114 [2018-04-12 06:40:50,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 83 [2018-04-12 06:40:50,692 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 10 treesize of output 9 [2018-04-12 06:40:50,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:50,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:50,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-12 06:40:50,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:127, output treesize:123 [2018-04-12 06:40:50,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 73 [2018-04-12 06:40:50,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:50,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-12 06:40:50,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:50,814 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 7 treesize of output 1 [2018-04-12 06:40:50,814 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:50,822 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:40:50,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2018-04-12 06:40:50,823 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:50,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:50,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 06:40:50,842 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:132, output treesize:45 [2018-04-12 06:40:50,886 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:40:50,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:40:50,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-12 06:40:50,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-12 06:40:50,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-12 06:40:50,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-04-12 06:40:50,887 INFO L87 Difference]: Start difference. First operand 243 states and 279 transitions. Second operand 21 states. [2018-04-12 06:40:52,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:40:52,371 INFO L93 Difference]: Finished difference Result 306 states and 354 transitions. [2018-04-12 06:40:52,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-12 06:40:52,371 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2018-04-12 06:40:52,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:40:52,372 INFO L225 Difference]: With dead ends: 306 [2018-04-12 06:40:52,372 INFO L226 Difference]: Without dead ends: 306 [2018-04-12 06:40:52,373 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=207, Invalid=1199, Unknown=0, NotChecked=0, Total=1406 [2018-04-12 06:40:52,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-04-12 06:40:52,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 259. [2018-04-12 06:40:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-04-12 06:40:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 303 transitions. [2018-04-12 06:40:52,378 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 303 transitions. Word has length 50 [2018-04-12 06:40:52,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:40:52,379 INFO L459 AbstractCegarLoop]: Abstraction has 259 states and 303 transitions. [2018-04-12 06:40:52,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-12 06:40:52,379 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 303 transitions. [2018-04-12 06:40:52,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-12 06:40:52,380 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:40:52,380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:40:52,380 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:40:52,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1552822925, now seen corresponding path program 1 times [2018-04-12 06:40:52,380 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:40:52,380 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:40:52,381 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:52,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:40:52,381 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:40:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:40:52,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:40:52,421 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:40:52,421 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:40:52,422 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:40:52,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:40:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:40:52,493 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:40:52,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:40:52,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:52,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:52,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 06:40:52,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:52,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:52,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 06:40:52,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:52,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:40:52,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2018-04-12 06:40:52,582 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 11 treesize of output 8 [2018-04-12 06:40:52,583 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 8 treesize of output 7 [2018-04-12 06:40:52,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:52,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:52,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:52,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-04-12 06:40:52,615 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 21 treesize of output 16 [2018-04-12 06:40:52,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:52,618 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 16 treesize of output 23 [2018-04-12 06:40:52,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:52,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 06:40:52,636 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 10 treesize of output 9 [2018-04-12 06:40:52,636 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:52,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:52,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:40:52,647 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:48 [2018-04-12 06:40:52,688 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 30 treesize of output 58 [2018-04-12 06:40:52,690 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 43 treesize of output 42 [2018-04-12 06:40:52,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:52,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:52,732 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 38 treesize of output 48 [2018-04-12 06:40:52,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:52,735 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 34 treesize of output 45 [2018-04-12 06:40:52,735 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:52,749 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 35 treesize of output 34 [2018-04-12 06:40:52,749 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:52,756 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:52,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:40:52,768 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:74, output treesize:72 [2018-04-12 06:40:52,810 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 126 [2018-04-12 06:40:52,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:52,815 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:52,822 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 2 case distinctions, treesize of input 113 treesize of output 139 [2018-04-12 06:40:52,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 06:40:52,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:52,913 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 118 treesize of output 145 [2018-04-12 06:40:52,914 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:52,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:40:53,012 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:40:53,013 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 112 treesize of output 102 [2018-04-12 06:40:53,016 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:40:53,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:53,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 59 [2018-04-12 06:40:53,017 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:53,030 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:53,049 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 156 treesize of output 150 [2018-04-12 06:40:53,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:53,054 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 149 treesize of output 176 [2018-04-12 06:40:53,055 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:53,114 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:53,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 06:40:53,154 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:177, output treesize:205 [2018-04-12 06:40:53,216 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-12 06:40:53,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:53,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:53,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:53,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:53,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-12 06:40:53,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:53,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:40:53,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:239, output treesize:159 [2018-04-12 06:40:53,398 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 38 [2018-04-12 06:40:53,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-12 06:40:53,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:53,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:53,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 06:40:53,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:53,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:40:53,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:170, output treesize:163 [2018-04-12 06:40:53,515 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 5 treesize of output 1 [2018-04-12 06:40:53,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:53,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:40:53,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:168, output treesize:163 [2018-04-12 06:40:53,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 144 [2018-04-12 06:40:53,691 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 144 treesize of output 143 [2018-04-12 06:40:53,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:53,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:53,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 94 treesize of output 145 [2018-04-12 06:40:53,756 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-12 06:40:53,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-12 06:40:53,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 136 [2018-04-12 06:40:53,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:53,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:53,882 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:40:53,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 90 [2018-04-12 06:40:53,884 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:53,901 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:53,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 136 [2018-04-12 06:40:53,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:53,911 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:40:53,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 76 [2018-04-12 06:40:53,913 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:53,930 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:53,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 173 treesize of output 193 [2018-04-12 06:40:53,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:53,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 167 treesize of output 218 [2018-04-12 06:40:53,965 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-04-12 06:40:54,082 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 170 treesize of output 169 [2018-04-12 06:40:54,082 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:54,167 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-12 06:40:54,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-12 06:40:54,230 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:195, output treesize:425 [2018-04-12 06:40:54,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 204 treesize of output 209 [2018-04-12 06:40:54,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:54,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:54,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 192 treesize of output 225 [2018-04-12 06:40:54,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:54,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:54,449 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 199 treesize of output 208 [2018-04-12 06:40:54,450 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:54,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:54,663 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:40:54,665 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 193 treesize of output 176 [2018-04-12 06:40:54,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 36 treesize of output 21 [2018-04-12 06:40:54,666 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:54,683 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:54,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 200 treesize of output 216 [2018-04-12 06:40:54,823 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 207 treesize of output 206 [2018-04-12 06:40:54,824 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:54,897 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:55,004 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:40:55,005 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 140 [2018-04-12 06:40:55,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:55,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 69 [2018-04-12 06:40:55,009 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:55,023 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:55,114 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 193 treesize of output 176 [2018-04-12 06:40:55,116 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:55,116 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 36 treesize of output 63 [2018-04-12 06:40:55,116 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:55,136 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:55,216 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 161 [2018-04-12 06:40:55,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:55,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:55,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:55,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 130 [2018-04-12 06:40:55,223 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:55,242 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:55,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-12 06:40:55,304 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 11 variables, input treesize:591, output treesize:501 [2018-04-12 06:40:55,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 197 [2018-04-12 06:40:55,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:55,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 180 [2018-04-12 06:40:55,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:55,477 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:40:55,478 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 172 treesize of output 152 [2018-04-12 06:40:55,478 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:55,539 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:40:55,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 178 [2018-04-12 06:40:55,540 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:55,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:55,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 143 [2018-04-12 06:40:55,598 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:55,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:55,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:55,665 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 2 case distinctions, treesize of input 175 treesize of output 183 [2018-04-12 06:40:55,666 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-12 06:40:55,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-12 06:40:55,868 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 162 [2018-04-12 06:40:55,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:55,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:55,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:55,873 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 61 [2018-04-12 06:40:55,873 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:55,889 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:40:55,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2018-04-12 06:40:55,890 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:55,901 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:56,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 129 [2018-04-12 06:40:56,023 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 125 treesize of output 118 [2018-04-12 06:40:56,023 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:56,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:56,087 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:40:56,088 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 80 [2018-04-12 06:40:56,088 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:56,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:56,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2018-04-12 06:40:56,146 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:56,187 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:40:56,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:56,189 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 83 [2018-04-12 06:40:56,189 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:56,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:56,233 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:56,233 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 0 case distinctions, treesize of input 77 treesize of output 72 [2018-04-12 06:40:56,234 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:56,254 INFO L267 ElimStorePlain]: Start of recursive call 11: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:56,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 108 [2018-04-12 06:40:56,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:56,268 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:40:56,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 74 [2018-04-12 06:40:56,269 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:56,309 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 68 treesize of output 61 [2018-04-12 06:40:56,309 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:56,344 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:40:56,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:56,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 70 [2018-04-12 06:40:56,345 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:56,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:56,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-04-12 06:40:56,377 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:56,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:56,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2018-04-12 06:40:56,407 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:56,423 INFO L267 ElimStorePlain]: Start of recursive call 17: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:56,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 101 [2018-04-12 06:40:56,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:56,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-04-12 06:40:56,428 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:56,448 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 7 treesize of output 1 [2018-04-12 06:40:56,448 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:56,463 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:40:56,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:56,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 27 [2018-04-12 06:40:56,464 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:56,472 INFO L267 ElimStorePlain]: Start of recursive call 23: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:56,541 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 93 treesize of output 75 [2018-04-12 06:40:56,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:56,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-04-12 06:40:56,543 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:56,552 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:40:56,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:56,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-04-12 06:40:56,553 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:56,564 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:56,637 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 149 treesize of output 125 [2018-04-12 06:40:56,639 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 11 treesize of output 1 [2018-04-12 06:40:56,639 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:56,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:56,654 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:40:56,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 56 [2018-04-12 06:40:56,654 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:56,665 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:56,720 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 65 [2018-04-12 06:40:56,722 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:40:56,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-04-12 06:40:56,722 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:56,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:40:56,732 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 18 [2018-04-12 06:40:56,732 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-12 06:40:56,738 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:40:56,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 6 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-12 06:40:56,787 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 17 variables, input treesize:555, output treesize:77 [2018-04-12 06:40:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:40:56,844 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:40:56,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-12 06:40:56,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-12 06:40:56,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-12 06:40:56,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2018-04-12 06:40:56,845 INFO L87 Difference]: Start difference. First operand 259 states and 303 transitions. Second operand 24 states. [2018-04-12 06:41:28,850 WARN L151 SmtUtils]: Spent 215ms on a formula simplification. DAG size of input: 170 DAG size of output 127 [2018-04-12 06:41:29,178 WARN L151 SmtUtils]: Spent 223ms on a formula simplification. DAG size of input: 181 DAG size of output 134 [2018-04-12 06:41:40,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:41:40,002 INFO L93 Difference]: Finished difference Result 279 states and 327 transitions. [2018-04-12 06:41:40,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-12 06:41:40,003 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2018-04-12 06:41:40,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:41:40,004 INFO L225 Difference]: With dead ends: 279 [2018-04-12 06:41:40,004 INFO L226 Difference]: Without dead ends: 279 [2018-04-12 06:41:40,004 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=265, Invalid=1627, Unknown=0, NotChecked=0, Total=1892 [2018-04-12 06:41:40,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-04-12 06:41:40,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2018-04-12 06:41:40,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-04-12 06:41:40,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 305 transitions. [2018-04-12 06:41:40,012 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 305 transitions. Word has length 50 [2018-04-12 06:41:40,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:41:40,012 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 305 transitions. [2018-04-12 06:41:40,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-12 06:41:40,012 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 305 transitions. [2018-04-12 06:41:40,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-12 06:41:40,013 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:41:40,013 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:41:40,013 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:41:40,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1015537919, now seen corresponding path program 1 times [2018-04-12 06:41:40,013 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:41:40,013 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:41:40,014 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:41:40,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:41:40,014 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:41:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:41:40,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:41:40,035 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:41:40,035 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:41:40,035 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:41:40,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:41:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:41:40,080 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:41:40,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:41:40,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-12 06:41:40,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:40,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:40,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 06:41:40,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-12 06:41:40,122 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 11 treesize of output 8 [2018-04-12 06:41:40,123 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 8 treesize of output 7 [2018-04-12 06:41:40,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,132 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 11 treesize of output 8 [2018-04-12 06:41:40,133 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 8 treesize of output 7 [2018-04-12 06:41:40,133 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,134 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,140 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-04-12 06:41:40,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 21 treesize of output 16 [2018-04-12 06:41:40,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:40,153 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 16 treesize of output 23 [2018-04-12 06:41:40,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,168 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 21 treesize of output 16 [2018-04-12 06:41:40,169 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:40,170 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 16 treesize of output 23 [2018-04-12 06:41:40,170 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,173 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,182 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2018-04-12 06:41:40,291 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_flength_test___true_valid_memsafety_i__append_~head.offset Int) (__U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base Int) (__U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset Int)) (let ((.cse1 (+ __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset 1)) (.cse2 (+ __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset 5)) (.cse3 (+ __U_MULTI_flength_test___true_valid_memsafety_i__append_~head.offset 4))) (and (= (select |c_old(#valid)| __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base) 0) (= |c_#memory_$Pointer$.offset| (let ((.cse0 (store |c_old(#memory_$Pointer$.offset)| |c___U_MULTI_flength_test___true_valid_memsafety_i__append_#in~head.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c___U_MULTI_flength_test___true_valid_memsafety_i__append_#in~head.base|) __U_MULTI_flength_test___true_valid_memsafety_i__append_~head.offset __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset) .cse3 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset)))) (store .cse0 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base (store (store (select .cse0 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base) .cse1 0) .cse2 0)))) (= |c_#memory_$Pointer$.base| (let ((.cse4 (store |c_old(#memory_$Pointer$.base)| |c___U_MULTI_flength_test___true_valid_memsafety_i__append_#in~head.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c___U_MULTI_flength_test___true_valid_memsafety_i__append_#in~head.base|) __U_MULTI_flength_test___true_valid_memsafety_i__append_~head.offset __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base) .cse3 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base)))) (store .cse4 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base (store (store (select .cse4 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base) .cse1 0) .cse2 0))))))) is different from true [2018-04-12 06:41:40,415 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 74 DAG size of output 58 [2018-04-12 06:41:40,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:40,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:40,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:40,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-12 06:41:40,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 60 [2018-04-12 06:41:40,461 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-04-12 06:41:40,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:40,463 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 16 treesize of output 23 [2018-04-12 06:41:40,464 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 60 [2018-04-12 06:41:40,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-04-12 06:41:40,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:40,499 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 18 treesize of output 27 [2018-04-12 06:41:40,499 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,503 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,514 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,523 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 60 [2018-04-12 06:41:40,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-04-12 06:41:40,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:40,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 06:41:40,561 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,565 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 60 [2018-04-12 06:41:40,581 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-04-12 06:41:40,583 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:41:40,584 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 18 treesize of output 27 [2018-04-12 06:41:40,584 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,588 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,595 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,602 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:41:40,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:41:40,620 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:146, output treesize:165 [2018-04-12 06:41:45,449 WARN L148 SmtUtils]: Spent 2516ms on a formula simplification that was a NOOP. DAG size: 53 [2018-04-12 06:41:52,913 WARN L148 SmtUtils]: Spent 2494ms on a formula simplification that was a NOOP. DAG size: 57 [2018-04-12 06:42:19,584 WARN L148 SmtUtils]: Spent 2516ms on a formula simplification that was a NOOP. DAG size: 57 [2018-04-12 06:42:19,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 108 [2018-04-12 06:42:19,606 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:19,607 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:42:19,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-04-12 06:42:19,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:19,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:19,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2018-04-12 06:42:19,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:42:19,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:19,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-04-12 06:42:19,635 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:19,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:42:19,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-04-12 06:42:19,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:19,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-04-12 06:42:19,663 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:19,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:19,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 10 [2018-04-12 06:42:19,672 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:19,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:42:19,678 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:42:19,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-04-12 06:42:19,679 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 06:42:19,681 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:42:19,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:42:19,688 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:185, output treesize:7 [2018-04-12 06:42:19,734 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:42:19,734 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:42:19,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-12 06:42:19,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-12 06:42:19,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-12 06:42:19,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=317, Unknown=20, NotChecked=36, Total=420 [2018-04-12 06:42:19,735 INFO L87 Difference]: Start difference. First operand 263 states and 305 transitions. Second operand 21 states. [2018-04-12 06:43:45,411 WARN L148 SmtUtils]: Spent 2505ms on a formula simplification that was a NOOP. DAG size: 64 [2018-04-12 06:43:50,684 WARN L151 SmtUtils]: Spent 5242ms on a formula simplification. DAG size of input: 107 DAG size of output 79 [2018-04-12 06:43:55,459 WARN L151 SmtUtils]: Spent 4745ms on a formula simplification. DAG size of input: 108 DAG size of output 80 [2018-04-12 06:44:00,596 WARN L151 SmtUtils]: Spent 5104ms on a formula simplification. DAG size of input: 111 DAG size of output 83 [2018-04-12 06:44:05,692 WARN L151 SmtUtils]: Spent 5041ms on a formula simplification. DAG size of input: 115 DAG size of output 87 [2018-04-12 06:44:08,331 WARN L148 SmtUtils]: Spent 2606ms on a formula simplification that was a NOOP. DAG size: 75 [2018-04-12 06:45:03,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:45:03,501 INFO L93 Difference]: Finished difference Result 301 states and 346 transitions. [2018-04-12 06:45:03,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-12 06:45:03,501 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2018-04-12 06:45:03,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:45:03,502 INFO L225 Difference]: With dead ends: 301 [2018-04-12 06:45:03,502 INFO L226 Difference]: Without dead ends: 301 [2018-04-12 06:45:03,503 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 84.9s TimeCoverageRelationStatistics Valid=158, Invalid=990, Unknown=46, NotChecked=66, Total=1260 [2018-04-12 06:45:03,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-04-12 06:45:03,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 263. [2018-04-12 06:45:03,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-04-12 06:45:03,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 304 transitions. [2018-04-12 06:45:03,507 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 304 transitions. Word has length 52 [2018-04-12 06:45:03,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:45:03,507 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 304 transitions. [2018-04-12 06:45:03,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-12 06:45:03,507 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 304 transitions. [2018-04-12 06:45:03,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-12 06:45:03,508 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:45:03,508 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:45:03,508 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:45:03,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1386904548, now seen corresponding path program 1 times [2018-04-12 06:45:03,508 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:45:03,508 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:45:03,508 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:45:03,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:45:03,509 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:45:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:45:03,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:45:03,533 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:45:03,533 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:45:03,533 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:45:03,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:45:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:45:03,562 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:45:03,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:45:03,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:45:03,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:45:03,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 06:45:03,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:45:03,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:45:03,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 06:45:03,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:45:03,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:45:03,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-12 06:45:03,597 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 13 treesize of output 10 [2018-04-12 06:45:03,599 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 10 treesize of output 9 [2018-04-12 06:45:03,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:45:03,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:45:03,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 06:45:03,626 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 10 treesize of output 9 [2018-04-12 06:45:03,626 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:45:03,628 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:45:03,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:45:03,632 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-12 06:45:03,776 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_flength_test___true_valid_memsafety_i__append_~head.offset Int) (__U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base Int) (__U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset Int)) (let ((.cse1 (+ __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset 1)) (.cse2 (+ __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset 5)) (.cse3 (+ __U_MULTI_flength_test___true_valid_memsafety_i__append_~head.offset 4))) (and (= |c_#memory_$Pointer$.offset| (let ((.cse0 (store |c_old(#memory_$Pointer$.offset)| |c___U_MULTI_flength_test___true_valid_memsafety_i__append_#in~head.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c___U_MULTI_flength_test___true_valid_memsafety_i__append_#in~head.base|) __U_MULTI_flength_test___true_valid_memsafety_i__append_~head.offset __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset) .cse3 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset)))) (store .cse0 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base (store (store (select .cse0 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base) .cse1 0) .cse2 0)))) (<= __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset 0) (<= 0 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset) (= |c_#memory_$Pointer$.base| (let ((.cse4 (store |c_old(#memory_$Pointer$.base)| |c___U_MULTI_flength_test___true_valid_memsafety_i__append_#in~head.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c___U_MULTI_flength_test___true_valid_memsafety_i__append_#in~head.base|) __U_MULTI_flength_test___true_valid_memsafety_i__append_~head.offset __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base) .cse3 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base)))) (store .cse4 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base (store (store (select .cse4 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base) .cse1 0) .cse2 0))))))) is different from true [2018-04-12 06:45:03,893 WARN L148 SmtUtils]: Spent 114ms on a formula simplification that was a NOOP. DAG size: 64 [2018-04-12 06:45:03,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2018-04-12 06:45:03,914 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-04-12 06:45:03,917 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:45:03,917 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 16 treesize of output 23 [2018-04-12 06:45:03,918 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:45:03,924 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:45:03,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 64 [2018-04-12 06:45:03,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:45:03,976 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 60 [2018-04-12 06:45:03,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:45:03,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:45:03,985 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:45:03,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-04-12 06:45:03,986 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:45:04,009 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:45:04,044 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2018-04-12 06:45:04,047 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:45:04,047 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 18 treesize of output 27 [2018-04-12 06:45:04,047 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 06:45:04,058 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:45:04,074 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:45:04,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:45:04,099 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2018-04-12 06:45:04,101 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-04-12 06:45:04,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:45:04,104 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 37 treesize of output 41 [2018-04-12 06:45:04,105 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-12 06:45:04,112 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:45:04,141 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 44 treesize of output 41 [2018-04-12 06:45:04,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:45:04,146 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:45:04,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 39 [2018-04-12 06:45:04,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:45:04,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:45:04,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 49 [2018-04-12 06:45:04,156 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-12 06:45:04,165 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:45:04,174 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:45:04,189 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:45:04,256 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2018-04-12 06:45:04,259 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-04-12 06:45:04,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:45:04,262 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 37 treesize of output 41 [2018-04-12 06:45:04,262 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-12 06:45:04,271 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:45:04,286 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 44 treesize of output 41 [2018-04-12 06:45:04,288 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:45:04,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 28 treesize of output 50 [2018-04-12 06:45:04,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:45:04,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:45:04,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:45:04,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 59 [2018-04-12 06:45:04,307 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-12 06:45:04,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:45:04,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:45:04,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 55 [2018-04-12 06:45:04,364 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-04-12 06:45:04,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:45:04,417 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:45:04,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2018-04-12 06:45:04,419 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-12 06:45:04,442 INFO L267 ElimStorePlain]: Start of recursive call 20: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-12 06:45:04,466 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-12 06:45:04,495 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-12 06:45:04,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2018-04-12 06:45:04,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 13 treesize of output 16 [2018-04-12 06:45:04,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:45:04,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 06:45:04,512 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-12 06:45:04,517 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:45:04,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 64 [2018-04-12 06:45:04,543 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 55 [2018-04-12 06:45:04,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:45:04,546 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 18 treesize of output 27 [2018-04-12 06:45:04,546 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-12 06:45:04,555 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:45:04,585 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:45:04,592 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:45:04,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 5 xjuncts. [2018-04-12 06:45:04,640 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 6 variables, input treesize:120, output treesize:540 [2018-04-12 06:46:16,457 WARN L151 SmtUtils]: Spent 69633ms on a formula simplification. DAG size of input: 155 DAG size of output 70 [2018-04-12 06:46:34,057 WARN L148 SmtUtils]: Spent 17550ms on a formula simplification that was a NOOP. DAG size: 70 [2018-04-12 06:46:53,604 WARN L148 SmtUtils]: Spent 19502ms on a formula simplification that was a NOOP. DAG size: 70 [2018-04-12 06:47:09,041 WARN L148 SmtUtils]: Spent 15375ms on a formula simplification that was a NOOP. DAG size: 74 [2018-04-12 06:47:40,599 WARN L148 SmtUtils]: Spent 31517ms on a formula simplification that was a NOOP. DAG size: 71 [2018-04-12 06:47:40,616 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:47:40,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:47:40,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-12 06:47:40,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 06:47:40,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 06:47:40,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=363, Unknown=8, NotChecked=38, Total=462 [2018-04-12 06:47:40,617 INFO L87 Difference]: Start difference. First operand 263 states and 304 transitions. Second operand 22 states. [2018-04-12 06:47:48,681 WARN L148 SmtUtils]: Spent 3583ms on a formula simplification that was a NOOP. DAG size: 75 [2018-04-12 06:47:54,704 WARN L151 SmtUtils]: Spent 5932ms on a formula simplification. DAG size of input: 117 DAG size of output 78 [2018-04-12 06:48:04,074 WARN L151 SmtUtils]: Spent 9333ms on a formula simplification. DAG size of input: 119 DAG size of output 80 [2018-04-12 06:48:11,754 WARN L151 SmtUtils]: Spent 7610ms on a formula simplification. DAG size of input: 121 DAG size of output 82 [2018-04-12 06:48:15,811 WARN L151 SmtUtils]: Spent 4007ms on a formula simplification. DAG size of input: 122 DAG size of output 83 [2018-04-12 06:48:23,125 WARN L151 SmtUtils]: Spent 7238ms on a formula simplification. DAG size of input: 123 DAG size of output 85 [2018-04-12 06:48:38,979 WARN L151 SmtUtils]: Spent 15748ms on a formula simplification. DAG size of input: 130 DAG size of output 94 [2018-04-12 06:48:56,031 WARN L151 SmtUtils]: Spent 16881ms on a formula simplification. DAG size of input: 127 DAG size of output 88 [2018-04-12 06:48:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:48:56,403 INFO L93 Difference]: Finished difference Result 291 states and 333 transitions. [2018-04-12 06:48:56,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-12 06:48:56,404 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54 [2018-04-12 06:48:56,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:48:56,405 INFO L225 Difference]: With dead ends: 291 [2018-04-12 06:48:56,405 INFO L226 Difference]: Without dead ends: 291 [2018-04-12 06:48:56,406 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 229.8s TimeCoverageRelationStatistics Valid=199, Invalid=1118, Unknown=19, NotChecked=70, Total=1406 [2018-04-12 06:48:56,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-04-12 06:48:56,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 255. [2018-04-12 06:48:56,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-04-12 06:48:56,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 293 transitions. [2018-04-12 06:48:56,411 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 293 transitions. Word has length 54 [2018-04-12 06:48:56,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:48:56,412 INFO L459 AbstractCegarLoop]: Abstraction has 255 states and 293 transitions. [2018-04-12 06:48:56,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 06:48:56,412 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 293 transitions. [2018-04-12 06:48:56,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-12 06:48:56,412 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:48:56,413 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:48:56,413 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:48:56,413 INFO L82 PathProgramCache]: Analyzing trace with hash -967383679, now seen corresponding path program 1 times [2018-04-12 06:48:56,413 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:48:56,413 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:48:56,414 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:48:56,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:48:56,414 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:48:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:48:56,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:48:56,448 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-04-12 06:48:56,448 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:48:56,448 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:48:56,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:48:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:48:56,465 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:48:56,472 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-04-12 06:48:56,472 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 06:48:56,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-04-12 06:48:56,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 06:48:56,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 06:48:56,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-12 06:48:56,474 INFO L87 Difference]: Start difference. First operand 255 states and 293 transitions. Second operand 5 states. [2018-04-12 06:48:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:48:56,498 INFO L93 Difference]: Finished difference Result 291 states and 333 transitions. [2018-04-12 06:48:56,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 06:48:56,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-04-12 06:48:56,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:48:56,499 INFO L225 Difference]: With dead ends: 291 [2018-04-12 06:48:56,499 INFO L226 Difference]: Without dead ends: 291 [2018-04-12 06:48:56,499 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-12 06:48:56,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-04-12 06:48:56,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 272. [2018-04-12 06:48:56,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-04-12 06:48:56,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 316 transitions. [2018-04-12 06:48:56,505 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 316 transitions. Word has length 58 [2018-04-12 06:48:56,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:48:56,505 INFO L459 AbstractCegarLoop]: Abstraction has 272 states and 316 transitions. [2018-04-12 06:48:56,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 06:48:56,505 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 316 transitions. [2018-04-12 06:48:56,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-12 06:48:56,506 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:48:56,506 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:48:56,506 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:48:56,506 INFO L82 PathProgramCache]: Analyzing trace with hash 422423265, now seen corresponding path program 1 times [2018-04-12 06:48:56,507 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:48:56,507 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:48:56,507 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:48:56,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:48:56,507 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:48:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:48:56,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:48:56,533 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-12 06:48:56,533 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 06:48:56,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 06:48:56,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 06:48:56,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 06:48:56,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 06:48:56,534 INFO L87 Difference]: Start difference. First operand 272 states and 316 transitions. Second operand 3 states. [2018-04-12 06:48:56,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:48:56,540 INFO L93 Difference]: Finished difference Result 268 states and 308 transitions. [2018-04-12 06:48:56,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 06:48:56,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2018-04-12 06:48:56,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:48:56,542 INFO L225 Difference]: With dead ends: 268 [2018-04-12 06:48:56,542 INFO L226 Difference]: Without dead ends: 268 [2018-04-12 06:48:56,542 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 06:48:56,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-04-12 06:48:56,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-04-12 06:48:56,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-12 06:48:56,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 308 transitions. [2018-04-12 06:48:56,547 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 308 transitions. Word has length 61 [2018-04-12 06:48:56,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:48:56,547 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 308 transitions. [2018-04-12 06:48:56,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 06:48:56,547 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 308 transitions. [2018-04-12 06:48:56,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-12 06:48:56,548 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:48:56,548 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:48:56,548 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:48:56,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1896804959, now seen corresponding path program 1 times [2018-04-12 06:48:56,548 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:48:56,549 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:48:56,549 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:48:56,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:48:56,549 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:48:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:48:56,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:48:56,567 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:48:56,567 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:48:56,567 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:48:56,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:48:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:48:56,608 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:48:56,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:48:56,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:48:56,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:48:56,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 06:48:56,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:48:56,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:48:56,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 06:48:56,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:48:56,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:48:56,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2018-04-12 06:48:56,706 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 13 treesize of output 10 [2018-04-12 06:48:56,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-04-12 06:48:56,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:48:56,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:48:56,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:48:56,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-04-12 06:48:56,742 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-04-12 06:48:56,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:48:56,750 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 2 case distinctions, treesize of input 21 treesize of output 34 [2018-04-12 06:48:56,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 06:48:56,771 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 20 treesize of output 19 [2018-04-12 06:48:56,771 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:48:56,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:48:56,796 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 2 xjuncts. [2018-04-12 06:48:56,796 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:38, output treesize:65 [2018-04-12 06:48:56,871 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 65 [2018-04-12 06:48:56,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:48:56,876 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 61 treesize of output 76 [2018-04-12 06:48:56,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:48:56,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:48:56,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 66 [2018-04-12 06:48:56,926 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 06:48:56,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:48:56,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-12 06:48:56,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:48:56,999 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 18 treesize of output 27 [2018-04-12 06:48:57,000 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:48:57,008 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:48:57,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-12 06:48:57,039 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:109, output treesize:133 [2018-04-12 06:48:57,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:48:57,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:48:57,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:48:57,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 74 [2018-04-12 06:48:57,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:48:57,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:48:57,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:184, output treesize:60 [2018-04-12 06:48:57,281 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 06:48:57,281 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:48:57,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-12 06:48:57,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-12 06:48:57,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-12 06:48:57,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-04-12 06:48:57,283 INFO L87 Difference]: Start difference. First operand 268 states and 308 transitions. Second operand 19 states. [2018-04-12 06:48:58,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:48:58,393 INFO L93 Difference]: Finished difference Result 266 states and 304 transitions. [2018-04-12 06:48:58,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-12 06:48:58,394 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 63 [2018-04-12 06:48:58,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:48:58,395 INFO L225 Difference]: With dead ends: 266 [2018-04-12 06:48:58,395 INFO L226 Difference]: Without dead ends: 266 [2018-04-12 06:48:58,395 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=1207, Unknown=0, NotChecked=0, Total=1406 [2018-04-12 06:48:58,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-04-12 06:48:58,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 262. [2018-04-12 06:48:58,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-04-12 06:48:58,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 299 transitions. [2018-04-12 06:48:58,398 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 299 transitions. Word has length 63 [2018-04-12 06:48:58,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:48:58,399 INFO L459 AbstractCegarLoop]: Abstraction has 262 states and 299 transitions. [2018-04-12 06:48:58,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-12 06:48:58,399 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 299 transitions. [2018-04-12 06:48:58,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-12 06:48:58,399 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:48:58,399 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:48:58,399 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:48:58,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1079614339, now seen corresponding path program 1 times [2018-04-12 06:48:58,399 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:48:58,399 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:48:58,400 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:48:58,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:48:58,400 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:48:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:48:58,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:48:58,414 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:48:58,414 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:48:58,414 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:48:58,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:48:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:48:58,438 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:48:58,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:48:58,505 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 14 treesize of output 17 [2018-04-12 06:48:58,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:48:58,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:48:58,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:48:58,512 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-12 06:48:58,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:48:58,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:48:58,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-12 06:48:58,533 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-12 06:48:58,533 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:48:58,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-12 06:48:58,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 06:48:58,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 06:48:58,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-12 06:48:58,534 INFO L87 Difference]: Start difference. First operand 262 states and 299 transitions. Second operand 10 states. [2018-04-12 06:48:58,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:48:58,838 INFO L93 Difference]: Finished difference Result 311 states and 338 transitions. [2018-04-12 06:48:58,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 06:48:58,838 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2018-04-12 06:48:58,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:48:58,839 INFO L225 Difference]: With dead ends: 311 [2018-04-12 06:48:58,839 INFO L226 Difference]: Without dead ends: 311 [2018-04-12 06:48:58,839 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-04-12 06:48:58,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-04-12 06:48:58,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 290. [2018-04-12 06:48:58,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-04-12 06:48:58,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 325 transitions. [2018-04-12 06:48:58,842 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 325 transitions. Word has length 63 [2018-04-12 06:48:58,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:48:58,842 INFO L459 AbstractCegarLoop]: Abstraction has 290 states and 325 transitions. [2018-04-12 06:48:58,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 06:48:58,842 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 325 transitions. [2018-04-12 06:48:58,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-12 06:48:58,842 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:48:58,842 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:48:58,843 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:48:58,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1863838286, now seen corresponding path program 1 times [2018-04-12 06:48:58,843 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:48:58,843 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:48:58,843 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:48:58,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:48:58,843 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:48:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:48:58,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:48:58,865 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:48:58,865 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:48:58,865 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:48:58,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:48:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:48:58,934 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:48:58,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:48:58,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:48:58,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:48:58,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 06:48:59,038 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:48:59,039 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:48:59,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 06:48:59,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:48:59,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:48:59,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-12 06:48:59,079 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| Int)) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| 1))) is different from true [2018-04-12 06:48:59,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-04-12 06:48:59,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:48:59,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:48:59,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-04-12 06:48:59,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-04-12 06:48:59,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:48:59,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:48:59,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-04-12 06:48:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 9 not checked. [2018-04-12 06:48:59,176 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:48:59,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-12 06:48:59,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-12 06:48:59,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-12 06:48:59,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=207, Unknown=1, NotChecked=28, Total=272 [2018-04-12 06:48:59,177 INFO L87 Difference]: Start difference. First operand 290 states and 325 transitions. Second operand 17 states. [2018-04-12 06:48:59,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:48:59,900 INFO L93 Difference]: Finished difference Result 320 states and 347 transitions. [2018-04-12 06:48:59,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-12 06:48:59,901 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2018-04-12 06:48:59,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:48:59,902 INFO L225 Difference]: With dead ends: 320 [2018-04-12 06:48:59,902 INFO L226 Difference]: Without dead ends: 320 [2018-04-12 06:48:59,902 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=678, Unknown=1, NotChecked=54, Total=870 [2018-04-12 06:48:59,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-04-12 06:48:59,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 250. [2018-04-12 06:48:59,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-12 06:48:59,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 274 transitions. [2018-04-12 06:48:59,906 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 274 transitions. Word has length 65 [2018-04-12 06:48:59,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:48:59,906 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 274 transitions. [2018-04-12 06:48:59,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-12 06:48:59,906 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 274 transitions. [2018-04-12 06:48:59,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-12 06:48:59,907 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:48:59,907 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:48:59,907 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:48:59,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1863838285, now seen corresponding path program 1 times [2018-04-12 06:48:59,907 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:48:59,908 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:48:59,908 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:48:59,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:48:59,908 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:48:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:48:59,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:48:59,935 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:48:59,936 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:48:59,936 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:48:59,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:48:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:48:59,985 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:48:59,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:48:59,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:48:59,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:48:59,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:00,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:00,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-12 06:49:00,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:00,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:00,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-12 06:49:00,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:00,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:00,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:00,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 06:49:00,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:00,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:49:00,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-12 06:49:00,201 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| Int)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| 9))) is different from true [2018-04-12 06:49:00,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:00,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:00,217 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 2 case distinctions, treesize of input 17 treesize of output 24 [2018-04-12 06:49:00,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-12 06:49:00,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-12 06:49:00,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:44 [2018-04-12 06:49:00,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-04-12 06:49:00,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:00,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:00,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:00,380 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 2 case distinctions, treesize of input 23 treesize of output 30 [2018-04-12 06:49:00,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 06:49:00,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-12 06:49:00,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:51, output treesize:70 [2018-04-12 06:49:00,432 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2018-04-12 06:49:00,432 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:49:00,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-12 06:49:00,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-12 06:49:00,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-12 06:49:00,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=298, Unknown=1, NotChecked=34, Total=380 [2018-04-12 06:49:00,433 INFO L87 Difference]: Start difference. First operand 250 states and 274 transitions. Second operand 20 states. [2018-04-12 06:49:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:49:01,306 INFO L93 Difference]: Finished difference Result 243 states and 265 transitions. [2018-04-12 06:49:01,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-12 06:49:01,307 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2018-04-12 06:49:01,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:49:01,307 INFO L225 Difference]: With dead ends: 243 [2018-04-12 06:49:01,307 INFO L226 Difference]: Without dead ends: 243 [2018-04-12 06:49:01,308 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=850, Unknown=1, NotChecked=60, Total=1056 [2018-04-12 06:49:01,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-04-12 06:49:01,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2018-04-12 06:49:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-04-12 06:49:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 265 transitions. [2018-04-12 06:49:01,312 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 265 transitions. Word has length 65 [2018-04-12 06:49:01,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:49:01,313 INFO L459 AbstractCegarLoop]: Abstraction has 241 states and 265 transitions. [2018-04-12 06:49:01,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-12 06:49:01,313 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 265 transitions. [2018-04-12 06:49:01,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-12 06:49:01,314 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:49:01,314 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:49:01,314 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:49:01,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1207919235, now seen corresponding path program 1 times [2018-04-12 06:49:01,314 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:49:01,314 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:49:01,315 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:49:01,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:49:01,315 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:49:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:49:01,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:49:01,350 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:49:01,351 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:49:01,351 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:49:01,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:49:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:49:01,430 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:49:01,477 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 13 treesize of output 10 [2018-04-12 06:49:01,479 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 10 treesize of output 9 [2018-04-12 06:49:01,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:01,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:01,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:49:01,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-04-12 06:49:01,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:01,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:01,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:01,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:01,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 54 [2018-04-12 06:49:01,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:01,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:49:01,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:45 [2018-04-12 06:49:01,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 41 treesize of output 42 [2018-04-12 06:49:01,712 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 16 treesize of output 15 [2018-04-12 06:49:01,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:01,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:01,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:49:01,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:60 [2018-04-12 06:49:01,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 50 treesize of output 49 [2018-04-12 06:49:01,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:01,805 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 24 treesize of output 33 [2018-04-12 06:49:01,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:01,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:01,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 06:49:01,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:73, output treesize:69 [2018-04-12 06:49:01,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2018-04-12 06:49:01,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:01,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2018-04-12 06:49:01,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:01,869 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:49:01,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-12 06:49:01,870 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:01,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:01,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:49:01,882 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:78, output treesize:24 [2018-04-12 06:49:01,911 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 06:49:01,911 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:49:01,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-12 06:49:01,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-12 06:49:01,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-12 06:49:01,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-04-12 06:49:01,912 INFO L87 Difference]: Start difference. First operand 241 states and 265 transitions. Second operand 18 states. [2018-04-12 06:49:03,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:49:03,279 INFO L93 Difference]: Finished difference Result 253 states and 277 transitions. [2018-04-12 06:49:03,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-12 06:49:03,279 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2018-04-12 06:49:03,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:49:03,280 INFO L225 Difference]: With dead ends: 253 [2018-04-12 06:49:03,280 INFO L226 Difference]: Without dead ends: 253 [2018-04-12 06:49:03,280 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=231, Invalid=761, Unknown=0, NotChecked=0, Total=992 [2018-04-12 06:49:03,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-12 06:49:03,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 241. [2018-04-12 06:49:03,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-04-12 06:49:03,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 264 transitions. [2018-04-12 06:49:03,285 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 264 transitions. Word has length 72 [2018-04-12 06:49:03,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:49:03,285 INFO L459 AbstractCegarLoop]: Abstraction has 241 states and 264 transitions. [2018-04-12 06:49:03,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-12 06:49:03,285 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 264 transitions. [2018-04-12 06:49:03,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-12 06:49:03,286 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:49:03,286 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:49:03,286 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:49:03,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1207919236, now seen corresponding path program 1 times [2018-04-12 06:49:03,286 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:49:03,286 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:49:03,287 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:49:03,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:49:03,287 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:49:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:49:03,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:49:03,326 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:49:03,327 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:49:03,327 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:49:03,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:49:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:49:03,424 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:49:03,580 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 13 treesize of output 10 [2018-04-12 06:49:03,582 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 10 treesize of output 9 [2018-04-12 06:49:03,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:03,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:03,601 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 13 treesize of output 10 [2018-04-12 06:49:03,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 10 treesize of output 9 [2018-04-12 06:49:03,604 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:03,606 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:03,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:03,620 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:54 [2018-04-12 06:49:03,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:03,748 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 26 treesize of output 35 [2018-04-12 06:49:03,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:03,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:03,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:03,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:03,775 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-04-12 06:49:03,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:03,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:49:03,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:66 [2018-04-12 06:49:03,870 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 5 treesize of output 1 [2018-04-12 06:49:03,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:03,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:49:03,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:66 [2018-04-12 06:49:03,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 57 treesize of output 58 [2018-04-12 06:49:03,990 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 16 treesize of output 15 [2018-04-12 06:49:03,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:03,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:04,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 43 treesize of output 44 [2018-04-12 06:49:04,018 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 10 treesize of output 9 [2018-04-12 06:49:04,018 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:04,024 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:04,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:49:04,038 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:98, output treesize:81 [2018-04-12 06:49:04,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 43 treesize of output 44 [2018-04-12 06:49:04,082 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 10 treesize of output 9 [2018-04-12 06:49:04,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:04,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:04,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 66 treesize of output 65 [2018-04-12 06:49:04,114 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:04,114 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:49:04,115 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 24 treesize of output 42 [2018-04-12 06:49:04,115 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:04,123 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:04,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 06:49:04,138 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:107, output treesize:99 [2018-04-12 06:49:04,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-04-12 06:49:04,179 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:49:04,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-04-12 06:49:04,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:04,187 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 7 treesize of output 1 [2018-04-12 06:49:04,187 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:04,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:04,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2018-04-12 06:49:04,209 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:49:04,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-04-12 06:49:04,210 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:04,218 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:04,219 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:49:04,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 25 [2018-04-12 06:49:04,219 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:04,223 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:04,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:49:04,231 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:117, output treesize:20 [2018-04-12 06:49:04,267 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-12 06:49:04,267 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:49:04,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-12 06:49:04,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-12 06:49:04,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-12 06:49:04,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2018-04-12 06:49:04,268 INFO L87 Difference]: Start difference. First operand 241 states and 264 transitions. Second operand 26 states. [2018-04-12 06:49:05,618 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 107 DAG size of output 77 [2018-04-12 06:49:05,860 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 117 DAG size of output 87 [2018-04-12 06:49:06,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:49:06,218 INFO L93 Difference]: Finished difference Result 271 states and 293 transitions. [2018-04-12 06:49:06,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-12 06:49:06,219 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 72 [2018-04-12 06:49:06,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:49:06,220 INFO L225 Difference]: With dead ends: 271 [2018-04-12 06:49:06,220 INFO L226 Difference]: Without dead ends: 265 [2018-04-12 06:49:06,220 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=562, Invalid=1988, Unknown=0, NotChecked=0, Total=2550 [2018-04-12 06:49:06,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-04-12 06:49:06,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 233. [2018-04-12 06:49:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-12 06:49:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 251 transitions. [2018-04-12 06:49:06,223 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 251 transitions. Word has length 72 [2018-04-12 06:49:06,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:49:06,224 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 251 transitions. [2018-04-12 06:49:06,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-12 06:49:06,224 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 251 transitions. [2018-04-12 06:49:06,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-12 06:49:06,224 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:49:06,224 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:49:06,225 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:49:06,225 INFO L82 PathProgramCache]: Analyzing trace with hash 610363464, now seen corresponding path program 1 times [2018-04-12 06:49:06,225 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:49:06,225 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:49:06,225 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:49:06,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:49:06,225 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:49:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:49:06,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:49:06,244 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:49:06,244 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:49:06,244 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:49:06,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:49:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:49:06,305 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:49:06,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:49:06,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:06,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:06,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 06:49:06,338 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| Int)) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| 1))) is different from true [2018-04-12 06:49:06,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 11 [2018-04-12 06:49:06,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:06,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:49:06,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-12 06:49:06,424 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 13 treesize of output 10 [2018-04-12 06:49:06,425 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 10 treesize of output 9 [2018-04-12 06:49:06,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:06,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:06,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:49:06,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-04-12 06:49:06,461 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 23 treesize of output 35 [2018-04-12 06:49:06,463 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 24 treesize of output 23 [2018-04-12 06:49:06,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:06,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-04-12 06:49:06,481 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 06:49:06,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:49:06,507 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 2 xjuncts. [2018-04-12 06:49:06,507 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:45, output treesize:79 [2018-04-12 06:49:06,560 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 42 treesize of output 37 [2018-04-12 06:49:06,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:06,562 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 18 treesize of output 27 [2018-04-12 06:49:06,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:06,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:06,606 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 72 [2018-04-12 06:49:06,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:06,609 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 68 treesize of output 83 [2018-04-12 06:49:06,609 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:06,639 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:06,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 54 treesize of output 60 [2018-04-12 06:49:06,646 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-12 06:49:06,672 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:49:06,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-12 06:49:06,704 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:118, output treesize:144 [2018-04-12 06:49:06,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:06,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:06,772 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 73 treesize of output 72 [2018-04-12 06:49:06,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:06,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:49:06,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:168, output treesize:66 [2018-04-12 06:49:06,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:06,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:06,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:06,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-12 06:49:06,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:06,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:49:06,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:77, output treesize:85 [2018-04-12 06:49:06,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-04-12 06:49:06,983 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 10 treesize of output 9 [2018-04-12 06:49:06,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:06,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:07,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:49:07,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:85 [2018-04-12 06:49:07,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-04-12 06:49:07,021 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 10 treesize of output 9 [2018-04-12 06:49:07,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:07,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:07,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-12 06:49:07,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:98, output treesize:94 [2018-04-12 06:49:07,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 63 [2018-04-12 06:49:07,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:07,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-12 06:49:07,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:07,103 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 7 treesize of output 1 [2018-04-12 06:49:07,103 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:07,109 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:49:07,109 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 31 treesize of output 19 [2018-04-12 06:49:07,110 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:07,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:07,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:49:07,121 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:98, output treesize:28 [2018-04-12 06:49:07,164 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 20 not checked. [2018-04-12 06:49:07,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:49:07,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-12 06:49:07,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 06:49:07,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 06:49:07,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=376, Unknown=1, NotChecked=38, Total=462 [2018-04-12 06:49:07,165 INFO L87 Difference]: Start difference. First operand 233 states and 251 transitions. Second operand 22 states. [2018-04-12 06:49:08,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:49:08,696 INFO L93 Difference]: Finished difference Result 327 states and 351 transitions. [2018-04-12 06:49:08,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-12 06:49:08,697 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 72 [2018-04-12 06:49:08,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:49:08,698 INFO L225 Difference]: With dead ends: 327 [2018-04-12 06:49:08,698 INFO L226 Difference]: Without dead ends: 327 [2018-04-12 06:49:08,698 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=177, Invalid=1158, Unknown=1, NotChecked=70, Total=1406 [2018-04-12 06:49:08,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-04-12 06:49:08,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 261. [2018-04-12 06:49:08,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-04-12 06:49:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 285 transitions. [2018-04-12 06:49:08,701 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 285 transitions. Word has length 72 [2018-04-12 06:49:08,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:49:08,701 INFO L459 AbstractCegarLoop]: Abstraction has 261 states and 285 transitions. [2018-04-12 06:49:08,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 06:49:08,701 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 285 transitions. [2018-04-12 06:49:08,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-12 06:49:08,701 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:49:08,701 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:49:08,701 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:49:08,702 INFO L82 PathProgramCache]: Analyzing trace with hash 610363465, now seen corresponding path program 1 times [2018-04-12 06:49:08,702 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:49:08,702 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:49:08,702 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:49:08,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:49:08,702 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:49:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:49:08,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:49:08,720 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:49:08,721 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:49:08,721 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:49:08,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:49:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:49:08,773 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:49:08,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:49:08,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:08,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:08,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 06:49:08,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 11 [2018-04-12 06:49:08,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:08,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:08,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-12 06:49:08,829 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base|)) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| 1)))) is different from true [2018-04-12 06:49:08,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:08,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:08,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:08,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2018-04-12 06:49:08,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:08,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:49:08,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:27 [2018-04-12 06:49:08,956 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 13 treesize of output 10 [2018-04-12 06:49:08,958 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 10 treesize of output 9 [2018-04-12 06:49:08,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:08,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:08,973 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 13 treesize of output 10 [2018-04-12 06:49:08,975 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 10 treesize of output 9 [2018-04-12 06:49:08,975 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:08,977 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:08,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:49:08,988 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:47 [2018-04-12 06:49:09,027 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 23 treesize of output 53 [2018-04-12 06:49:09,030 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 36 treesize of output 35 [2018-04-12 06:49:09,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:09,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:09,080 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 38 treesize of output 48 [2018-04-12 06:49:09,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:09,085 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 34 treesize of output 45 [2018-04-12 06:49:09,085 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:09,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 35 treesize of output 34 [2018-04-12 06:49:09,104 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:09,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:09,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:49:09,130 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:73, output treesize:71 [2018-04-12 06:49:09,184 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 142 treesize of output 140 [2018-04-12 06:49:09,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:09,190 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 135 treesize of output 162 [2018-04-12 06:49:09,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:09,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:09,288 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 128 [2018-04-12 06:49:09,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:09,291 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 130 treesize of output 157 [2018-04-12 06:49:09,291 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:09,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:09,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:09,347 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 2 case distinctions, treesize of input 115 treesize of output 141 [2018-04-12 06:49:09,348 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-12 06:49:09,393 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 06:49:09,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-12 06:49:09,424 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:176, output treesize:269 [2018-04-12 06:49:09,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:09,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:09,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:09,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:09,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 201 [2018-04-12 06:49:09,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:09,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 06:49:09,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:314, output treesize:195 [2018-04-12 06:49:09,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:09,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-04-12 06:49:09,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:09,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:09,785 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:09,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:09,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:09,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:09,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2018-04-12 06:49:09,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:09,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:49:09,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:209, output treesize:163 [2018-04-12 06:49:09,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 156 [2018-04-12 06:49:09,954 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 10 treesize of output 9 [2018-04-12 06:49:09,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:09,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:10,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 135 [2018-04-12 06:49:10,008 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 10 treesize of output 9 [2018-04-12 06:49:10,008 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:10,022 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:10,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:49:10,050 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:189, output treesize:163 [2018-04-12 06:49:10,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 154 [2018-04-12 06:49:10,062 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 8 treesize of output 7 [2018-04-12 06:49:10,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:10,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:10,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 133 [2018-04-12 06:49:10,112 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 8 treesize of output 7 [2018-04-12 06:49:10,112 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:10,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:10,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 06:49:10,148 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:182, output treesize:174 [2018-04-12 06:49:10,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 119 [2018-04-12 06:49:10,197 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:49:10,198 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 77 treesize of output 57 [2018-04-12 06:49:10,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:10,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:10,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-04-12 06:49:10,210 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:10,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:10,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2018-04-12 06:49:10,237 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:49:10,238 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 0 case distinctions, treesize of input 53 treesize of output 33 [2018-04-12 06:49:10,238 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:10,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:10,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-12 06:49:10,250 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:10,254 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:10,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 06:49:10,263 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:185, output treesize:23 [2018-04-12 06:49:10,317 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 20 not checked. [2018-04-12 06:49:10,317 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 06:49:10,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-12 06:49:10,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-12 06:49:10,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-12 06:49:10,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=499, Unknown=1, NotChecked=44, Total=600 [2018-04-12 06:49:10,318 INFO L87 Difference]: Start difference. First operand 261 states and 285 transitions. Second operand 25 states. [2018-04-12 06:49:12,058 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 155 DAG size of output 106 [2018-04-12 06:49:12,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 06:49:12,610 INFO L93 Difference]: Finished difference Result 327 states and 351 transitions. [2018-04-12 06:49:12,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-12 06:49:12,610 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 72 [2018-04-12 06:49:12,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 06:49:12,611 INFO L225 Difference]: With dead ends: 327 [2018-04-12 06:49:12,611 INFO L226 Difference]: Without dead ends: 327 [2018-04-12 06:49:12,612 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=244, Invalid=1565, Unknown=1, NotChecked=82, Total=1892 [2018-04-12 06:49:12,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-04-12 06:49:12,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 261. [2018-04-12 06:49:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-04-12 06:49:12,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 284 transitions. [2018-04-12 06:49:12,615 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 284 transitions. Word has length 72 [2018-04-12 06:49:12,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 06:49:12,615 INFO L459 AbstractCegarLoop]: Abstraction has 261 states and 284 transitions. [2018-04-12 06:49:12,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-12 06:49:12,615 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 284 transitions. [2018-04-12 06:49:12,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-12 06:49:12,616 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 06:49:12,616 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 06:49:12,616 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-12 06:49:12,616 INFO L82 PathProgramCache]: Analyzing trace with hash 2062857170, now seen corresponding path program 1 times [2018-04-12 06:49:12,616 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-12 06:49:12,616 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-12 06:49:12,616 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:49:12,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:49:12,616 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 06:49:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:49:12,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 06:49:12,643 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-12 06:49:12,643 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 06:49:12,643 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-12 06:49:12,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 06:49:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 06:49:12,746 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 06:49:12,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:49:12,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:12,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 06:49:12,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:12,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:12,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-12 06:49:12,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:12,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-12 06:49:12,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:12,809 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:12,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:12,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 06:49:12,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:12,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:12,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:34 [2018-04-12 06:49:12,849 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 11 treesize of output 8 [2018-04-12 06:49:12,852 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 8 treesize of output 7 [2018-04-12 06:49:12,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:12,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:12,869 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 11 treesize of output 8 [2018-04-12 06:49:12,870 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 8 treesize of output 7 [2018-04-12 06:49:12,871 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:12,872 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:12,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:12,884 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:48 [2018-04-12 06:49:12,902 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 21 treesize of output 16 [2018-04-12 06:49:12,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:12,905 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 16 treesize of output 23 [2018-04-12 06:49:12,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:12,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:12,926 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 21 treesize of output 16 [2018-04-12 06:49:12,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:12,928 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 16 treesize of output 23 [2018-04-12 06:49:12,928 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:12,932 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:12,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:12,945 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:74, output treesize:66 [2018-04-12 06:49:42,114 WARN L151 SmtUtils]: Spent 244ms on a formula simplification. DAG size of input: 99 DAG size of output 80 [2018-04-12 06:49:42,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:42,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:42,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:42,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 34 [2018-04-12 06:49:42,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:42,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:42,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:42,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:42,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-04-12 06:49:42,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:42,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:42,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:42,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 60 [2018-04-12 06:49:42,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-04-12 06:49:42,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:42,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 06:49:42,340 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:42,350 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:42,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:42,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:42,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 60 [2018-04-12 06:49:42,392 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-04-12 06:49:42,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:42,396 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 18 treesize of output 27 [2018-04-12 06:49:42,396 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 06:49:42,404 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:42,421 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:42,435 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 06:49:42,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:42,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:42,497 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:49:42,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 89 [2018-04-12 06:49:42,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 06:49:42,502 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 06:49:42,502 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_165 term size 22 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:69) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:408) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:417) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:363) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-04-12 06:49:42,505 INFO L168 Benchmark]: Toolchain (without parser) took 539878.13 ms. Allocated memory was 352.3 MB in the beginning and 671.6 MB in the end (delta: 319.3 MB). Free memory was 294.5 MB in the beginning and 278.1 MB in the end (delta: 16.4 MB). Peak memory consumption was 335.7 MB. Max. memory is 5.3 GB. [2018-04-12 06:49:42,506 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 352.3 MB. Free memory is still 320.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 06:49:42,506 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.42 ms. Allocated memory is still 352.3 MB. Free memory was 294.5 MB in the beginning and 267.1 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 5.3 GB. [2018-04-12 06:49:42,506 INFO L168 Benchmark]: Boogie Preprocessor took 46.42 ms. Allocated memory is still 352.3 MB. Free memory was 267.1 MB in the beginning and 264.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-12 06:49:42,506 INFO L168 Benchmark]: RCFGBuilder took 509.17 ms. Allocated memory was 352.3 MB in the beginning and 470.8 MB in the end (delta: 118.5 MB). Free memory was 264.4 MB in the beginning and 387.6 MB in the end (delta: -123.2 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. [2018-04-12 06:49:42,507 INFO L168 Benchmark]: TraceAbstraction took 539051.60 ms. Allocated memory was 470.8 MB in the beginning and 671.6 MB in the end (delta: 200.8 MB). Free memory was 387.6 MB in the beginning and 278.1 MB in the end (delta: 109.6 MB). Peak memory consumption was 310.4 MB. Max. memory is 5.3 GB. [2018-04-12 06:49:42,508 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 352.3 MB. Free memory is still 320.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 268.42 ms. Allocated memory is still 352.3 MB. Free memory was 294.5 MB in the beginning and 267.1 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 46.42 ms. Allocated memory is still 352.3 MB. Free memory was 267.1 MB in the beginning and 264.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 509.17 ms. Allocated memory was 352.3 MB in the beginning and 470.8 MB in the end (delta: 118.5 MB). Free memory was 264.4 MB in the beginning and 387.6 MB in the end (delta: -123.2 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 539051.60 ms. Allocated memory was 470.8 MB in the beginning and 671.6 MB in the end (delta: 200.8 MB). Free memory was 387.6 MB in the beginning and 278.1 MB in the end (delta: 109.6 MB). Peak memory consumption was 310.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_165 term size 22 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_165 term size 22: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-12_06-49-42-514.csv Received shutdown request...