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_Camel.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/length_test03_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-12 13:49:54,764 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 13:49:54,765 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 13:49:54,776 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 13:49:54,776 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 13:49:54,777 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 13:49:54,777 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 13:49:54,779 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 13:49:54,780 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 13:49:54,781 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 13:49:54,781 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 13:49:54,782 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 13:49:54,783 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 13:49:54,783 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 13:49:54,784 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 13:49:54,786 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 13:49:54,788 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 13:49:54,789 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 13:49:54,790 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 13:49:54,791 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 13:49:54,793 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 13:49:54,793 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 13:49:54,793 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 13:49:54,794 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 13:49:54,795 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 13:49:54,796 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 13:49:54,796 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 13:49:54,797 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 13:49:54,797 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 13:49:54,797 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 13:49:54,798 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 13:49:54,798 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-12 13:49:54,808 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 13:49:54,808 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 13:49:54,809 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-12 13:49:54,809 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-12 13:49:54,809 INFO L133 SettingsManager]: * Use SBE=true [2018-04-12 13:49:54,810 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 13:49:54,810 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 13:49:54,810 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 13:49:54,810 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 13:49:54,810 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 13:49:54,810 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 13:49:54,810 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 13:49:54,811 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-12 13:49:54,811 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 13:49:54,811 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 13:49:54,811 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 13:49:54,811 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-12 13:49:54,811 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-12 13:49:54,811 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 13:49:54,812 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 13:49:54,812 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 13:49:54,812 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-12 13:49:54,812 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-12 13:49:54,812 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-12 13:49:54,841 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 13:49:54,851 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 13:49:54,854 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 13:49:54,855 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 13:49:54,856 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 13:49:54,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,216 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe637dd4b4 [2018-04-12 13:49:55,334 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 13:49:55,335 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 13:49:55,335 INFO L168 CDTParser]: Scanning length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,342 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 13:49:55,342 INFO L215 ultiparseSymbolTable]: [2018-04-12 13:49:55,342 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 13:49:55,342 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flength_test___false_valid_memtrack_i____bswap_32 ('__bswap_32') in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,342 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flength_test___false_valid_memtrack_i____bswap_64 ('__bswap_64') in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,342 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flength_test___false_valid_memtrack_i__append ('append') in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,343 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,343 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 13:49:55,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__gid_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__off_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____blkcnt64_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__ldiv_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____nlink_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_short in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____int8_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_int64_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____mode_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____timer_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____uid_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__ssize_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____sig_atomic_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__key_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____ssize_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__nlink_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__fsfilcnt_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__timer_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__mode_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fsword_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____u_short in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__int32_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____uint64_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pid_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____clockid_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_int8_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____suseconds_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__clockid_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____pthread_slist_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__quad_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__caddr_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fd_mask in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____id_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_int in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_int16_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____syscall_ulong_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_cond_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____int32_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____uint32_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__div_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__blksize_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_spinlock_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__fsblkcnt_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__size_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____pid_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_once_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____u_quad_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____intptr_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_mutexattr_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____u_char in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____off64_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____quad_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fsblkcnt64_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____socklen_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__lldiv_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__uid_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__int16_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_barrier_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_attr_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__wchar_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____rlim_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____int16_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_rwlockattr_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_char in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__daddr_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__blkcnt_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__sigset_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____uint16_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____u_long in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____gid_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____ino_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____loff_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____ino64_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____sigset_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_int32_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fsid_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____dev_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__ulong in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_long in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__suseconds_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__fd_mask in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__clock_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____caddr_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____off_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__fd_set in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__dev_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____rlim64_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____key_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__loff_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__uint in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____uint8_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__time_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_rwlock_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____u_int in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__fsid_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____qaddr_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____blkcnt_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____clock_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____daddr_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__id_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__int64_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____blksize_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_condattr_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__ushort in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____syscall_slong_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_quad_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fsfilcnt_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____time_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__int8_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_key_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fsblkcnt_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__register_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____int64_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_barrierattr_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fsfilcnt64_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_mutex_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__ino_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,351 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____useconds_t in length_test03_false-valid-memtrack.i [2018-04-12 13:49:55,363 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe637dd4b4 [2018-04-12 13:49:55,367 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 13:49:55,367 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 13:49:55,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 13:49:55,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 13:49:55,371 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 13:49:55,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 01:49:55" (1/1) ... [2018-04-12 13:49:55,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f18cecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:49:55, skipping insertion in model container [2018-04-12 13:49:55,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 01:49:55" (1/1) ... [2018-04-12 13:49:55,383 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 13:49:55,410 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 13:49:55,545 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 13:49:55,584 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 13:49:55,590 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 119 non ball SCCs. Number of states in SCCs 119. [2018-04-12 13:49:55,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:49:55 WrapperNode [2018-04-12 13:49:55,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 13:49:55,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 13:49:55,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 13:49:55,631 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 13:49:55,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:49:55" (1/1) ... [2018-04-12 13:49:55,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:49:55" (1/1) ... [2018-04-12 13:49:55,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:49:55" (1/1) ... [2018-04-12 13:49:55,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:49:55" (1/1) ... [2018-04-12 13:49:55,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:49:55" (1/1) ... [2018-04-12 13:49:55,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:49:55" (1/1) ... [2018-04-12 13:49:55,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:49:55" (1/1) ... [2018-04-12 13:49:55,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 13:49:55,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 13:49:55,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 13:49:55,669 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 13:49:55,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:49:55" (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 13:49:55,752 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 13:49:55,752 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 13:49:55,752 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___false_valid_memtrack_i____bswap_32 [2018-04-12 13:49:55,752 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___false_valid_memtrack_i____bswap_64 [2018-04-12 13:49:55,752 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___false_valid_memtrack_i__append [2018-04-12 13:49:55,753 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 13:49:55,753 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-12 13:49:55,753 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-12 13:49:55,753 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-12 13:49:55,753 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-12 13:49:55,753 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-12 13:49:55,753 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-12 13:49:55,753 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-12 13:49:55,753 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-12 13:49:55,753 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-12 13:49:55,753 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-12 13:49:55,753 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-12 13:49:55,754 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-12 13:49:55,754 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-12 13:49:55,754 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-12 13:49:55,754 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-12 13:49:55,754 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-12 13:49:55,754 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-12 13:49:55,754 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___false_valid_memtrack_i____bswap_32 [2018-04-12 13:49:55,754 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___false_valid_memtrack_i____bswap_64 [2018-04-12 13:49:55,755 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-12 13:49:55,755 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-12 13:49:55,755 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-12 13:49:55,755 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-12 13:49:55,755 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-12 13:49:55,755 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-12 13:49:55,755 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-12 13:49:55,755 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-12 13:49:55,755 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-12 13:49:55,756 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-12 13:49:55,756 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-12 13:49:55,756 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-12 13:49:55,756 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-12 13:49:55,756 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-12 13:49:55,756 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-12 13:49:55,756 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-12 13:49:55,756 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-12 13:49:55,756 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-12 13:49:55,757 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-12 13:49:55,757 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-12 13:49:55,757 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-12 13:49:55,757 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-12 13:49:55,757 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-12 13:49:55,757 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-12 13:49:55,757 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-12 13:49:55,757 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-12 13:49:55,757 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-12 13:49:55,758 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-12 13:49:55,758 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-12 13:49:55,758 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-12 13:49:55,758 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-12 13:49:55,758 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-12 13:49:55,758 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-12 13:49:55,758 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-12 13:49:55,758 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-12 13:49:55,758 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-12 13:49:55,758 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-12 13:49:55,759 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-12 13:49:55,759 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-12 13:49:55,759 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-12 13:49:55,759 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-12 13:49:55,759 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-12 13:49:55,759 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-12 13:49:55,759 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-12 13:49:55,759 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-12 13:49:55,759 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-12 13:49:55,759 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-12 13:49:55,760 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-12 13:49:55,760 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-12 13:49:55,760 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-12 13:49:55,760 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-12 13:49:55,760 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-12 13:49:55,760 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-12 13:49:55,760 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-12 13:49:55,760 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-12 13:49:55,760 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-12 13:49:55,760 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-12 13:49:55,761 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-12 13:49:55,761 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-12 13:49:55,761 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-12 13:49:55,761 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-12 13:49:55,761 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-12 13:49:55,761 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-12 13:49:55,761 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-12 13:49:55,761 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-12 13:49:55,761 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-12 13:49:55,761 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-12 13:49:55,761 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-12 13:49:55,762 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-12 13:49:55,762 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-12 13:49:55,762 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-12 13:49:55,762 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-12 13:49:55,762 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-12 13:49:55,762 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-12 13:49:55,762 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-12 13:49:55,762 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-12 13:49:55,762 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-12 13:49:55,762 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-12 13:49:55,763 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-12 13:49:55,763 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-12 13:49:55,763 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-12 13:49:55,763 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-12 13:49:55,763 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-12 13:49:55,763 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-12 13:49:55,763 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-12 13:49:55,763 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-12 13:49:55,763 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-12 13:49:55,763 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-04-12 13:49:55,763 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-12 13:49:55,764 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___false_valid_memtrack_i__append [2018-04-12 13:49:55,764 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-12 13:49:55,764 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-12 13:49:55,764 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-12 13:49:55,764 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-12 13:49:55,764 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 13:49:55,764 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-12 13:49:55,764 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 13:49:55,764 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 13:49:55,764 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-12 13:49:55,764 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-12 13:49:56,146 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 13:49:56,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 01:49:56 BoogieIcfgContainer [2018-04-12 13:49:56,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 13:49:56,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 13:49:56,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 13:49:56,150 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 13:49:56,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 01:49:55" (1/3) ... [2018-04-12 13:49:56,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab6b051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 01:49:56, skipping insertion in model container [2018-04-12 13:49:56,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:49:55" (2/3) ... [2018-04-12 13:49:56,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab6b051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 01:49:56, skipping insertion in model container [2018-04-12 13:49:56,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 01:49:56" (3/3) ... [2018-04-12 13:49:56,153 INFO L107 eAbstractionObserver]: Analyzing ICFG length_test03_false-valid-memtrack.i [2018-04-12 13:49:56,160 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-12 13:49:56,168 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-04-12 13:49:56,201 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 13:49:56,202 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 13:49:56,202 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-12 13:49:56,202 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-12 13:49:56,202 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-12 13:49:56,202 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 13:49:56,202 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 13:49:56,203 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 13:49:56,203 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 13:49:56,203 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 13:49:56,213 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2018-04-12 13:49:56,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 13:49:56,218 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:49:56,219 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:49:56,219 INFO L408 AbstractCegarLoop]: === Iteration 1 === [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, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-12 13:49:56,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1465942715, now seen corresponding path program 1 times [2018-04-12 13:49:56,223 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:49:56,223 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:49:56,251 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:49:56,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:49:56,251 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:49:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:49:56,279 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:49:56,328 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 13:49:56,330 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:49:56,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:49:56,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:49:56,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:49:56,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:49:56,345 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 4 states. [2018-04-12 13:49:56,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:49:56,524 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2018-04-12 13:49:56,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 13:49:56,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 13:49:56,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:49:56,542 INFO L225 Difference]: With dead ends: 175 [2018-04-12 13:49:56,542 INFO L226 Difference]: Without dead ends: 172 [2018-04-12 13:49:56,544 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 13:49:56,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-12 13:49:56,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 134. [2018-04-12 13:49:56,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-12 13:49:56,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2018-04-12 13:49:56,583 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 140 transitions. Word has length 8 [2018-04-12 13:49:56,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:49:56,583 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 140 transitions. [2018-04-12 13:49:56,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:49:56,583 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2018-04-12 13:49:56,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 13:49:56,584 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:49:56,584 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:49:56,584 INFO L408 AbstractCegarLoop]: === Iteration 2 === [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, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-12 13:49:56,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1465942716, now seen corresponding path program 1 times [2018-04-12 13:49:56,584 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:49:56,584 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:49:56,585 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:49:56,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:49:56,585 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:49:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:49:56,597 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:49:56,629 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 13:49:56,629 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:49:56,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:49:56,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:49:56,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:49:56,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:49:56,631 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. Second operand 4 states. [2018-04-12 13:49:56,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:49:56,764 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2018-04-12 13:49:56,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 13:49:56,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 13:49:56,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:49:56,766 INFO L225 Difference]: With dead ends: 134 [2018-04-12 13:49:56,766 INFO L226 Difference]: Without dead ends: 134 [2018-04-12 13:49:56,766 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 13:49:56,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-12 13:49:56,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-04-12 13:49:56,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-04-12 13:49:56,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 138 transitions. [2018-04-12 13:49:56,774 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 138 transitions. Word has length 8 [2018-04-12 13:49:56,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:49:56,775 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 138 transitions. [2018-04-12 13:49:56,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:49:56,775 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 138 transitions. [2018-04-12 13:49:56,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-12 13:49:56,775 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:49:56,775 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:49:56,775 INFO L408 AbstractCegarLoop]: === Iteration 3 === [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, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-12 13:49:56,776 INFO L82 PathProgramCache]: Analyzing trace with hash -643063297, now seen corresponding path program 1 times [2018-04-12 13:49:56,776 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:49:56,776 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:49:56,776 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:49:56,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:49:56,777 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:49:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:49:56,788 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:49:56,805 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 13:49:56,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:49:56,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:49:56,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:49:56,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:49:56,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:49:56,806 INFO L87 Difference]: Start difference. First operand 132 states and 138 transitions. Second operand 4 states. [2018-04-12 13:49:56,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:49:56,891 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2018-04-12 13:49:56,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 13:49:56,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-12 13:49:56,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:49:56,896 INFO L225 Difference]: With dead ends: 148 [2018-04-12 13:49:56,896 INFO L226 Difference]: Without dead ends: 148 [2018-04-12 13:49:56,896 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 13:49:56,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-12 13:49:56,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 135. [2018-04-12 13:49:56,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-04-12 13:49:56,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 143 transitions. [2018-04-12 13:49:56,903 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 143 transitions. Word has length 12 [2018-04-12 13:49:56,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:49:56,904 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 143 transitions. [2018-04-12 13:49:56,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:49:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 143 transitions. [2018-04-12 13:49:56,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-12 13:49:56,904 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:49:56,904 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:49:56,905 INFO L408 AbstractCegarLoop]: === Iteration 4 === [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, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-12 13:49:56,905 INFO L82 PathProgramCache]: Analyzing trace with hash -643063296, now seen corresponding path program 1 times [2018-04-12 13:49:56,905 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:49:56,905 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:49:56,906 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:49:56,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:49:56,906 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:49:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:49:56,916 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:49:56,939 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 13:49:56,939 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:49:56,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:49:56,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:49:56,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:49:56,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:49:56,940 INFO L87 Difference]: Start difference. First operand 135 states and 143 transitions. Second operand 4 states. [2018-04-12 13:49:57,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:49:57,013 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-04-12 13:49:57,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 13:49:57,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-12 13:49:57,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:49:57,014 INFO L225 Difference]: With dead ends: 135 [2018-04-12 13:49:57,014 INFO L226 Difference]: Without dead ends: 135 [2018-04-12 13:49:57,014 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 13:49:57,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-12 13:49:57,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2018-04-12 13:49:57,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-12 13:49:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-04-12 13:49:57,020 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 12 [2018-04-12 13:49:57,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:49:57,021 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-04-12 13:49:57,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:49:57,021 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-04-12 13:49:57,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-12 13:49:57,021 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:49:57,021 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 13:49:57,022 INFO L408 AbstractCegarLoop]: === Iteration 5 === [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, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-12 13:49:57,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1451976942, now seen corresponding path program 1 times [2018-04-12 13:49:57,022 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:49:57,022 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:49:57,023 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:49:57,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:49:57,023 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:49:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:49:57,037 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:49:57,057 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 13:49:57,057 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:49:57,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:49:57,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:49:57,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:49:57,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:49:57,058 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 4 states. [2018-04-12 13:49:57,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:49:57,127 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-04-12 13:49:57,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 13:49:57,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-12 13:49:57,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:49:57,128 INFO L225 Difference]: With dead ends: 128 [2018-04-12 13:49:57,128 INFO L226 Difference]: Without dead ends: 128 [2018-04-12 13:49:57,128 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 13:49:57,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-12 13:49:57,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-04-12 13:49:57,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-12 13:49:57,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-04-12 13:49:57,133 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 20 [2018-04-12 13:49:57,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:49:57,133 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-04-12 13:49:57,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:49:57,134 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-04-12 13:49:57,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-12 13:49:57,134 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:49:57,134 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 13:49:57,134 INFO L408 AbstractCegarLoop]: === Iteration 6 === [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, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-12 13:49:57,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1451976941, now seen corresponding path program 1 times [2018-04-12 13:49:57,135 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:49:57,135 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:49:57,135 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:49:57,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:49:57,136 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:49:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:49:57,148 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:49:57,178 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 13:49:57,179 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:49:57,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:49:57,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:49:57,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:49:57,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:49:57,180 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 4 states. [2018-04-12 13:49:57,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:49:57,231 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-04-12 13:49:57,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 13:49:57,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-12 13:49:57,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:49:57,232 INFO L225 Difference]: With dead ends: 123 [2018-04-12 13:49:57,232 INFO L226 Difference]: Without dead ends: 123 [2018-04-12 13:49:57,232 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 13:49:57,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-12 13:49:57,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-04-12 13:49:57,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-12 13:49:57,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-04-12 13:49:57,236 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 20 [2018-04-12 13:49:57,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:49:57,236 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-04-12 13:49:57,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:49:57,237 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-04-12 13:49:57,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-12 13:49:57,237 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:49:57,237 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 13:49:57,237 INFO L408 AbstractCegarLoop]: === Iteration 7 === [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, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-12 13:49:57,237 INFO L82 PathProgramCache]: Analyzing trace with hash -2061612264, now seen corresponding path program 1 times [2018-04-12 13:49:57,238 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:49:57,238 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:49:57,238 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:49:57,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:49:57,239 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:49:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:49:57,253 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:49:57,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:49:57,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:49:57,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 13:49:57,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 13:49:57,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 13:49:57,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-12 13:49:57,299 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 8 states. [2018-04-12 13:49:57,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:49:57,479 INFO L93 Difference]: Finished difference Result 230 states and 245 transitions. [2018-04-12 13:49:57,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 13:49:57,479 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-04-12 13:49:57,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:49:57,480 INFO L225 Difference]: With dead ends: 230 [2018-04-12 13:49:57,480 INFO L226 Difference]: Without dead ends: 230 [2018-04-12 13:49:57,480 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-04-12 13:49:57,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-04-12 13:49:57,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 144. [2018-04-12 13:49:57,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-12 13:49:57,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 164 transitions. [2018-04-12 13:49:57,484 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 164 transitions. Word has length 21 [2018-04-12 13:49:57,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:49:57,484 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 164 transitions. [2018-04-12 13:49:57,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 13:49:57,484 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 164 transitions. [2018-04-12 13:49:57,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-12 13:49:57,485 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:49:57,485 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 13:49:57,485 INFO L408 AbstractCegarLoop]: === Iteration 8 === [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, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-12 13:49:57,485 INFO L82 PathProgramCache]: Analyzing trace with hash -2061612263, now seen corresponding path program 1 times [2018-04-12 13:49:57,485 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:49:57,485 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:49:57,485 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:49:57,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:49:57,486 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:49:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:49:57,498 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:49:57,599 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 13:49:57,600 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:49:57,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-12 13:49:57,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 13:49:57,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 13:49:57,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-04-12 13:49:57,601 INFO L87 Difference]: Start difference. First operand 144 states and 164 transitions. Second operand 9 states. [2018-04-12 13:49:57,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:49:57,837 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2018-04-12 13:49:57,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 13:49:57,837 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-04-12 13:49:57,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:49:57,838 INFO L225 Difference]: With dead ends: 205 [2018-04-12 13:49:57,838 INFO L226 Difference]: Without dead ends: 205 [2018-04-12 13:49:57,838 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-04-12 13:49:57,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-04-12 13:49:57,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 178. [2018-04-12 13:49:57,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-12 13:49:57,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 210 transitions. [2018-04-12 13:49:57,842 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 210 transitions. Word has length 21 [2018-04-12 13:49:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:49:57,843 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 210 transitions. [2018-04-12 13:49:57,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 13:49:57,843 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 210 transitions. [2018-04-12 13:49:57,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-12 13:49:57,843 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:49:57,843 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 13:49:57,844 INFO L408 AbstractCegarLoop]: === Iteration 9 === [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, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-12 13:49:57,844 INFO L82 PathProgramCache]: Analyzing trace with hash 945598509, now seen corresponding path program 1 times [2018-04-12 13:49:57,844 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:49:57,844 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:49:57,844 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:49:57,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:49:57,845 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:49:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:49:57,861 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:49:58,000 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 13:49:58,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:49:58,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-12 13:49:58,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 13:49:58,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 13:49:58,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-04-12 13:49:58,002 INFO L87 Difference]: Start difference. First operand 178 states and 210 transitions. Second operand 11 states. [2018-04-12 13:49:58,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:49:58,366 INFO L93 Difference]: Finished difference Result 199 states and 233 transitions. [2018-04-12 13:49:58,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 13:49:58,366 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-04-12 13:49:58,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:49:58,373 INFO L225 Difference]: With dead ends: 199 [2018-04-12 13:49:58,373 INFO L226 Difference]: Without dead ends: 199 [2018-04-12 13:49:58,373 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-04-12 13:49:58,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-04-12 13:49:58,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 187. [2018-04-12 13:49:58,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-04-12 13:49:58,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 220 transitions. [2018-04-12 13:49:58,379 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 220 transitions. Word has length 30 [2018-04-12 13:49:58,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:49:58,379 INFO L459 AbstractCegarLoop]: Abstraction has 187 states and 220 transitions. [2018-04-12 13:49:58,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 13:49:58,379 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 220 transitions. [2018-04-12 13:49:58,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-12 13:49:58,380 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:49:58,380 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 13:49:58,380 INFO L408 AbstractCegarLoop]: === Iteration 10 === [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, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-12 13:49:58,380 INFO L82 PathProgramCache]: Analyzing trace with hash 548364848, now seen corresponding path program 1 times [2018-04-12 13:49:58,380 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:49:58,381 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:49:58,381 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:49:58,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:49:58,381 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:49:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:49:58,398 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:49:58,730 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 13:49:58,730 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:49:58,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-04-12 13:49:58,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-12 13:49:58,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-12 13:49:58,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-04-12 13:49:58,731 INFO L87 Difference]: Start difference. First operand 187 states and 220 transitions. Second operand 14 states. [2018-04-12 13:49:59,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:49:59,193 INFO L93 Difference]: Finished difference Result 248 states and 298 transitions. [2018-04-12 13:49:59,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-12 13:49:59,193 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-04-12 13:49:59,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:49:59,194 INFO L225 Difference]: With dead ends: 248 [2018-04-12 13:49:59,194 INFO L226 Difference]: Without dead ends: 248 [2018-04-12 13:49:59,194 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2018-04-12 13:49:59,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-04-12 13:49:59,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 155. [2018-04-12 13:49:59,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-12 13:49:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 168 transitions. [2018-04-12 13:49:59,197 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 168 transitions. Word has length 32 [2018-04-12 13:49:59,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:49:59,197 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 168 transitions. [2018-04-12 13:49:59,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-12 13:49:59,197 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 168 transitions. [2018-04-12 13:49:59,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-12 13:49:59,197 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:49:59,198 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, 1, 1] [2018-04-12 13:49:59,198 INFO L408 AbstractCegarLoop]: === Iteration 11 === [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, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-12 13:49:59,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1723783449, now seen corresponding path program 1 times [2018-04-12 13:49:59,198 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:49:59,198 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:49:59,198 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:49:59,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:49:59,199 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:49:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:49:59,208 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:49:59,268 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 13:49:59,268 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:49:59,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:49:59,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 13:49:59,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 13:49:59,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 13:49:59,269 INFO L87 Difference]: Start difference. First operand 155 states and 168 transitions. Second operand 3 states. [2018-04-12 13:49:59,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:49:59,276 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2018-04-12 13:49:59,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 13:49:59,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-04-12 13:49:59,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:49:59,277 INFO L225 Difference]: With dead ends: 164 [2018-04-12 13:49:59,277 INFO L226 Difference]: Without dead ends: 164 [2018-04-12 13:49:59,278 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 13:49:59,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-12 13:49:59,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2018-04-12 13:49:59,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-04-12 13:49:59,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2018-04-12 13:49:59,281 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 161 transitions. Word has length 40 [2018-04-12 13:49:59,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:49:59,281 INFO L459 AbstractCegarLoop]: Abstraction has 151 states and 161 transitions. [2018-04-12 13:49:59,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 13:49:59,281 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 161 transitions. [2018-04-12 13:49:59,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-12 13:49:59,282 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:49:59,282 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 13:49:59,282 INFO L408 AbstractCegarLoop]: === Iteration 12 === [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, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-12 13:49:59,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1911230466, now seen corresponding path program 1 times [2018-04-12 13:49:59,283 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:49:59,283 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:49:59,283 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:49:59,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:49:59,284 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:49:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:49:59,296 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:49:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:49:59,374 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:49:59,374 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:49:59,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:49:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:49:59,445 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:49:59,539 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 13:49:59,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:49:59,543 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 13:49:59,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-04-12 13:49:59,563 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 13:49:59,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:49:59,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:49:59,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-12 13:49:59,614 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:49:59,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:49:59,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-04-12 13:49:59,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-12 13:49:59,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-12 13:49:59,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=193, Unknown=6, NotChecked=0, Total=240 [2018-04-12 13:49:59,645 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. Second operand 16 states. [2018-04-12 13:50:00,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:50:00,212 INFO L93 Difference]: Finished difference Result 190 states and 199 transitions. [2018-04-12 13:50:00,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 13:50:00,212 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-04-12 13:50:00,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:50:00,213 INFO L225 Difference]: With dead ends: 190 [2018-04-12 13:50:00,213 INFO L226 Difference]: Without dead ends: 190 [2018-04-12 13:50:00,214 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=506, Unknown=7, NotChecked=0, Total=650 [2018-04-12 13:50:00,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-04-12 13:50:00,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 153. [2018-04-12 13:50:00,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-12 13:50:00,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2018-04-12 13:50:00,218 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 43 [2018-04-12 13:50:00,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:50:00,218 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2018-04-12 13:50:00,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-12 13:50:00,218 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2018-04-12 13:50:00,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-12 13:50:00,219 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:50:00,219 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 13:50:00,219 INFO L408 AbstractCegarLoop]: === Iteration 13 === [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, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-12 13:50:00,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1911230465, now seen corresponding path program 1 times [2018-04-12 13:50:00,220 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:50:00,220 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:50:00,220 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:50:00,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:50:00,221 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:50:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:50:00,238 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:50:00,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:50:00,372 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:50:00,372 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:50:00,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:50:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:50:00,400 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:50:00,456 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base Int)) (= |c_#length| (store |c_old(#length)| __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base 9))) is different from true [2018-04-12 13:50:00,469 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 20 [2018-04-12 13:50:00,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-12 13:50:00,476 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 13:50:00,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:19 [2018-04-12 13:50:00,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 33 [2018-04-12 13:50:00,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-12 13:50:00,547 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 13:50:00,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-04-12 13:50:00,570 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-12 13:50:00,587 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:50:00,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-04-12 13:50:00,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 13:50:00,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 13:50:00,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=367, Unknown=1, NotChecked=38, Total=462 [2018-04-12 13:50:00,588 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand 22 states. [2018-04-12 13:50:01,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:50:01,381 INFO L93 Difference]: Finished difference Result 212 states and 225 transitions. [2018-04-12 13:50:01,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-12 13:50:01,381 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-04-12 13:50:01,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:50:01,382 INFO L225 Difference]: With dead ends: 212 [2018-04-12 13:50:01,382 INFO L226 Difference]: Without dead ends: 212 [2018-04-12 13:50:01,383 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=1026, Unknown=1, NotChecked=66, Total=1260 [2018-04-12 13:50:01,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-12 13:50:01,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 180. [2018-04-12 13:50:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-12 13:50:01,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 197 transitions. [2018-04-12 13:50:01,387 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 197 transitions. Word has length 43 [2018-04-12 13:50:01,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:50:01,387 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 197 transitions. [2018-04-12 13:50:01,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 13:50:01,388 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 197 transitions. [2018-04-12 13:50:01,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-12 13:50:01,388 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:50:01,388 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 13:50:01,388 INFO L408 AbstractCegarLoop]: === Iteration 14 === [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, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-12 13:50:01,389 INFO L82 PathProgramCache]: Analyzing trace with hash 771137816, now seen corresponding path program 1 times [2018-04-12 13:50:01,389 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:50:01,389 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:50:01,389 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:50:01,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:50:01,390 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:50:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:50:01,410 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:50:01,865 WARN L151 SmtUtils]: Spent 181ms on a formula simplification. DAG size of input: 28 DAG size of output 27 [2018-04-12 13:50:02,211 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 13:50:02,211 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:50:02,211 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:50:02,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:50:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:50:02,262 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:50:02,316 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 13:50:02,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:02,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:02,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-12 13:50:02,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 13:50:02,557 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 13:50:02,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:02,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:02,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:02,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-12 13:50:02,621 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 13:50:02,624 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 13:50:02,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:02,651 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 13:50:02,652 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 13:50:02,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 13:50:02,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 13:50:02,671 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:70 [2018-04-12 13:50:02,740 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 68 treesize of output 65 [2018-04-12 13:50:02,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:02,744 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 13:50:02,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:02,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:02,770 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 3 case distinctions, treesize of input 43 treesize of output 54 [2018-04-12 13:50:02,771 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 13:50:02,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 13:50:02,810 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 33 treesize of output 28 [2018-04-12 13:50:02,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:02,813 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 13:50:02,813 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:02,819 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:02,836 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 3 xjuncts. [2018-04-12 13:50:02,836 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:102, output treesize:115 [2018-04-12 13:50:02,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:02,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:02,903 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 66 treesize of output 60 [2018-04-12 13:50:02,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:02,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:50:02,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:139, output treesize:60 [2018-04-12 13:50:03,047 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:03,047 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:03,048 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:03,049 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 58 [2018-04-12 13:50:03,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:03,063 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 13:50:03,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:74, output treesize:82 [2018-04-12 13:50:03,238 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 13:50:03,241 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 13:50:03,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:03,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:03,274 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 13:50:03,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:85 [2018-04-12 13:50:03,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, 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 13:50:03,338 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 13:50:03,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:03,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:03,359 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 13:50:03,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:98, output treesize:94 [2018-04-12 13:50:03,416 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 80 treesize of output 65 [2018-04-12 13:50:03,419 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 13:50:03,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:03,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:03,429 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 13:50:03,429 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:03,435 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:50:03,436 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 33 treesize of output 21 [2018-04-12 13:50:03,436 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:03,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:03,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:50:03,447 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:103, output treesize:28 [2018-04-12 13:50:03,485 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 13:50:03,503 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:50:03,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 41 [2018-04-12 13:50:03,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-12 13:50:03,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-12 13:50:03,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1591, Unknown=0, NotChecked=0, Total=1722 [2018-04-12 13:50:03,504 INFO L87 Difference]: Start difference. First operand 180 states and 197 transitions. Second operand 42 states. [2018-04-12 13:50:09,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:50:09,898 INFO L93 Difference]: Finished difference Result 248 states and 270 transitions. [2018-04-12 13:50:09,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-12 13:50:09,898 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 50 [2018-04-12 13:50:09,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:50:09,899 INFO L225 Difference]: With dead ends: 248 [2018-04-12 13:50:09,899 INFO L226 Difference]: Without dead ends: 248 [2018-04-12 13:50:09,900 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1267 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=620, Invalid=4492, Unknown=0, NotChecked=0, Total=5112 [2018-04-12 13:50:09,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-04-12 13:50:09,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 186. [2018-04-12 13:50:09,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-12 13:50:09,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 201 transitions. [2018-04-12 13:50:09,905 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 201 transitions. Word has length 50 [2018-04-12 13:50:09,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:50:09,905 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 201 transitions. [2018-04-12 13:50:09,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-12 13:50:09,905 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 201 transitions. [2018-04-12 13:50:09,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-12 13:50:09,906 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:50:09,906 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 13:50:09,906 INFO L408 AbstractCegarLoop]: === Iteration 15 === [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, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-12 13:50:09,907 INFO L82 PathProgramCache]: Analyzing trace with hash 771137817, now seen corresponding path program 1 times [2018-04-12 13:50:09,907 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:50:09,907 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:50:09,907 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:50:09,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:50:09,907 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:50:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:50:09,930 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:50:10,445 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 13:50:10,446 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:50:10,446 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:50:10,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:50:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:50:10,479 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:50:10,556 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 13:50:10,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:10,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:10,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-12 13:50:10,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 6 treesize of output 5 [2018-04-12 13:50:10,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:10,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:10,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-04-12 13:50:10,703 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 13:50:10,704 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 13:50:10,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:10,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:10,714 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 13:50:10,715 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 13:50:10,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:10,717 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:10,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:10,721 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-12 13:50:10,760 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 13:50:10,768 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 13:50:10,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 13:50:10,783 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 13:50:10,784 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:10,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 13:50:10,823 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 13:50:10,827 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 13:50:10,827 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:10,853 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 13:50:10,854 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-12 13:50:10,863 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 13:50:10,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-12 13:50:10,883 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:60, output treesize:203 [2018-04-12 13:50:10,970 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 72 treesize of output 67 [2018-04-12 13:50:10,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:10,974 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 13:50:10,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:10,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:11,025 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 68 treesize of output 63 [2018-04-12 13:50:11,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:11,027 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 13:50:11,028 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:11,037 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:11,094 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 162 treesize of output 151 [2018-04-12 13:50:11,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:11,098 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 155 treesize of output 182 [2018-04-12 13:50:11,098 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:11,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:11,166 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 138 treesize of output 146 [2018-04-12 13:50:11,167 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-12 13:50:11,240 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 13:50:11,315 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 152 treesize of output 152 [2018-04-12 13:50:11,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:11,319 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 145 treesize of output 172 [2018-04-12 13:50:11,319 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:11,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:11,374 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 150 [2018-04-12 13:50:11,375 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-12 13:50:11,401 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 13:50:11,404 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 117 treesize of output 98 [2018-04-12 13:50:11,408 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:11,409 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:50:11,411 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 83 treesize of output 54 [2018-04-12 13:50:11,412 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:11,424 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:11,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-12 13:50:11,474 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:235, output treesize:267 [2018-04-12 13:50:11,555 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-12 13:50:11,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:11,583 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:11,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:11,584 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 17 treesize of output 10 [2018-04-12 13:50:11,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:11,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:11,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:291, output treesize:144 [2018-04-12 13:50:11,743 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 26 [2018-04-12 13:50:11,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:11,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:11,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:11,760 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 13:50:11,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:11,774 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 13:50:11,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:158, output treesize:141 [2018-04-12 13:50:11,957 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 118 treesize of output 148 [2018-04-12 13:50:11,960 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 139 treesize of output 138 [2018-04-12 13:50:11,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:12,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:12,025 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 108 treesize of output 159 [2018-04-12 13:50:12,026 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-12 13:50:12,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-12 13:50:12,149 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 143 treesize of output 128 [2018-04-12 13:50:12,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:12,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:12,153 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:50:12,154 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 37 treesize of output 78 [2018-04-12 13:50:12,154 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:12,167 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:12,181 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 148 treesize of output 159 [2018-04-12 13:50:12,184 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 159 treesize of output 158 [2018-04-12 13:50:12,184 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:12,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:12,252 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 117 treesize of output 168 [2018-04-12 13:50:12,253 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-04-12 13:50:12,321 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-12 13:50:12,328 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 143 treesize of output 128 [2018-04-12 13:50:12,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:12,331 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:50:12,342 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 37 treesize of output 64 [2018-04-12 13:50:12,342 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:12,355 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:12,410 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 3 xjuncts. [2018-04-12 13:50:12,410 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:170, output treesize:327 [2018-04-12 13:50:12,566 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 170 treesize of output 186 [2018-04-12 13:50:12,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:12,572 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 160 treesize of output 183 [2018-04-12 13:50:12,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:12,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 167 treesize of output 166 [2018-04-12 13:50:12,637 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:12,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:12,808 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 155 treesize of output 141 [2018-04-12 13:50:12,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:12,810 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 13:50:12,810 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:12,824 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:12,943 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 145 treesize of output 128 [2018-04-12 13:50:12,950 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:12,951 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 13:50:12,951 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:12,965 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:13,061 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 166 treesize of output 173 [2018-04-12 13:50:13,065 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 173 treesize of output 172 [2018-04-12 13:50:13,065 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:13,159 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:13,224 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:50:13,228 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 155 treesize of output 141 [2018-04-12 13:50:13,230 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 13:50:13,230 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:13,242 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:13,294 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:50:13,295 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 124 treesize of output 107 [2018-04-12 13:50:13,297 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 13:50:13,297 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:13,306 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:13,353 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 13:50:13,353 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 11 variables, input treesize:481, output treesize:391 [2018-04-12 13:50:13,473 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 111 treesize of output 102 [2018-04-12 13:50:13,475 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:50:13,476 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 44 treesize of output 32 [2018-04-12 13:50:13,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:13,491 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 13 treesize of output 1 [2018-04-12 13:50:13,491 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:13,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:13,532 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 63 treesize of output 53 [2018-04-12 13:50:13,534 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 13:50:13,534 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:13,543 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:50:13,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-04-12 13:50:13,544 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:13,551 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:13,578 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 153 treesize of output 133 [2018-04-12 13:50:13,580 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:50:13,595 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 84 treesize of output 60 [2018-04-12 13:50:13,596 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:13,614 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:13,615 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 13:50:13,615 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:13,628 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:13,651 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 67 [2018-04-12 13:50:13,652 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:50:13,653 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 13:50:13,653 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:13,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:13,664 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 13:50:13,664 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:13,671 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:13,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:13,688 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 10 variables, input treesize:265, output treesize:14 [2018-04-12 13:50:13,734 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 13:50:13,752 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:50:13,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 41 [2018-04-12 13:50:13,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-12 13:50:13,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-12 13:50:13,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1610, Unknown=0, NotChecked=0, Total=1722 [2018-04-12 13:50:13,753 INFO L87 Difference]: Start difference. First operand 186 states and 201 transitions. Second operand 42 states. [2018-04-12 13:50:14,644 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 114 DAG size of output 99 [2018-04-12 13:50:15,907 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 193 DAG size of output 99 [2018-04-12 13:50:17,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:50:17,107 INFO L93 Difference]: Finished difference Result 245 states and 267 transitions. [2018-04-12 13:50:17,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-12 13:50:17,107 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 50 [2018-04-12 13:50:17,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:50:17,108 INFO L225 Difference]: With dead ends: 245 [2018-04-12 13:50:17,108 INFO L226 Difference]: Without dead ends: 245 [2018-04-12 13:50:17,109 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=526, Invalid=4166, Unknown=0, NotChecked=0, Total=4692 [2018-04-12 13:50:17,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-04-12 13:50:17,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 186. [2018-04-12 13:50:17,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-12 13:50:17,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 200 transitions. [2018-04-12 13:50:17,113 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 200 transitions. Word has length 50 [2018-04-12 13:50:17,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:50:17,113 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 200 transitions. [2018-04-12 13:50:17,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-12 13:50:17,114 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 200 transitions. [2018-04-12 13:50:17,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-12 13:50:17,114 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:50:17,114 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 13:50:17,114 INFO L408 AbstractCegarLoop]: === Iteration 16 === [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, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-12 13:50:17,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1788489223, now seen corresponding path program 1 times [2018-04-12 13:50:17,115 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:50:17,115 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:50:17,115 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:50:17,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:50:17,115 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:50:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:50:17,127 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:50:17,727 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 13:50:17,727 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:50:17,727 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:50:17,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:50:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:50:17,777 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:50:17,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:17,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:17,782 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 13:50:17,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:17,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:17,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-12 13:50:17,819 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 13:50:17,821 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 13:50:17,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:17,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:17,828 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 13:50:17,829 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 13:50:17,829 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:17,830 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:17,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:17,834 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2018-04-12 13:50:17,841 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 13:50:17,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:17,843 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 13:50:17,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:17,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:17,855 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 13:50:17,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:17,857 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 13:50:17,857 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:17,860 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:17,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:17,865 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-04-12 13:50:18,075 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base Int) (__U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.offset Int) (__U_MULTI_flength_test___false_valid_memtrack_i__append_~head.offset Int)) (let ((.cse1 (+ __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.offset 1)) (.cse2 (+ __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.offset 5)) (.cse3 (+ __U_MULTI_flength_test___false_valid_memtrack_i__append_~head.offset 4))) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| |c___U_MULTI_flength_test___false_valid_memtrack_i__append_#in~head.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c___U_MULTI_flength_test___false_valid_memtrack_i__append_#in~head.base|) __U_MULTI_flength_test___false_valid_memtrack_i__append_~head.offset __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base) .cse3 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base)))) (store .cse0 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base (store (store (select .cse0 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base) .cse1 0) .cse2 0)))) (= (select |c_old(#valid)| __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base) 0) (= (let ((.cse4 (store |c_old(#memory_$Pointer$.offset)| |c___U_MULTI_flength_test___false_valid_memtrack_i__append_#in~head.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c___U_MULTI_flength_test___false_valid_memtrack_i__append_#in~head.base|) __U_MULTI_flength_test___false_valid_memtrack_i__append_~head.offset __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.offset) .cse3 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.offset)))) (store .cse4 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base (store (store (select .cse4 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base) .cse1 0) .cse2 0))) |c_#memory_$Pointer$.offset|)))) is different from true [2018-04-12 13:50:18,190 WARN L148 SmtUtils]: Spent 111ms on a formula simplification that was a NOOP. DAG size: 70 [2018-04-12 13:50:18,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:18,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:18,200 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 11 treesize of output 4 [2018-04-12 13:50:18,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:18,304 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 52 treesize of output 60 [2018-04-12 13:50:18,306 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 13:50:18,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:18,309 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 13:50:18,309 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:18,315 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:18,345 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 13:50:18,347 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 13:50:18,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:18,349 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 13:50:18,349 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:18,355 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:18,376 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:18,389 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 13:50:18,396 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 59 treesize of output 61 [2018-04-12 13:50:18,398 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 13:50:18,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:18,401 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 13:50:18,401 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:18,408 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:18,433 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 51 treesize of output 48 [2018-04-12 13:50:18,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:18,446 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 13:50:18,447 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-12 13:50:18,448 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:18,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:18,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:18,505 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 13:50:18,505 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-04-12 13:50:18,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:18,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:18,542 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:50:18,544 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 47 [2018-04-12 13:50:18,544 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:18,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:18,577 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:18,577 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:18,580 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 30 treesize of output 55 [2018-04-12 13:50:18,580 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:18,612 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-12 13:50:18,645 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-12 13:50:18,705 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-12 13:50:18,800 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 52 treesize of output 60 [2018-04-12 13:50:18,802 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 13:50:18,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:18,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, 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 13:50:18,805 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:18,809 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:18,824 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 13:50:18,826 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 13:50:18,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:18,828 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 13:50:18,829 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:18,832 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:18,840 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:18,848 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:18,854 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 59 treesize of output 61 [2018-04-12 13:50:18,856 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 38 treesize of output 37 [2018-04-12 13:50:18,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:18,858 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 37 treesize of output 41 [2018-04-12 13:50:18,859 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:18,864 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:18,882 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 51 treesize of output 48 [2018-04-12 13:50:18,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:18,896 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 13:50:18,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:18,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:18,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:18,903 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 61 [2018-04-12 13:50:18,903 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:18,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:18,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:18,957 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 13:50:18,957 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-04-12 13:50:18,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:18,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:18,984 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:50:18,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, 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 47 [2018-04-12 13:50:18,986 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:19,008 INFO L267 ElimStorePlain]: Start of recursive call 28: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-12 13:50:19,032 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-12 13:50:19,063 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-12 13:50:19,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 24 dim-0 vars, and 12 xjuncts. [2018-04-12 13:50:19,146 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 7 variables, input treesize:135, output treesize:1536 [2018-04-12 13:50:36,204 WARN L151 SmtUtils]: Spent 14700ms on a formula simplification. DAG size of input: 330 DAG size of output 35 [2018-04-12 13:50:36,316 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 40 treesize of output 34 [2018-04-12 13:50:36,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:36,320 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 13 treesize of output 6 [2018-04-12 13:50:36,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:36,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:36,330 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 18 treesize of output 10 [2018-04-12 13:50:36,330 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:36,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:36,348 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 40 treesize of output 34 [2018-04-12 13:50:36,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:36,351 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 13 treesize of output 6 [2018-04-12 13:50:36,351 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:36,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:36,360 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 18 treesize of output 10 [2018-04-12 13:50:36,360 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:36,362 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:36,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:36,365 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:83, output treesize:7 [2018-04-12 13:50:36,438 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 13:50:36,455 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:50:36,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 35 [2018-04-12 13:50:36,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-12 13:50:36,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-12 13:50:36,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1016, Unknown=16, NotChecked=64, Total=1190 [2018-04-12 13:50:36,456 INFO L87 Difference]: Start difference. First operand 186 states and 200 transitions. Second operand 35 states. [2018-04-12 13:50:37,932 WARN L148 SmtUtils]: Spent 145ms on a formula simplification that was a NOOP. DAG size: 66 [2018-04-12 13:50:40,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:50:40,615 INFO L93 Difference]: Finished difference Result 297 states and 319 transitions. [2018-04-12 13:50:40,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-12 13:50:40,615 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 52 [2018-04-12 13:50:40,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:50:40,617 INFO L225 Difference]: With dead ends: 297 [2018-04-12 13:50:40,617 INFO L226 Difference]: Without dead ends: 297 [2018-04-12 13:50:40,618 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=333, Invalid=2689, Unknown=62, NotChecked=108, Total=3192 [2018-04-12 13:50:40,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-04-12 13:50:40,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 212. [2018-04-12 13:50:40,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-04-12 13:50:40,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 234 transitions. [2018-04-12 13:50:40,623 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 234 transitions. Word has length 52 [2018-04-12 13:50:40,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:50:40,623 INFO L459 AbstractCegarLoop]: Abstraction has 212 states and 234 transitions. [2018-04-12 13:50:40,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-12 13:50:40,623 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 234 transitions. [2018-04-12 13:50:40,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-12 13:50:40,624 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:50:40,624 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 13:50:40,624 INFO L408 AbstractCegarLoop]: === Iteration 17 === [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, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-12 13:50:40,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1182477942, now seen corresponding path program 1 times [2018-04-12 13:50:40,625 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:50:40,625 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:50:40,625 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:50:40,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:50:40,625 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:50:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:50:40,647 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:50:41,544 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 13:50:41,545 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:50:41,545 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:50:41,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:50:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:50:41,573 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:50:41,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:41,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:41,594 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 13:50:41,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:41,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:41,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-12 13:50:41,661 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 13:50:41,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 13:50:41,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:41,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:41,670 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 13:50:41,671 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 13:50:41,671 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:41,672 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:41,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:41,677 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-04-12 13:50:41,922 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base Int) (__U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.offset Int) (__U_MULTI_flength_test___false_valid_memtrack_i__append_~head.offset Int)) (let ((.cse1 (+ __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.offset 1)) (.cse2 (+ __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.offset 5)) (.cse3 (+ __U_MULTI_flength_test___false_valid_memtrack_i__append_~head.offset 4))) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| |c___U_MULTI_flength_test___false_valid_memtrack_i__append_#in~head.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c___U_MULTI_flength_test___false_valid_memtrack_i__append_#in~head.base|) __U_MULTI_flength_test___false_valid_memtrack_i__append_~head.offset __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base) .cse3 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base)))) (store .cse0 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base (store (store (select .cse0 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base) .cse1 0) .cse2 0)))) (= (select |c_old(#valid)| __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base) 0) (= (let ((.cse4 (store |c_old(#memory_$Pointer$.offset)| |c___U_MULTI_flength_test___false_valid_memtrack_i__append_#in~head.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c___U_MULTI_flength_test___false_valid_memtrack_i__append_#in~head.base|) __U_MULTI_flength_test___false_valid_memtrack_i__append_~head.offset __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.offset) .cse3 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.offset)))) (store .cse4 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base (store (store (select .cse4 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base) .cse1 0) .cse2 0))) |c_#memory_$Pointer$.offset|)))) is different from true [2018-04-12 13:50:42,042 WARN L148 SmtUtils]: Spent 115ms on a formula simplification that was a NOOP. DAG size: 67 [2018-04-12 13:50:42,048 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:42,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:42,051 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 11 treesize of output 4 [2018-04-12 13:50:42,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:42,173 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 45 treesize of output 53 [2018-04-12 13:50:42,176 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 13:50:42,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:42,179 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 13:50:42,179 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:42,186 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:42,216 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 44 treesize of output 53 [2018-04-12 13:50:42,218 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 13:50:42,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:42,221 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 13:50:42,221 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:42,226 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:42,238 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:42,253 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 13:50:42,263 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 13:50:42,266 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 13:50:42,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:42,269 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 13:50:42,269 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:42,278 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:42,301 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 13:50:42,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:42,317 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 13:50:42,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:42,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:42,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:42,325 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 61 [2018-04-12 13:50:42,325 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:42,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:42,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:42,364 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:50:42,366 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 47 [2018-04-12 13:50:42,367 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:42,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:42,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:42,439 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 13:50:42,439 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-04-12 13:50:42,475 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-12 13:50:42,512 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-12 13:50:42,575 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-12 13:50:42,677 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 13:50:42,679 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 38 treesize of output 37 [2018-04-12 13:50:42,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:42,682 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 37 treesize of output 41 [2018-04-12 13:50:42,682 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:42,689 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:42,703 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 13:50:42,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:42,717 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 13:50:42,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:42,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:42,722 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:50:42,724 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 36 treesize of output 53 [2018-04-12 13:50:42,724 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:42,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:42,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:42,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:42,775 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 30 treesize of output 55 [2018-04-12 13:50:42,776 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:42,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:42,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:42,828 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 13:50:42,829 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-04-12 13:50:42,854 INFO L267 ElimStorePlain]: Start of recursive call 21: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-12 13:50:42,880 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-12 13:50:42,911 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-12 13:50:42,921 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 45 treesize of output 53 [2018-04-12 13:50:42,923 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 13:50:42,925 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:42,925 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 13:50:42,925 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:42,930 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:42,946 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 44 treesize of output 53 [2018-04-12 13:50:42,948 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 13:50:42,950 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:50:42,951 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 13:50:42,951 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-12 13:50:42,955 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:42,963 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:42,971 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:50:43,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 24 dim-0 vars, and 12 xjuncts. [2018-04-12 13:50:43,049 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 7 variables, input treesize:124, output treesize:1404 [2018-04-12 13:51:03,397 WARN L151 SmtUtils]: Spent 13654ms on a formula simplification. DAG size of input: 327 DAG size of output 32 [2018-04-12 13:51:03,622 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 35 treesize of output 31 [2018-04-12 13:51:03,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:51:03,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-12 13:51:03,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:51:03,630 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:51:03,630 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 15 treesize of output 11 [2018-04-12 13:51:03,630 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:51:03,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:51:03,644 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 35 treesize of output 31 [2018-04-12 13:51:03,645 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:51:03,646 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 15 treesize of output 11 [2018-04-12 13:51:03,646 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 13:51:03,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:51:03,652 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 13 treesize of output 6 [2018-04-12 13:51:03,652 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:51:03,654 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:51:03,659 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 13:51:03,659 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:82, output treesize:7 [2018-04-12 13:51:03,729 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 13:51:03,746 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:51:03,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 41 [2018-04-12 13:51:03,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-12 13:51:03,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-12 13:51:03,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1421, Unknown=28, NotChecked=76, Total=1640 [2018-04-12 13:51:03,747 INFO L87 Difference]: Start difference. First operand 212 states and 234 transitions. Second operand 41 states. [2018-04-12 13:51:06,734 WARN L148 SmtUtils]: Spent 112ms on a formula simplification that was a NOOP. DAG size: 65 [2018-04-12 13:51:10,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:51:10,118 INFO L93 Difference]: Finished difference Result 279 states and 296 transitions. [2018-04-12 13:51:10,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-12 13:51:10,118 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 54 [2018-04-12 13:51:10,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:51:10,119 INFO L225 Difference]: With dead ends: 279 [2018-04-12 13:51:10,119 INFO L226 Difference]: Without dead ends: 279 [2018-04-12 13:51:10,120 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=443, Invalid=3903, Unknown=80, NotChecked=130, Total=4556 [2018-04-12 13:51:10,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-04-12 13:51:10,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 205. [2018-04-12 13:51:10,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-12 13:51:10,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 224 transitions. [2018-04-12 13:51:10,123 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 224 transitions. Word has length 54 [2018-04-12 13:51:10,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:51:10,123 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 224 transitions. [2018-04-12 13:51:10,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-12 13:51:10,123 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 224 transitions. [2018-04-12 13:51:10,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-12 13:51:10,124 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:51:10,124 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 13:51:10,124 INFO L408 AbstractCegarLoop]: === Iteration 18 === [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, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-12 13:51:10,124 INFO L82 PathProgramCache]: Analyzing trace with hash -298162330, now seen corresponding path program 1 times [2018-04-12 13:51:10,124 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:51:10,124 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:51:10,124 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:51:10,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:51:10,125 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:51:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:51:10,131 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:51:10,170 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 13:51:10,170 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:51:10,170 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:51:10,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:51:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:51:10,211 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:51:10,232 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 13:51:10,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:51:10,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-04-12 13:51:10,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 13:51:10,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 13:51:10,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:51:10,263 INFO L87 Difference]: Start difference. First operand 205 states and 224 transitions. Second operand 5 states. [2018-04-12 13:51:10,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:51:10,294 INFO L93 Difference]: Finished difference Result 240 states and 265 transitions. [2018-04-12 13:51:10,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 13:51:10,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-04-12 13:51:10,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:51:10,295 INFO L225 Difference]: With dead ends: 240 [2018-04-12 13:51:10,295 INFO L226 Difference]: Without dead ends: 240 [2018-04-12 13:51:10,295 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 13:51:10,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-04-12 13:51:10,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 221. [2018-04-12 13:51:10,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-12 13:51:10,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 246 transitions. [2018-04-12 13:51:10,300 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 246 transitions. Word has length 58 [2018-04-12 13:51:10,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:51:10,300 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 246 transitions. [2018-04-12 13:51:10,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 13:51:10,300 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 246 transitions. [2018-04-12 13:51:10,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-12 13:51:10,301 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:51:10,301 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-12 13:51:10,301 INFO L408 AbstractCegarLoop]: === Iteration 19 === [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, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-12 13:51:10,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1910577447, now seen corresponding path program 1 times [2018-04-12 13:51:10,301 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:51:10,301 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:51:10,302 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:51:10,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:51:10,302 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:51:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:51:10,311 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:51:10,326 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-12 13:51:10,326 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:51:10,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:51:10,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 13:51:10,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 13:51:10,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 13:51:10,327 INFO L87 Difference]: Start difference. First operand 221 states and 246 transitions. Second operand 3 states. [2018-04-12 13:51:10,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:51:10,332 INFO L93 Difference]: Finished difference Result 223 states and 248 transitions. [2018-04-12 13:51:10,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 13:51:10,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-04-12 13:51:10,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:51:10,333 INFO L225 Difference]: With dead ends: 223 [2018-04-12 13:51:10,333 INFO L226 Difference]: Without dead ends: 223 [2018-04-12 13:51:10,334 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 13:51:10,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-12 13:51:10,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-04-12 13:51:10,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-04-12 13:51:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 248 transitions. [2018-04-12 13:51:10,338 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 248 transitions. Word has length 64 [2018-04-12 13:51:10,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:51:10,338 INFO L459 AbstractCegarLoop]: Abstraction has 223 states and 248 transitions. [2018-04-12 13:51:10,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 13:51:10,338 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 248 transitions. [2018-04-12 13:51:10,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-12 13:51:10,339 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:51:10,339 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-12 13:51:10,339 INFO L408 AbstractCegarLoop]: === Iteration 20 === [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, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-12 13:51:10,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1942436994, now seen corresponding path program 1 times [2018-04-12 13:51:10,339 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:51:10,339 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:51:10,340 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:51:10,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:51:10,340 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:51:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:51:10,351 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:51:10,497 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-12 13:51:10,498 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:51:10,498 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:51:10,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:51:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:51:10,532 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:51:10,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:51:10,614 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 13:51:10,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:51:10,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:51:10,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:51:10,623 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 13:51:10,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:51:10,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:51:10,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-12 13:51:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-12 13:51:10,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:51:10,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2018-04-12 13:51:10,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-12 13:51:10,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-12 13:51:10,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2018-04-12 13:51:10,717 INFO L87 Difference]: Start difference. First operand 223 states and 248 transitions. Second operand 23 states. [2018-04-12 13:51:11,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:51:11,085 INFO L93 Difference]: Finished difference Result 268 states and 288 transitions. [2018-04-12 13:51:11,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-12 13:51:11,085 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2018-04-12 13:51:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:51:11,086 INFO L225 Difference]: With dead ends: 268 [2018-04-12 13:51:11,086 INFO L226 Difference]: Without dead ends: 268 [2018-04-12 13:51:11,087 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2018-04-12 13:51:11,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-04-12 13:51:11,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 250. [2018-04-12 13:51:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-12 13:51:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 276 transitions. [2018-04-12 13:51:11,091 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 276 transitions. Word has length 66 [2018-04-12 13:51:11,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:51:11,092 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 276 transitions. [2018-04-12 13:51:11,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-12 13:51:11,092 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 276 transitions. [2018-04-12 13:51:11,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-12 13:51:11,093 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:51:11,093 INFO L355 BasicCegarLoop]: trace histogram [3, 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] [2018-04-12 13:51:11,093 INFO L408 AbstractCegarLoop]: === Iteration 21 === [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, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-12 13:51:11,093 INFO L82 PathProgramCache]: Analyzing trace with hash 640456924, now seen corresponding path program 1 times [2018-04-12 13:51:11,093 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:51:11,093 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:51:11,094 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:51:11,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:51:11,094 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:51:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:51:11,108 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:51:11,489 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:51:11,490 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:51:11,490 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:51:11,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:51:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:51:11,520 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:51:11,541 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 13:51:11,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:51:11,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:51:11,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-12 13:51:11,648 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 13:51:11,649 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 8 treesize of output 7 [2018-04-12 13:51:11,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:51:11,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:51:11,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:51:11,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-12 13:51:11,679 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 13:51:11,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:51:11,681 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 13:51:11,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:51:11,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:51:11,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:51:11,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-04-12 13:51:11,723 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 30 treesize of output 40 [2018-04-12 13:51:11,725 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 31 treesize of output 30 [2018-04-12 13:51:11,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:51:11,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:51:11,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:51:11,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 53 [2018-04-12 13:51:11,756 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-12 13:51:11,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-12 13:51:11,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-12 13:51:11,816 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:39, output treesize:108 [2018-04-12 13:51:11,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:51:11,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 39 treesize of output 40 [2018-04-12 13:51:11,873 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 31 treesize of output 27 [2018-04-12 13:51:11,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:51:11,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:51:11,905 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 39 treesize of output 32 [2018-04-12 13:51:11,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:51:11,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:51:11,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:51:11,908 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:51:11,908 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 23 treesize of output 60 [2018-04-12 13:51:11,908 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:51:11,919 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:51:11,954 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 65 treesize of output 64 [2018-04-12 13:51:11,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:51:11,956 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 64 treesize of output 79 [2018-04-12 13:51:11,956 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:51:11,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:51:11,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:51:11,985 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:51:11,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 86 [2018-04-12 13:51:11,990 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-12 13:51:12,022 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 13:51:12,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-04-12 13:51:12,049 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:144, output treesize:168 [2018-04-12 13:51:12,109 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-12 13:51:12,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:51:12,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:51:12,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:51:12,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 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 13:51:12,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:51:12,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:51:12,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:188, output treesize:60 [2018-04-12 13:51:12,265 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:51:12,292 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:51:12,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 33 [2018-04-12 13:51:12,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-12 13:51:12,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-12 13:51:12,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2018-04-12 13:51:12,293 INFO L87 Difference]: Start difference. First operand 250 states and 276 transitions. Second operand 33 states. [2018-04-12 13:51:13,217 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 96 DAG size of output 87 [2018-04-12 13:51:14,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:51:14,496 INFO L93 Difference]: Finished difference Result 294 states and 317 transitions. [2018-04-12 13:51:14,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-12 13:51:14,497 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 66 [2018-04-12 13:51:14,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:51:14,497 INFO L225 Difference]: With dead ends: 294 [2018-04-12 13:51:14,497 INFO L226 Difference]: Without dead ends: 275 [2018-04-12 13:51:14,498 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=519, Invalid=3771, Unknown=0, NotChecked=0, Total=4290 [2018-04-12 13:51:14,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-12 13:51:14,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 221. [2018-04-12 13:51:14,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-12 13:51:14,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 240 transitions. [2018-04-12 13:51:14,502 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 240 transitions. Word has length 66 [2018-04-12 13:51:14,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:51:14,503 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 240 transitions. [2018-04-12 13:51:14,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-12 13:51:14,503 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 240 transitions. [2018-04-12 13:51:14,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-12 13:51:14,503 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:51:14,503 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:51:14,504 INFO L408 AbstractCegarLoop]: === Iteration 22 === [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, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-12 13:51:14,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1123343448, now seen corresponding path program 1 times [2018-04-12 13:51:14,504 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:51:14,504 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:51:14,504 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:51:14,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:51:14,505 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:51:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:51:14,525 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:51:14,794 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-12 13:51:14,794 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:51:14,794 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:51:14,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:51:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:51:14,847 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:51:14,913 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base Int)) (and (= |c_#length| (store |c_old(#length)| __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base 9)) (= (select |c_old(#valid)| __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base) 0))) is different from true [2018-04-12 13:51:14,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:51:14,921 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 13:51:14,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:51:14,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:51:14,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:51:14,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 13:51:14,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:51:14,932 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 13:51:14,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-12 13:51:14,968 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base Int)) (= |c_#length| (store |c_old(#length)| __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base 9))) is different from true [2018-04-12 13:51:14,979 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 2 case distinctions, treesize of input 19 treesize of output 29 [2018-04-12 13:51:14,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-12 13:51:14,988 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 13:51:14,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:25 [2018-04-12 13:51:15,067 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 2 case distinctions, treesize of input 19 treesize of output 29 [2018-04-12 13:51:15,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-12 13:51:15,079 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 13:51:15,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:25 [2018-04-12 13:51:15,153 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 16 not checked. [2018-04-12 13:51:15,181 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:51:15,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2018-04-12 13:51:15,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-12 13:51:15,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-12 13:51:15,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=674, Unknown=2, NotChecked=106, Total=870 [2018-04-12 13:51:15,182 INFO L87 Difference]: Start difference. First operand 221 states and 240 transitions. Second operand 30 states. [2018-04-12 13:51:16,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:51:16,085 INFO L93 Difference]: Finished difference Result 243 states and 258 transitions. [2018-04-12 13:51:16,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 13:51:16,119 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 68 [2018-04-12 13:51:16,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:51:16,120 INFO L225 Difference]: With dead ends: 243 [2018-04-12 13:51:16,120 INFO L226 Difference]: Without dead ends: 243 [2018-04-12 13:51:16,120 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=188, Invalid=1224, Unknown=2, NotChecked=146, Total=1560 [2018-04-12 13:51:16,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-04-12 13:51:16,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 204. [2018-04-12 13:51:16,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-04-12 13:51:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 219 transitions. [2018-04-12 13:51:16,122 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 219 transitions. Word has length 68 [2018-04-12 13:51:16,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:51:16,123 INFO L459 AbstractCegarLoop]: Abstraction has 204 states and 219 transitions. [2018-04-12 13:51:16,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-12 13:51:16,123 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 219 transitions. [2018-04-12 13:51:16,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-12 13:51:16,123 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:51:16,123 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 13:51:16,123 INFO L408 AbstractCegarLoop]: === Iteration 23 === [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, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-12 13:51:16,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1088555564, now seen corresponding path program 1 times [2018-04-12 13:51:16,123 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:51:16,123 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:51:16,124 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:51:16,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:51:16,124 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:51:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:51:16,143 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:51:16,665 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-12 13:51:16,665 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:51:16,665 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:51:16,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:51:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:51:16,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:51:16,823 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_#valid_BEFORE_CALL_20| term size 17 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.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 13:51:16,826 INFO L168 Benchmark]: Toolchain (without parser) took 81459.13 ms. Allocated memory was 396.4 MB in the beginning and 845.2 MB in the end (delta: 448.8 MB). Free memory was 334.6 MB in the beginning and 458.7 MB in the end (delta: -124.2 MB). Peak memory consumption was 324.6 MB. Max. memory is 5.3 GB. [2018-04-12 13:51:16,827 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 396.4 MB. Free memory is still 359.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 13:51:16,827 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.78 ms. Allocated memory is still 396.4 MB. Free memory was 333.2 MB in the beginning and 308.1 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-04-12 13:51:16,827 INFO L168 Benchmark]: Boogie Preprocessor took 37.72 ms. Allocated memory is still 396.4 MB. Free memory was 308.1 MB in the beginning and 305.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-12 13:51:16,828 INFO L168 Benchmark]: RCFGBuilder took 477.96 ms. Allocated memory was 396.4 MB in the beginning and 601.4 MB in the end (delta: 205.0 MB). Free memory was 305.5 MB in the beginning and 519.4 MB in the end (delta: -213.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB. [2018-04-12 13:51:16,828 INFO L168 Benchmark]: TraceAbstraction took 80678.10 ms. Allocated memory was 601.4 MB in the beginning and 845.2 MB in the end (delta: 243.8 MB). Free memory was 519.4 MB in the beginning and 458.7 MB in the end (delta: 60.7 MB). Peak memory consumption was 304.5 MB. Max. memory is 5.3 GB. [2018-04-12 13:51:16,829 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.19 ms. Allocated memory is still 396.4 MB. Free memory is still 359.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 262.78 ms. Allocated memory is still 396.4 MB. Free memory was 333.2 MB in the beginning and 308.1 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.72 ms. Allocated memory is still 396.4 MB. Free memory was 308.1 MB in the beginning and 305.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 477.96 ms. Allocated memory was 396.4 MB in the beginning and 601.4 MB in the end (delta: 205.0 MB). Free memory was 305.5 MB in the beginning and 519.4 MB in the end (delta: -213.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 80678.10 ms. Allocated memory was 601.4 MB in the beginning and 845.2 MB in the end (delta: 243.8 MB). Free memory was 519.4 MB in the beginning and 458.7 MB in the end (delta: 60.7 MB). Peak memory consumption was 304.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#valid_BEFORE_CALL_20| term size 17 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#valid_BEFORE_CALL_20| term size 17: 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_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-12_13-51-16-835.csv Received shutdown request...