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-666feb3-m [2018-04-11 22:09:07,912 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 22:09:07,914 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 22:09:07,927 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 22:09:07,927 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 22:09:07,928 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 22:09:07,929 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 22:09:07,930 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 22:09:07,932 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 22:09:07,932 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 22:09:07,933 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 22:09:07,933 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 22:09:07,934 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 22:09:07,935 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 22:09:07,935 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 22:09:07,937 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 22:09:07,938 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 22:09:07,940 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 22:09:07,940 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 22:09:07,941 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 22:09:07,943 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 22:09:07,943 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 22:09:07,943 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 22:09:07,944 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 22:09:07,945 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 22:09:07,945 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 22:09:07,946 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 22:09:07,946 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 22:09:07,947 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 22:09:07,947 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 22:09:07,947 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 22:09:07,948 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-11 22:09:07,969 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 22:09:07,969 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 22:09:07,970 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 22:09:07,970 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 22:09:07,970 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 22:09:07,971 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 22:09:07,971 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 22:09:07,971 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 22:09:07,971 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 22:09:07,971 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 22:09:07,971 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 22:09:07,971 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 22:09:07,972 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 22:09:07,972 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 22:09:07,972 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 22:09:07,972 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 22:09:07,972 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 22:09:07,972 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 22:09:07,972 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 22:09:07,972 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 22:09:07,973 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 22:09:07,973 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 22:09:07,973 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 22:09:07,973 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 22:09:08,001 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 22:09:08,009 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 22:09:08,014 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 22:09:08,015 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 22:09:08,015 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 22:09:08,016 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-11 22:09:08,310 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGfc5653c4e [2018-04-11 22:09:08,468 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 22:09:08,468 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 22:09:08,468 INFO L168 CDTParser]: Scanning length_test03_false-valid-memtrack.i [2018-04-11 22:09:08,473 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 22:09:08,473 INFO L215 ultiparseSymbolTable]: [2018-04-11 22:09:08,473 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 22:09:08,473 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-11 22:09:08,474 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-11 22:09:08,474 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-11 22:09:08,474 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in length_test03_false-valid-memtrack.i [2018-04-11 22:09:08,474 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 22:09:08,474 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-11 22:09:08,474 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-11 22:09:08,474 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-11 22:09:08,474 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-11 22:09:08,474 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-11 22:09:08,474 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-11 22:09:08,474 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-11 22:09:08,474 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-11 22:09:08,474 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-11 22:09:08,474 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-11 22:09:08,474 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-11 22:09:08,474 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-11 22:09:08,474 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-11 22:09:08,475 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-11 22:09:08,475 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-11 22:09:08,475 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-11 22:09:08,475 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-11 22:09:08,475 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-11 22:09:08,475 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-11 22:09:08,475 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-11 22:09:08,475 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-11 22:09:08,475 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-11 22:09:08,475 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-11 22:09:08,475 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-11 22:09:08,475 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-11 22:09:08,475 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-11 22:09:08,475 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-11 22:09:08,475 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-11 22:09:08,475 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-11 22:09:08,475 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-11 22:09:08,475 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-11 22:09:08,476 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-11 22:09:08,476 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-11 22:09:08,476 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-11 22:09:08,476 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-11 22:09:08,476 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-11 22:09:08,476 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-11 22:09:08,476 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-11 22:09:08,476 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-11 22:09:08,476 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-11 22:09:08,476 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-11 22:09:08,476 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-11 22:09:08,476 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-11 22:09:08,476 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-11 22:09:08,476 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-11 22:09:08,476 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-11 22:09:08,476 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-11 22:09:08,476 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-11 22:09:08,476 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-11 22:09:08,477 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-11 22:09:08,477 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-11 22:09:08,477 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-11 22:09:08,477 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-11 22:09:08,477 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-11 22:09:08,477 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-11 22:09:08,477 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-11 22:09:08,477 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-11 22:09:08,477 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-11 22:09:08,477 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-11 22:09:08,477 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-11 22:09:08,477 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-11 22:09:08,477 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-11 22:09:08,477 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-11 22:09:08,477 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-11 22:09:08,477 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-11 22:09:08,477 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-11 22:09:08,478 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-11 22:09:08,478 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-11 22:09:08,478 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-11 22:09:08,478 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-11 22:09:08,478 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-11 22:09:08,478 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-11 22:09:08,478 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-11 22:09:08,478 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-11 22:09:08,478 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-11 22:09:08,478 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-11 22:09:08,478 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-11 22:09:08,478 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-11 22:09:08,478 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-11 22:09:08,478 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-11 22:09:08,478 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-11 22:09:08,478 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-11 22:09:08,478 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-11 22:09:08,478 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-11 22:09:08,479 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-11 22:09:08,479 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-11 22:09:08,479 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-11 22:09:08,479 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-11 22:09:08,479 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-11 22:09:08,479 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-11 22:09:08,479 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-11 22:09:08,479 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-11 22:09:08,479 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-11 22:09:08,479 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-11 22:09:08,479 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-11 22:09:08,479 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-11 22:09:08,479 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-11 22:09:08,479 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-11 22:09:08,479 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-11 22:09:08,479 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-11 22:09:08,479 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-11 22:09:08,479 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-11 22:09:08,480 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-11 22:09:08,480 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-11 22:09:08,480 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-11 22:09:08,480 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-11 22:09:08,480 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-11 22:09:08,480 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-11 22:09:08,480 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-11 22:09:08,480 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-11 22:09:08,480 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-11 22:09:08,480 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-11 22:09:08,480 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-11 22:09:08,480 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-11 22:09:08,480 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-11 22:09:08,480 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-11 22:09:08,480 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-11 22:09:08,480 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-11 22:09:08,480 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-11 22:09:08,493 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGfc5653c4e [2018-04-11 22:09:08,495 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 22:09:08,496 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 22:09:08,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 22:09:08,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 22:09:08,500 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 22:09:08,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 10:09:08" (1/1) ... [2018-04-11 22:09:08,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@499eaa3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:09:08, skipping insertion in model container [2018-04-11 22:09:08,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 10:09:08" (1/1) ... [2018-04-11 22:09:08,513 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 22:09:08,536 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 22:09:08,660 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 22:09:08,701 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 22:09:08,706 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 119 non ball SCCs. Number of states in SCCs 119. [2018-04-11 22:09:08,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:09:08 WrapperNode [2018-04-11 22:09:08,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 22:09:08,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 22:09:08,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 22:09:08,742 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 22:09:08,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:09:08" (1/1) ... [2018-04-11 22:09:08,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:09:08" (1/1) ... [2018-04-11 22:09:08,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:09:08" (1/1) ... [2018-04-11 22:09:08,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:09:08" (1/1) ... [2018-04-11 22:09:08,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:09:08" (1/1) ... [2018-04-11 22:09:08,782 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:09:08" (1/1) ... [2018-04-11 22:09:08,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:09:08" (1/1) ... [2018-04-11 22:09:08,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 22:09:08,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 22:09:08,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 22:09:08,789 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 22:09:08,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:09:08" (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-11 22:09:08,870 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 22:09:08,870 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 22:09:08,870 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___false_valid_memtrack_i____bswap_32 [2018-04-11 22:09:08,870 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___false_valid_memtrack_i____bswap_64 [2018-04-11 22:09:08,870 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___false_valid_memtrack_i__append [2018-04-11 22:09:08,870 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 22:09:08,871 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 22:09:08,871 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 22:09:08,871 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 22:09:08,871 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 22:09:08,871 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 22:09:08,871 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 22:09:08,871 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 22:09:08,871 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 22:09:08,871 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 22:09:08,871 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 22:09:08,871 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 22:09:08,871 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 22:09:08,872 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 22:09:08,872 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 22:09:08,872 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 22:09:08,872 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 22:09:08,872 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 22:09:08,872 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___false_valid_memtrack_i____bswap_32 [2018-04-11 22:09:08,872 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___false_valid_memtrack_i____bswap_64 [2018-04-11 22:09:08,872 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 22:09:08,872 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 22:09:08,873 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 22:09:08,873 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 22:09:08,873 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 22:09:08,873 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 22:09:08,873 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 22:09:08,873 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 22:09:08,873 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 22:09:08,873 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 22:09:08,874 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 22:09:08,874 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 22:09:08,874 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 22:09:08,874 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 22:09:08,874 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 22:09:08,874 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 22:09:08,874 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 22:09:08,874 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 22:09:08,874 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 22:09:08,875 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 22:09:08,875 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 22:09:08,875 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 22:09:08,875 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 22:09:08,875 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 22:09:08,875 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 22:09:08,875 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 22:09:08,875 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 22:09:08,875 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 22:09:08,875 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 22:09:08,876 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 22:09:08,876 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 22:09:08,876 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 22:09:08,876 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 22:09:08,876 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 22:09:08,876 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 22:09:08,876 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 22:09:08,876 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 22:09:08,876 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 22:09:08,876 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 22:09:08,876 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 22:09:08,877 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 22:09:08,877 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 22:09:08,877 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-11 22:09:08,877 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 22:09:08,877 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 22:09:08,877 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-11 22:09:08,877 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 22:09:08,877 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 22:09:08,877 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-11 22:09:08,878 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 22:09:08,878 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 22:09:08,878 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 22:09:08,878 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 22:09:08,878 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 22:09:08,878 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 22:09:08,878 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 22:09:08,878 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 22:09:08,878 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 22:09:08,878 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 22:09:08,879 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 22:09:08,879 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 22:09:08,879 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 22:09:08,879 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 22:09:08,879 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 22:09:08,879 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 22:09:08,879 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 22:09:08,879 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 22:09:08,879 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 22:09:08,879 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 22:09:08,879 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 22:09:08,880 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 22:09:08,880 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 22:09:08,880 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 22:09:08,880 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 22:09:08,880 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 22:09:08,880 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 22:09:08,880 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 22:09:08,880 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 22:09:08,880 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 22:09:08,880 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 22:09:08,880 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 22:09:08,881 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 22:09:08,881 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 22:09:08,881 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 22:09:08,881 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 22:09:08,881 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 22:09:08,881 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 22:09:08,881 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-04-11 22:09:08,881 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 22:09:08,881 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___false_valid_memtrack_i__append [2018-04-11 22:09:08,881 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 22:09:08,881 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 22:09:08,882 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 22:09:08,882 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 22:09:08,882 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 22:09:08,882 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 22:09:08,882 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 22:09:08,882 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 22:09:08,882 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 22:09:08,882 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 22:09:09,282 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 22:09:09,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 10:09:09 BoogieIcfgContainer [2018-04-11 22:09:09,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 22:09:09,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 22:09:09,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 22:09:09,285 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 22:09:09,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 10:09:08" (1/3) ... [2018-04-11 22:09:09,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3551ad93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 10:09:09, skipping insertion in model container [2018-04-11 22:09:09,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:09:08" (2/3) ... [2018-04-11 22:09:09,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3551ad93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 10:09:09, skipping insertion in model container [2018-04-11 22:09:09,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 10:09:09" (3/3) ... [2018-04-11 22:09:09,287 INFO L107 eAbstractionObserver]: Analyzing ICFG length_test03_false-valid-memtrack.i [2018-04-11 22:09:09,292 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 22:09:09,299 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-04-11 22:09:09,322 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 22:09:09,323 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 22:09:09,323 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 22:09:09,323 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 22:09:09,323 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 22:09:09,323 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 22:09:09,323 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 22:09:09,323 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 22:09:09,324 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 22:09:09,324 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 22:09:09,334 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2018-04-11 22:09:09,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 22:09:09,340 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:09:09,341 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:09:09,341 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-11 22:09:09,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1465942715, now seen corresponding path program 1 times [2018-04-11 22:09:09,344 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:09:09,345 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:09:09,373 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:09,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:09:09,373 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:09:09,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:09:09,445 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-11 22:09:09,447 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:09:09,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 22:09:09,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 22:09:09,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 22:09:09,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 22:09:09,463 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 4 states. [2018-04-11 22:09:09,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:09:09,633 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2018-04-11 22:09:09,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 22:09:09,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 22:09:09,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:09:09,645 INFO L225 Difference]: With dead ends: 175 [2018-04-11 22:09:09,645 INFO L226 Difference]: Without dead ends: 172 [2018-04-11 22:09:09,647 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-11 22:09:09,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-11 22:09:09,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 134. [2018-04-11 22:09:09,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-11 22:09:09,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2018-04-11 22:09:09,678 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 140 transitions. Word has length 8 [2018-04-11 22:09:09,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:09:09,678 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 140 transitions. [2018-04-11 22:09:09,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 22:09:09,679 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2018-04-11 22:09:09,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 22:09:09,679 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:09:09,679 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:09:09,679 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-11 22:09:09,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1465942716, now seen corresponding path program 1 times [2018-04-11 22:09:09,679 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:09:09,679 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:09:09,680 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:09,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:09:09,680 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:09:09,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:09:09,722 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-11 22:09:09,722 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:09:09,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 22:09:09,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 22:09:09,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 22:09:09,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 22:09:09,724 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. Second operand 4 states. [2018-04-11 22:09:09,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:09:09,831 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2018-04-11 22:09:09,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 22:09:09,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 22:09:09,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:09:09,832 INFO L225 Difference]: With dead ends: 134 [2018-04-11 22:09:09,832 INFO L226 Difference]: Without dead ends: 134 [2018-04-11 22:09:09,832 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-11 22:09:09,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-11 22:09:09,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-04-11 22:09:09,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-04-11 22:09:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 138 transitions. [2018-04-11 22:09:09,839 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 138 transitions. Word has length 8 [2018-04-11 22:09:09,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:09:09,839 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 138 transitions. [2018-04-11 22:09:09,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 22:09:09,839 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 138 transitions. [2018-04-11 22:09:09,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-11 22:09:09,839 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:09:09,839 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:09:09,840 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-11 22:09:09,840 INFO L82 PathProgramCache]: Analyzing trace with hash -643063297, now seen corresponding path program 1 times [2018-04-11 22:09:09,840 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:09:09,840 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:09:09,840 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:09,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:09:09,841 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:09:09,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:09:09,868 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-11 22:09:09,868 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:09:09,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 22:09:09,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 22:09:09,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 22:09:09,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 22:09:09,869 INFO L87 Difference]: Start difference. First operand 132 states and 138 transitions. Second operand 4 states. [2018-04-11 22:09:09,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:09:09,979 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2018-04-11 22:09:09,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 22:09:09,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-11 22:09:09,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:09:09,980 INFO L225 Difference]: With dead ends: 148 [2018-04-11 22:09:09,980 INFO L226 Difference]: Without dead ends: 148 [2018-04-11 22:09:09,981 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-11 22:09:09,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-11 22:09:09,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 135. [2018-04-11 22:09:09,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-04-11 22:09:09,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 143 transitions. [2018-04-11 22:09:09,985 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 143 transitions. Word has length 12 [2018-04-11 22:09:09,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:09:09,985 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 143 transitions. [2018-04-11 22:09:09,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 22:09:09,985 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 143 transitions. [2018-04-11 22:09:09,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-11 22:09:09,985 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:09:09,985 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:09:09,985 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-11 22:09:09,985 INFO L82 PathProgramCache]: Analyzing trace with hash -643063296, now seen corresponding path program 1 times [2018-04-11 22:09:09,985 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:09:09,985 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:09:09,986 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:09,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:09:09,986 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:09:09,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:09:10,040 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-11 22:09:10,040 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:09:10,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 22:09:10,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 22:09:10,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 22:09:10,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 22:09:10,041 INFO L87 Difference]: Start difference. First operand 135 states and 143 transitions. Second operand 4 states. [2018-04-11 22:09:10,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:09:10,116 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-04-11 22:09:10,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 22:09:10,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-11 22:09:10,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:09:10,117 INFO L225 Difference]: With dead ends: 135 [2018-04-11 22:09:10,117 INFO L226 Difference]: Without dead ends: 135 [2018-04-11 22:09:10,117 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-11 22:09:10,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-11 22:09:10,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2018-04-11 22:09:10,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-11 22:09:10,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-04-11 22:09:10,121 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 12 [2018-04-11 22:09:10,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:09:10,122 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-04-11 22:09:10,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 22:09:10,122 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-04-11 22:09:10,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 22:09:10,122 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:09:10,122 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-11 22:09:10,122 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-11 22:09:10,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1451976942, now seen corresponding path program 1 times [2018-04-11 22:09:10,122 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:09:10,122 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:09:10,123 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:10,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:09:10,123 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:09:10,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:09:10,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:09:10,162 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:09:10,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 22:09:10,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 22:09:10,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 22:09:10,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 22:09:10,162 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 4 states. [2018-04-11 22:09:10,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:09:10,224 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-04-11 22:09:10,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 22:09:10,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-11 22:09:10,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:09:10,225 INFO L225 Difference]: With dead ends: 128 [2018-04-11 22:09:10,225 INFO L226 Difference]: Without dead ends: 128 [2018-04-11 22:09:10,226 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-11 22:09:10,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-11 22:09:10,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-04-11 22:09:10,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-11 22:09:10,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-04-11 22:09:10,231 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 20 [2018-04-11 22:09:10,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:09:10,231 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-04-11 22:09:10,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 22:09:10,232 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-04-11 22:09:10,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 22:09:10,232 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:09:10,232 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-11 22:09:10,232 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-11 22:09:10,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1451976941, now seen corresponding path program 1 times [2018-04-11 22:09:10,233 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:09:10,233 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:09:10,233 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:10,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:09:10,234 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:09:10,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:09:10,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:09:10,281 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:09:10,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 22:09:10,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 22:09:10,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 22:09:10,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 22:09:10,281 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 4 states. [2018-04-11 22:09:10,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:09:10,328 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-04-11 22:09:10,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 22:09:10,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-11 22:09:10,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:09:10,329 INFO L225 Difference]: With dead ends: 123 [2018-04-11 22:09:10,329 INFO L226 Difference]: Without dead ends: 123 [2018-04-11 22:09:10,329 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-11 22:09:10,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-11 22:09:10,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-04-11 22:09:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 22:09:10,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-04-11 22:09:10,333 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 20 [2018-04-11 22:09:10,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:09:10,333 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-04-11 22:09:10,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 22:09:10,333 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-04-11 22:09:10,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 22:09:10,333 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:09:10,333 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-11 22:09:10,333 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-11 22:09:10,333 INFO L82 PathProgramCache]: Analyzing trace with hash -2061612264, now seen corresponding path program 1 times [2018-04-11 22:09:10,333 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:09:10,333 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:09:10,334 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:10,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:09:10,334 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:09:10,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:09:10,403 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-11 22:09:10,403 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:09:10,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 22:09:10,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 22:09:10,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 22:09:10,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-11 22:09:10,404 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 8 states. [2018-04-11 22:09:10,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:09:10,580 INFO L93 Difference]: Finished difference Result 230 states and 245 transitions. [2018-04-11 22:09:10,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 22:09:10,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-04-11 22:09:10,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:09:10,581 INFO L225 Difference]: With dead ends: 230 [2018-04-11 22:09:10,581 INFO L226 Difference]: Without dead ends: 230 [2018-04-11 22:09:10,581 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-11 22:09:10,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-04-11 22:09:10,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 144. [2018-04-11 22:09:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-11 22:09:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 164 transitions. [2018-04-11 22:09:10,587 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 164 transitions. Word has length 21 [2018-04-11 22:09:10,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:09:10,587 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 164 transitions. [2018-04-11 22:09:10,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 22:09:10,587 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 164 transitions. [2018-04-11 22:09:10,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 22:09:10,588 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:09:10,588 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-11 22:09:10,588 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-11 22:09:10,588 INFO L82 PathProgramCache]: Analyzing trace with hash -2061612263, now seen corresponding path program 1 times [2018-04-11 22:09:10,588 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:09:10,588 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:09:10,589 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:10,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:09:10,589 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:09:10,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:09:10,719 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-11 22:09:10,719 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:09:10,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 22:09:10,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 22:09:10,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 22:09:10,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-04-11 22:09:10,720 INFO L87 Difference]: Start difference. First operand 144 states and 164 transitions. Second operand 9 states. [2018-04-11 22:09:10,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:09:10,970 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2018-04-11 22:09:10,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 22:09:10,971 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-04-11 22:09:10,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:09:10,972 INFO L225 Difference]: With dead ends: 205 [2018-04-11 22:09:10,972 INFO L226 Difference]: Without dead ends: 205 [2018-04-11 22:09:10,972 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-11 22:09:10,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-04-11 22:09:10,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 178. [2018-04-11 22:09:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-11 22:09:10,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 210 transitions. [2018-04-11 22:09:10,975 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 210 transitions. Word has length 21 [2018-04-11 22:09:10,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:09:10,976 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 210 transitions. [2018-04-11 22:09:10,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 22:09:10,976 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 210 transitions. [2018-04-11 22:09:10,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 22:09:10,976 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:09:10,976 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-11 22:09:10,976 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-11 22:09:10,977 INFO L82 PathProgramCache]: Analyzing trace with hash 945598509, now seen corresponding path program 1 times [2018-04-11 22:09:10,977 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:09:10,977 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:09:10,977 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:10,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:09:10,978 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:09:10,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:09:11,143 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-11 22:09:11,144 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:09:11,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 22:09:11,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 22:09:11,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 22:09:11,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-04-11 22:09:11,144 INFO L87 Difference]: Start difference. First operand 178 states and 210 transitions. Second operand 11 states. [2018-04-11 22:09:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:09:11,412 INFO L93 Difference]: Finished difference Result 199 states and 233 transitions. [2018-04-11 22:09:11,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 22:09:11,413 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-04-11 22:09:11,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:09:11,414 INFO L225 Difference]: With dead ends: 199 [2018-04-11 22:09:11,414 INFO L226 Difference]: Without dead ends: 199 [2018-04-11 22:09:11,414 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-04-11 22:09:11,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-04-11 22:09:11,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 187. [2018-04-11 22:09:11,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-04-11 22:09:11,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 220 transitions. [2018-04-11 22:09:11,417 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 220 transitions. Word has length 30 [2018-04-11 22:09:11,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:09:11,418 INFO L459 AbstractCegarLoop]: Abstraction has 187 states and 220 transitions. [2018-04-11 22:09:11,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 22:09:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 220 transitions. [2018-04-11 22:09:11,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 22:09:11,418 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:09:11,418 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-11 22:09:11,418 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-11 22:09:11,418 INFO L82 PathProgramCache]: Analyzing trace with hash 548364848, now seen corresponding path program 1 times [2018-04-11 22:09:11,418 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:09:11,418 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:09:11,419 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:11,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:09:11,419 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:09:11,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:09:11,685 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-11 22:09:11,686 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:09:11,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-04-11 22:09:11,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 22:09:11,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 22:09:11,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-04-11 22:09:11,686 INFO L87 Difference]: Start difference. First operand 187 states and 220 transitions. Second operand 14 states. [2018-04-11 22:09:12,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:09:12,061 INFO L93 Difference]: Finished difference Result 248 states and 298 transitions. [2018-04-11 22:09:12,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 22:09:12,062 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-04-11 22:09:12,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:09:12,062 INFO L225 Difference]: With dead ends: 248 [2018-04-11 22:09:12,062 INFO L226 Difference]: Without dead ends: 248 [2018-04-11 22:09:12,063 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2018-04-11 22:09:12,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-04-11 22:09:12,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 155. [2018-04-11 22:09:12,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-11 22:09:12,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 168 transitions. [2018-04-11 22:09:12,066 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 168 transitions. Word has length 32 [2018-04-11 22:09:12,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:09:12,066 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 168 transitions. [2018-04-11 22:09:12,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 22:09:12,066 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 168 transitions. [2018-04-11 22:09:12,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 22:09:12,066 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:09:12,067 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-11 22:09:12,067 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-11 22:09:12,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1723783449, now seen corresponding path program 1 times [2018-04-11 22:09:12,067 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:09:12,067 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:09:12,067 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:12,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:09:12,068 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:09:12,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:09:12,108 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-11 22:09:12,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:09:12,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 22:09:12,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 22:09:12,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 22:09:12,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 22:09:12,109 INFO L87 Difference]: Start difference. First operand 155 states and 168 transitions. Second operand 3 states. [2018-04-11 22:09:12,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:09:12,116 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2018-04-11 22:09:12,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 22:09:12,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-04-11 22:09:12,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:09:12,117 INFO L225 Difference]: With dead ends: 164 [2018-04-11 22:09:12,117 INFO L226 Difference]: Without dead ends: 164 [2018-04-11 22:09:12,117 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-11 22:09:12,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-11 22:09:12,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2018-04-11 22:09:12,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-04-11 22:09:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2018-04-11 22:09:12,121 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 161 transitions. Word has length 40 [2018-04-11 22:09:12,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:09:12,121 INFO L459 AbstractCegarLoop]: Abstraction has 151 states and 161 transitions. [2018-04-11 22:09:12,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 22:09:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 161 transitions. [2018-04-11 22:09:12,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 22:09:12,122 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:09:12,122 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-11 22:09:12,122 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-11 22:09:12,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1911230466, now seen corresponding path program 1 times [2018-04-11 22:09:12,122 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:09:12,122 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:09:12,123 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:12,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:09:12,123 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:09:12,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:09:12,249 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-11 22:09:12,249 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:09:12,250 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-11 22:09:12,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:09:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:09:12,314 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:09:12,457 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-11 22:09:12,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:12,461 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-11 22:09:12,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-04-11 22:09:12,479 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-11 22:09:12,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:12,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:12,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 22:09:12,528 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-11 22:09:12,556 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:09:12,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-04-11 22:09:12,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 22:09:12,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 22:09:12,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=193, Unknown=6, NotChecked=0, Total=240 [2018-04-11 22:09:12,557 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. Second operand 16 states. [2018-04-11 22:09:13,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:09:13,111 INFO L93 Difference]: Finished difference Result 190 states and 199 transitions. [2018-04-11 22:09:13,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 22:09:13,111 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-04-11 22:09:13,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:09:13,112 INFO L225 Difference]: With dead ends: 190 [2018-04-11 22:09:13,112 INFO L226 Difference]: Without dead ends: 190 [2018-04-11 22:09:13,112 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-11 22:09:13,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-04-11 22:09:13,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 153. [2018-04-11 22:09:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-11 22:09:13,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2018-04-11 22:09:13,114 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 43 [2018-04-11 22:09:13,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:09:13,114 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2018-04-11 22:09:13,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 22:09:13,115 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2018-04-11 22:09:13,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 22:09:13,115 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:09:13,115 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-11 22:09:13,116 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-11 22:09:13,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1911230465, now seen corresponding path program 1 times [2018-04-11 22:09:13,116 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:09:13,116 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:09:13,117 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:13,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:09:13,117 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:09:13,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:09:13,262 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-11 22:09:13,263 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:09:13,263 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-11 22:09:13,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:09:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:09:13,318 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:09:13,382 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-11 22:09:13,402 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-11 22:09:13,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 22:09:13,409 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-11 22:09:13,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:19 [2018-04-11 22:09:13,481 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-11 22:09:13,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-11 22:09:13,500 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-11 22:09:13,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-04-11 22:09:13,522 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-11 22:09:13,539 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:09:13,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-04-11 22:09:13,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 22:09:13,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 22:09:13,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=367, Unknown=1, NotChecked=38, Total=462 [2018-04-11 22:09:13,540 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand 22 states. [2018-04-11 22:09:14,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:09:14,251 INFO L93 Difference]: Finished difference Result 212 states and 225 transitions. [2018-04-11 22:09:14,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 22:09:14,251 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-04-11 22:09:14,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:09:14,252 INFO L225 Difference]: With dead ends: 212 [2018-04-11 22:09:14,252 INFO L226 Difference]: Without dead ends: 212 [2018-04-11 22:09:14,252 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-11 22:09:14,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-11 22:09:14,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 180. [2018-04-11 22:09:14,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-11 22:09:14,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 197 transitions. [2018-04-11 22:09:14,257 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 197 transitions. Word has length 43 [2018-04-11 22:09:14,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:09:14,257 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 197 transitions. [2018-04-11 22:09:14,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 22:09:14,257 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 197 transitions. [2018-04-11 22:09:14,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 22:09:14,258 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:09:14,258 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-11 22:09:14,258 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-11 22:09:14,258 INFO L82 PathProgramCache]: Analyzing trace with hash 771137816, now seen corresponding path program 1 times [2018-04-11 22:09:14,259 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:09:14,259 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:09:14,259 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:14,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:09:14,259 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:09:14,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:09:14,770 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-11 22:09:14,770 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:09:14,770 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-11 22:09:14,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:09:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:09:14,811 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:09:14,863 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-11 22:09:14,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:14,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:14,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-11 22:09:15,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 22:09:15,091 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-11 22:09:15,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:15,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:15,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:15,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-11 22:09:15,145 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-11 22:09:15,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-11 22:09:15,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:15,186 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-11 22:09:15,186 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 22:09:15,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 22:09:15,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 22:09:15,206 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:70 [2018-04-11 22:09:15,272 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-11 22:09:15,275 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:15,276 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-11 22:09:15,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:15,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:15,302 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-11 22:09:15,303 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 22:09:15,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 22:09:15,340 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-11 22:09:15,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:15,343 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-11 22:09:15,344 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:15,349 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:15,366 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-11 22:09:15,366 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:102, output treesize:115 [2018-04-11 22:09:15,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:15,441 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:15,441 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-11 22:09:15,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:15,466 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-11 22:09:15,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:139, output treesize:60 [2018-04-11 22:09:15,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:15,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:15,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:15,597 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-11 22:09:15,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:15,608 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-11 22:09:15,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:74, output treesize:82 [2018-04-11 22:09:15,765 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-11 22:09:15,768 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-11 22:09:15,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:15,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:15,792 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-11 22:09:15,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:85 [2018-04-11 22:09:15,841 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-11 22:09:15,843 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-11 22:09:15,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:15,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:15,863 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-11 22:09:15,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:98, output treesize:94 [2018-04-11 22:09:15,913 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-11 22:09:15,916 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-11 22:09:15,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:15,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:15,932 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-11 22:09:15,933 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:15,938 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:09:15,939 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-11 22:09:15,939 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:15,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:15,950 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-11 22:09:15,950 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:103, output treesize:28 [2018-04-11 22:09:15,999 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-11 22:09:16,017 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:09:16,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 41 [2018-04-11 22:09:16,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-11 22:09:16,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-11 22:09:16,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1591, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 22:09:16,018 INFO L87 Difference]: Start difference. First operand 180 states and 197 transitions. Second operand 42 states. [2018-04-11 22:09:20,480 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 102 DAG size of output 69 [2018-04-11 22:09:22,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:09:22,333 INFO L93 Difference]: Finished difference Result 248 states and 270 transitions. [2018-04-11 22:09:22,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 22:09:22,334 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 50 [2018-04-11 22:09:22,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:09:22,335 INFO L225 Difference]: With dead ends: 248 [2018-04-11 22:09:22,335 INFO L226 Difference]: Without dead ends: 248 [2018-04-11 22:09:22,336 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1267 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=620, Invalid=4492, Unknown=0, NotChecked=0, Total=5112 [2018-04-11 22:09:22,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-04-11 22:09:22,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 186. [2018-04-11 22:09:22,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-11 22:09:22,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 201 transitions. [2018-04-11 22:09:22,340 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 201 transitions. Word has length 50 [2018-04-11 22:09:22,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:09:22,340 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 201 transitions. [2018-04-11 22:09:22,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-11 22:09:22,340 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 201 transitions. [2018-04-11 22:09:22,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 22:09:22,341 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:09:22,341 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-11 22:09:22,341 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-11 22:09:22,341 INFO L82 PathProgramCache]: Analyzing trace with hash 771137817, now seen corresponding path program 1 times [2018-04-11 22:09:22,342 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:09:22,342 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:09:22,342 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:22,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:09:22,342 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:09:22,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:09:22,915 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-11 22:09:22,915 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:09:22,915 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-11 22:09:22,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:09:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:09:22,957 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:09:23,010 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-11 22:09:23,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:23,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:23,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-11 22:09:23,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 22:09:23,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:23,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:23,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-04-11 22:09:23,148 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-11 22:09:23,150 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-11 22:09:23,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:23,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:23,159 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-11 22:09:23,160 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-11 22:09:23,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:23,162 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:23,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:23,166 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-11 22:09:23,222 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-11 22:09:23,232 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-11 22:09:23,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 22:09:23,251 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-11 22:09:23,252 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:23,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 22:09:23,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, 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-11 22:09:23,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-11 22:09:23,298 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:23,315 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-11 22:09:23,315 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 22:09:23,324 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 22:09:23,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 22:09:23,344 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:60, output treesize:203 [2018-04-11 22:09:23,425 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-11 22:09:23,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:23,428 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-11 22:09:23,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:23,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:23,478 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-11 22:09:23,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:23,480 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-11 22:09:23,480 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:23,490 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:23,535 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-11 22:09:23,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:23,540 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-11 22:09:23,540 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:23,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:23,604 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-11 22:09:23,604 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 22:09:23,667 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 22:09:23,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 152 [2018-04-11 22:09:23,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:23,736 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-11 22:09:23,736 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:23,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:23,788 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-11 22:09:23,789 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-11 22:09:23,818 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 22:09:23,820 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-11 22:09:23,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:23,824 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:09:23,826 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-11 22:09:23,827 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:23,838 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:23,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 22:09:23,890 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:235, output treesize:267 [2018-04-11 22:09:23,982 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 22:09:23,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:24,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:24,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:24,017 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-11 22:09:24,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:24,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:24,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:291, output treesize:144 [2018-04-11 22:09:24,192 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-11 22:09:24,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:24,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:24,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:24,211 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-11 22:09:24,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:24,224 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-11 22:09:24,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:158, output treesize:141 [2018-04-11 22:09:24,417 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-11 22:09:24,420 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-11 22:09:24,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:24,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:24,479 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-11 22:09:24,480 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-11 22:09:24,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 22:09:24,584 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-11 22:09:24,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:24,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:24,587 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:09:24,589 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-11 22:09:24,589 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:24,603 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:24,618 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-11 22:09:24,621 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-11 22:09:24,622 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:24,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:24,696 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-11 22:09:24,696 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-04-11 22:09:24,766 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 22:09:24,772 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-11 22:09:24,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:24,775 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:09:24,777 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-11 22:09:24,777 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:24,793 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:24,851 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-11 22:09:24,851 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:170, output treesize:327 [2018-04-11 22:09:24,978 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-11 22:09:24,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:24,984 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-11 22:09:24,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:25,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 166 [2018-04-11 22:09:25,051 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:25,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:25,211 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-11 22:09:25,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:25,215 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-11 22:09:25,215 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:25,233 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:25,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 128 [2018-04-11 22:09:25,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:25,341 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-11 22:09:25,341 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:25,353 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:25,455 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-11 22:09:25,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 172 [2018-04-11 22:09:25,461 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:25,551 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:25,615 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:09:25,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 141 [2018-04-11 22:09:25,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 22:09:25,618 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:25,630 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:25,692 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:09:25,693 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-11 22:09:25,694 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-11 22:09:25,694 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:25,704 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:25,751 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-11 22:09:25,751 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 11 variables, input treesize:481, output treesize:391 [2018-04-11 22:09:25,876 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-11 22:09:25,878 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:09:25,878 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-11 22:09:25,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:25,894 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-11 22:09:25,894 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:25,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:25,932 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-11 22:09:25,933 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-11 22:09:25,933 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:25,941 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:09:25,942 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-11 22:09:25,942 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:25,948 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:25,973 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-11 22:09:25,975 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:09:25,975 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-11 22:09:25,975 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:25,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:25,991 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-11 22:09:25,991 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:26,002 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:26,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11 22:09:26,024 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:09:26,024 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-11 22:09:26,025 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:26,033 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:26,034 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-11 22:09:26,034 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:26,048 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:26,061 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-11 22:09:26,061 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 10 variables, input treesize:265, output treesize:14 [2018-04-11 22:09:26,104 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-11 22:09:26,122 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:09:26,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 41 [2018-04-11 22:09:26,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-11 22:09:26,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-11 22:09:26,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1610, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 22:09:26,123 INFO L87 Difference]: Start difference. First operand 186 states and 201 transitions. Second operand 42 states. [2018-04-11 22:09:27,029 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 114 DAG size of output 99 [2018-04-11 22:09:28,322 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 193 DAG size of output 99 [2018-04-11 22:09:29,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:09:29,500 INFO L93 Difference]: Finished difference Result 245 states and 267 transitions. [2018-04-11 22:09:29,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 22:09:29,500 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 50 [2018-04-11 22:09:29,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:09:29,501 INFO L225 Difference]: With dead ends: 245 [2018-04-11 22:09:29,501 INFO L226 Difference]: Without dead ends: 245 [2018-04-11 22:09:29,502 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-11 22:09:29,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-04-11 22:09:29,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 186. [2018-04-11 22:09:29,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-11 22:09:29,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 200 transitions. [2018-04-11 22:09:29,506 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 200 transitions. Word has length 50 [2018-04-11 22:09:29,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:09:29,506 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 200 transitions. [2018-04-11 22:09:29,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-11 22:09:29,507 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 200 transitions. [2018-04-11 22:09:29,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 22:09:29,507 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:09:29,507 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-11 22:09:29,507 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-11 22:09:29,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1788489223, now seen corresponding path program 1 times [2018-04-11 22:09:29,508 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:09:29,508 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:09:29,508 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:29,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:09:29,508 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:09:29,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:09:30,075 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-11 22:09:30,076 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:09:30,076 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-11 22:09:30,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:09:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:09:30,107 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:09:30,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:30,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:30,132 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-11 22:09:30,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:30,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:30,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-11 22:09:30,170 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-11 22:09:30,172 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-11 22:09:30,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:30,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:30,179 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-11 22:09:30,181 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-11 22:09:30,181 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:30,182 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:30,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:30,186 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2018-04-11 22:09:30,193 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-11 22:09:30,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:30,195 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-11 22:09:30,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:30,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:30,210 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-11 22:09:30,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:30,212 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-11 22:09:30,212 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:30,215 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:30,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:30,221 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-04-11 22:09:30,456 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-11 22:09:30,577 WARN L148 SmtUtils]: Spent 116ms on a formula simplification that was a NOOP. DAG size: 70 [2018-04-11 22:09:30,583 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:30,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:30,587 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-11 22:09:30,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:30,708 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-11 22:09:30,710 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-11 22:09:30,713 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:30,713 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-11 22:09:30,713 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:30,719 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:30,750 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-11 22:09:30,752 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-11 22:09:30,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:30,755 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-11 22:09:30,755 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:30,761 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:30,775 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:30,790 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-11 22:09:30,797 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-11 22:09:30,799 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-11 22:09:30,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:30,802 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-11 22:09:30,803 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:30,810 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:30,837 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-11 22:09:30,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:30,852 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-11 22:09:30,855 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 22:09:30,855 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:30,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:30,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:30,902 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-11 22:09:30,902 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-04-11 22:09:30,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:30,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:30,953 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:09:30,955 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-11 22:09:30,955 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:30,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:30,993 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:30,993 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:30,996 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-11 22:09:30,996 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:31,034 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 22:09:31,070 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 22:09:31,132 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-11 22:09:31,251 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-11 22:09:31,253 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-11 22:09:31,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:31,255 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-11 22:09:31,255 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:31,260 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:31,276 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-11 22:09:31,278 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-11 22:09:31,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:31,280 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-11 22:09:31,281 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:31,284 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:31,293 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:31,301 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-11 22:09:31,307 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-11 22:09:31,309 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-11 22:09:31,312 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:31,312 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-11 22:09:31,312 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:31,318 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:31,335 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-11 22:09:31,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:31,351 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-11 22:09:31,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:31,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:31,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:31,365 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-11 22:09:31,365 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:31,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:31,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:31,423 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-11 22:09:31,424 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-04-11 22:09:31,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:31,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:31,454 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:09:31,455 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-11 22:09:31,455 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:31,480 INFO L267 ElimStorePlain]: Start of recursive call 28: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 22:09:31,504 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 22:09:31,538 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-11 22:09:31,618 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-11 22:09:31,619 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 7 variables, input treesize:135, output treesize:1536 [2018-04-11 22:09:48,649 WARN L151 SmtUtils]: Spent 14712ms on a formula simplification. DAG size of input: 330 DAG size of output 35 [2018-04-11 22:09:48,777 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-11 22:09:48,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:48,779 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-11 22:09:48,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:48,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:48,795 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-11 22:09:48,796 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:48,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:48,808 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-11 22:09:48,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:48,810 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-11 22:09:48,811 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:48,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:48,817 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-11 22:09:48,818 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:48,820 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:48,823 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-11 22:09:48,823 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:83, output treesize:7 [2018-04-11 22:09:48,890 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-11 22:09:48,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:09:48,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 35 [2018-04-11 22:09:48,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 22:09:48,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 22:09:48,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1016, Unknown=16, NotChecked=64, Total=1190 [2018-04-11 22:09:48,909 INFO L87 Difference]: Start difference. First operand 186 states and 200 transitions. Second operand 35 states. [2018-04-11 22:09:50,329 WARN L148 SmtUtils]: Spent 129ms on a formula simplification that was a NOOP. DAG size: 66 [2018-04-11 22:09:51,172 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 94 DAG size of output 78 [2018-04-11 22:09:53,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:09:53,162 INFO L93 Difference]: Finished difference Result 297 states and 319 transitions. [2018-04-11 22:09:53,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 22:09:53,162 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 52 [2018-04-11 22:09:53,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:09:53,163 INFO L225 Difference]: With dead ends: 297 [2018-04-11 22:09:53,163 INFO L226 Difference]: Without dead ends: 297 [2018-04-11 22:09:53,164 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=333, Invalid=2689, Unknown=62, NotChecked=108, Total=3192 [2018-04-11 22:09:53,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-04-11 22:09:53,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 212. [2018-04-11 22:09:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-04-11 22:09:53,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 234 transitions. [2018-04-11 22:09:53,168 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 234 transitions. Word has length 52 [2018-04-11 22:09:53,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:09:53,168 INFO L459 AbstractCegarLoop]: Abstraction has 212 states and 234 transitions. [2018-04-11 22:09:53,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 22:09:53,168 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 234 transitions. [2018-04-11 22:09:53,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 22:09:53,169 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:09:53,169 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-11 22:09:53,169 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-11 22:09:53,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1182477942, now seen corresponding path program 1 times [2018-04-11 22:09:53,170 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:09:53,170 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:09:53,170 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:53,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:09:53,170 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:09:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:09:53,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:09:54,144 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-11 22:09:54,144 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:09:54,145 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-11 22:09:54,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:09:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:09:54,173 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:09:54,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:54,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:54,197 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-11 22:09:54,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:54,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:54,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-11 22:09:54,269 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-11 22:09:54,270 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-11 22:09:54,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:54,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:54,278 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-11 22:09:54,279 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-11 22:09:54,279 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:54,280 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:54,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:54,285 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-04-11 22:09:54,531 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-11 22:09:54,655 WARN L148 SmtUtils]: Spent 120ms on a formula simplification that was a NOOP. DAG size: 67 [2018-04-11 22:09:54,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:54,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:54,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, 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-11 22:09:54,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:54,778 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-11 22:09:54,781 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-11 22:09:54,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:54,784 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-11 22:09:54,785 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:54,792 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:54,823 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-11 22:09:54,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-11 22:09:54,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:54,829 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-11 22:09:54,829 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:54,835 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:54,847 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:54,861 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-11 22:09:54,868 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-11 22:09:54,871 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-11 22:09:54,874 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:54,875 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-11 22:09:54,875 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:54,883 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:54,908 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-11 22:09:54,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:54,924 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-11 22:09:54,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:54,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:54,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:54,935 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-11 22:09:54,935 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:54,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:54,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:54,974 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:09:54,977 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-11 22:09:54,977 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:55,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:55,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:55,053 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-11 22:09:55,053 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-04-11 22:09:55,090 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 22:09:55,126 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 22:09:55,191 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-11 22:09:55,287 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-11 22:09:55,289 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-11 22:09:55,291 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:55,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 22:09:55,292 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:55,298 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:55,314 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-11 22:09:55,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:55,329 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-11 22:09:55,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:55,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:55,333 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:09:55,334 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-11 22:09:55,334 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:55,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:55,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:55,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:55,383 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-11 22:09:55,383 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:55,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:55,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:55,435 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-11 22:09:55,435 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-04-11 22:09:55,465 INFO L267 ElimStorePlain]: Start of recursive call 21: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 22:09:55,492 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 22:09:55,523 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-11 22:09:55,533 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-11 22:09:55,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 22:09:55,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:55,538 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-11 22:09:55,538 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:55,542 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:55,560 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-11 22:09:55,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-04-11 22:09:55,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:09:55,565 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-11 22:09:55,565 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-11 22:09:55,569 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:55,578 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:09:55,587 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-11 22:09:55,672 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-11 22:09:55,672 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 7 variables, input treesize:124, output treesize:1404 [2018-04-11 22:10:16,376 WARN L151 SmtUtils]: Spent 13910ms on a formula simplification. DAG size of input: 327 DAG size of output 32 [2018-04-11 22:10:16,610 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-11 22:10:16,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:10:16,612 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-11 22:10:16,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:10:16,618 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:10:16,619 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-11 22:10:16,619 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 22:10:16,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:10:16,633 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-11 22:10:16,634 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:10:16,634 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-11 22:10:16,635 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 22:10:16,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:10:16,640 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-11 22:10:16,640 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 22:10:16,642 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:10:16,647 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-11 22:10:16,648 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:82, output treesize:7 [2018-04-11 22:10:16,725 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-11 22:10:16,743 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:10:16,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 41 [2018-04-11 22:10:16,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-11 22:10:16,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-11 22:10:16,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1421, Unknown=28, NotChecked=76, Total=1640 [2018-04-11 22:10:16,743 INFO L87 Difference]: Start difference. First operand 212 states and 234 transitions. Second operand 41 states. [2018-04-11 22:10:19,462 WARN L148 SmtUtils]: Spent 109ms on a formula simplification that was a NOOP. DAG size: 65 [2018-04-11 22:10:23,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:10:23,820 INFO L93 Difference]: Finished difference Result 279 states and 296 transitions. [2018-04-11 22:10:23,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 22:10:23,820 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 54 [2018-04-11 22:10:23,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:10:23,821 INFO L225 Difference]: With dead ends: 279 [2018-04-11 22:10:23,821 INFO L226 Difference]: Without dead ends: 279 [2018-04-11 22:10:23,822 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=443, Invalid=3903, Unknown=80, NotChecked=130, Total=4556 [2018-04-11 22:10:23,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-04-11 22:10:23,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 205. [2018-04-11 22:10:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-11 22:10:23,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 224 transitions. [2018-04-11 22:10:23,826 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 224 transitions. Word has length 54 [2018-04-11 22:10:23,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:10:23,826 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 224 transitions. [2018-04-11 22:10:23,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-11 22:10:23,826 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 224 transitions. [2018-04-11 22:10:23,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 22:10:23,827 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:10:23,827 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-11 22:10:23,827 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-11 22:10:23,827 INFO L82 PathProgramCache]: Analyzing trace with hash -298162330, now seen corresponding path program 1 times [2018-04-11 22:10:23,828 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:10:23,828 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:10:23,828 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:10:23,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:10:23,828 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:10:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:10:23,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:10:23,870 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-11 22:10:23,870 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:10:23,870 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-11 22:10:23,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:10:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:10:23,918 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:10:23,936 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-11 22:10:23,956 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:10:23,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-04-11 22:10:23,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 22:10:23,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 22:10:23,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-11 22:10:23,957 INFO L87 Difference]: Start difference. First operand 205 states and 224 transitions. Second operand 5 states. [2018-04-11 22:10:23,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:10:23,974 INFO L93 Difference]: Finished difference Result 240 states and 265 transitions. [2018-04-11 22:10:23,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 22:10:23,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-04-11 22:10:23,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:10:23,976 INFO L225 Difference]: With dead ends: 240 [2018-04-11 22:10:23,976 INFO L226 Difference]: Without dead ends: 240 [2018-04-11 22:10:23,976 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-11 22:10:23,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-04-11 22:10:23,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 221. [2018-04-11 22:10:23,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-11 22:10:23,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 246 transitions. [2018-04-11 22:10:23,981 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 246 transitions. Word has length 58 [2018-04-11 22:10:23,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:10:23,981 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 246 transitions. [2018-04-11 22:10:23,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 22:10:23,981 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 246 transitions. [2018-04-11 22:10:23,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 22:10:23,982 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:10:23,982 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-11 22:10:23,982 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-11 22:10:23,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1910577447, now seen corresponding path program 1 times [2018-04-11 22:10:23,982 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:10:23,982 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:10:23,983 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:10:23,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:10:23,983 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:10:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:10:23,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:10:24,002 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-11 22:10:24,003 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:10:24,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 22:10:24,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 22:10:24,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 22:10:24,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 22:10:24,005 INFO L87 Difference]: Start difference. First operand 221 states and 246 transitions. Second operand 3 states. [2018-04-11 22:10:24,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:10:24,011 INFO L93 Difference]: Finished difference Result 223 states and 248 transitions. [2018-04-11 22:10:24,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 22:10:24,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-04-11 22:10:24,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:10:24,013 INFO L225 Difference]: With dead ends: 223 [2018-04-11 22:10:24,013 INFO L226 Difference]: Without dead ends: 223 [2018-04-11 22:10:24,013 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-11 22:10:24,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-11 22:10:24,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-04-11 22:10:24,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-04-11 22:10:24,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 248 transitions. [2018-04-11 22:10:24,018 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 248 transitions. Word has length 64 [2018-04-11 22:10:24,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:10:24,018 INFO L459 AbstractCegarLoop]: Abstraction has 223 states and 248 transitions. [2018-04-11 22:10:24,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 22:10:24,018 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 248 transitions. [2018-04-11 22:10:24,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 22:10:24,018 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:10:24,018 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-11 22:10:24,018 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-11 22:10:24,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1942436994, now seen corresponding path program 1 times [2018-04-11 22:10:24,019 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:10:24,019 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:10:24,019 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:10:24,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:10:24,020 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:10:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:10:24,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:10:24,219 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-11 22:10:24,219 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:10:24,219 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-11 22:10:24,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:10:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:10:24,260 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:10:24,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:10:24,353 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-11 22:10:24,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:10:24,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:10:24,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:10:24,363 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-11 22:10:24,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:10:24,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:10:24,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 22:10:24,426 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-11 22:10:24,444 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:10:24,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2018-04-11 22:10:24,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 22:10:24,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 22:10:24,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2018-04-11 22:10:24,445 INFO L87 Difference]: Start difference. First operand 223 states and 248 transitions. Second operand 23 states. [2018-04-11 22:10:24,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:10:24,863 INFO L93 Difference]: Finished difference Result 268 states and 288 transitions. [2018-04-11 22:10:24,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 22:10:24,863 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2018-04-11 22:10:24,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:10:24,864 INFO L225 Difference]: With dead ends: 268 [2018-04-11 22:10:24,864 INFO L226 Difference]: Without dead ends: 268 [2018-04-11 22:10:24,864 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-11 22:10:24,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-04-11 22:10:24,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 250. [2018-04-11 22:10:24,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-11 22:10:24,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 276 transitions. [2018-04-11 22:10:24,869 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 276 transitions. Word has length 66 [2018-04-11 22:10:24,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:10:24,870 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 276 transitions. [2018-04-11 22:10:24,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 22:10:24,870 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 276 transitions. [2018-04-11 22:10:24,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 22:10:24,870 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:10:24,871 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-11 22:10:24,871 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-11 22:10:24,871 INFO L82 PathProgramCache]: Analyzing trace with hash 640456924, now seen corresponding path program 1 times [2018-04-11 22:10:24,871 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:10:24,871 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:10:24,872 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:10:24,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:10:24,872 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:10:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:10:24,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:10:25,365 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-11 22:10:25,365 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:10:25,365 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-11 22:10:25,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:10:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:10:25,405 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:10:25,431 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-11 22:10:25,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:10:25,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:10:25,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 22:10:25,553 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-11 22:10:25,554 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-11 22:10:25,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:10:25,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:10:25,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:10:25,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-11 22:10:25,587 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-11 22:10:25,588 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:10:25,589 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-11 22:10:25,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:10:25,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:10:25,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:10:25,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-04-11 22:10:25,634 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-11 22:10:25,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 31 treesize of output 30 [2018-04-11 22:10:25,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:10:25,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:10:25,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:10:25,672 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-11 22:10:25,672 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-11 22:10:25,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 22:10:25,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 22:10:25,718 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:39, output treesize:108 [2018-04-11 22:10:25,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:10:25,768 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-11 22:10:25,769 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-11 22:10:25,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:10:25,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:10:25,803 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-11 22:10:25,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:10:25,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:10:25,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:10:25,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:10:25,807 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-11 22:10:25,807 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:10:25,824 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:10:25,866 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-11 22:10:25,869 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:10:25,869 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-11 22:10:25,870 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 22:10:25,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:10:25,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:10:25,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:10:25,911 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-11 22:10:25,912 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 22:10:25,949 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 22:10:25,985 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-11 22:10:25,985 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:144, output treesize:168 [2018-04-11 22:10:26,053 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 22:10:26,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:10:26,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:10:26,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:10:26,073 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-11 22:10:26,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:10:26,087 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-11 22:10:26,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:188, output treesize:60 [2018-04-11 22:10:26,236 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-11 22:10:26,264 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:10:26,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 33 [2018-04-11 22:10:26,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 22:10:26,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 22:10:26,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 22:10:26,265 INFO L87 Difference]: Start difference. First operand 250 states and 276 transitions. Second operand 33 states. [2018-04-11 22:10:27,267 WARN L151 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 96 DAG size of output 87 [2018-04-11 22:10:28,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:10:28,673 INFO L93 Difference]: Finished difference Result 294 states and 317 transitions. [2018-04-11 22:10:28,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 22:10:28,673 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 66 [2018-04-11 22:10:28,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:10:28,674 INFO L225 Difference]: With dead ends: 294 [2018-04-11 22:10:28,674 INFO L226 Difference]: Without dead ends: 275 [2018-04-11 22:10:28,675 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=519, Invalid=3771, Unknown=0, NotChecked=0, Total=4290 [2018-04-11 22:10:28,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-11 22:10:28,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 221. [2018-04-11 22:10:28,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-11 22:10:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 240 transitions. [2018-04-11 22:10:28,678 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 240 transitions. Word has length 66 [2018-04-11 22:10:28,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:10:28,678 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 240 transitions. [2018-04-11 22:10:28,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 22:10:28,678 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 240 transitions. [2018-04-11 22:10:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-11 22:10:28,678 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:10:28,679 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-11 22:10:28,679 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-11 22:10:28,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1123343448, now seen corresponding path program 1 times [2018-04-11 22:10:28,679 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:10:28,679 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:10:28,679 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:10:28,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:10:28,679 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:10:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:10:28,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:10:28,989 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-11 22:10:28,989 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:10:28,989 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-11 22:10:28,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:10:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:10:29,035 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:10:29,128 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-11 22:10:29,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:10:29,137 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-11 22:10:29,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:10:29,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:10:29,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:10:29,149 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-11 22:10:29,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:10:29,154 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-11 22:10:29,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-11 22:10:29,192 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-11 22:10:29,202 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-11 22:10:29,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 22:10:29,213 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-11 22:10:29,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:25 [2018-04-11 22:10:29,288 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-11 22:10:29,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 22:10:29,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:10:29,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:25 [2018-04-11 22:10:29,374 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-11 22:10:29,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:10:29,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2018-04-11 22:10:29,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 22:10:29,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 22:10:29,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=674, Unknown=2, NotChecked=106, Total=870 [2018-04-11 22:10:29,393 INFO L87 Difference]: Start difference. First operand 221 states and 240 transitions. Second operand 30 states. [2018-04-11 22:10:30,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:10:30,439 INFO L93 Difference]: Finished difference Result 243 states and 258 transitions. [2018-04-11 22:10:30,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 22:10:30,439 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 68 [2018-04-11 22:10:30,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:10:30,440 INFO L225 Difference]: With dead ends: 243 [2018-04-11 22:10:30,440 INFO L226 Difference]: Without dead ends: 243 [2018-04-11 22:10:30,440 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-11 22:10:30,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-04-11 22:10:30,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 204. [2018-04-11 22:10:30,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-04-11 22:10:30,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 219 transitions. [2018-04-11 22:10:30,443 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 219 transitions. Word has length 68 [2018-04-11 22:10:30,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:10:30,443 INFO L459 AbstractCegarLoop]: Abstraction has 204 states and 219 transitions. [2018-04-11 22:10:30,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 22:10:30,443 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 219 transitions. [2018-04-11 22:10:30,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-11 22:10:30,444 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:10:30,444 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-11 22:10:30,444 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-11 22:10:30,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1088555564, now seen corresponding path program 1 times [2018-04-11 22:10:30,444 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 22:10:30,444 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 22:10:30,445 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:10:30,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:10:30,445 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 22:10:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:10:30,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 22:10:31,160 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-11 22:10:31,160 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 22:10:31,160 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-11 22:10:31,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 22:10:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:10:31,197 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:10:31,320 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-11 22:10:31,323 INFO L168 Benchmark]: Toolchain (without parser) took 82827.49 ms. Allocated memory was 404.8 MB in the beginning and 827.9 MB in the end (delta: 423.1 MB). Free memory was 333.2 MB in the beginning and 717.7 MB in the end (delta: -384.5 MB). Peak memory consumption was 38.6 MB. Max. memory is 5.3 GB. [2018-04-11 22:10:31,324 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 404.8 MB. Free memory is still 361.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 22:10:31,324 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.59 ms. Allocated memory is still 404.8 MB. Free memory was 333.2 MB in the beginning and 305.3 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. [2018-04-11 22:10:31,325 INFO L168 Benchmark]: Boogie Preprocessor took 46.48 ms. Allocated memory is still 404.8 MB. Free memory was 305.3 MB in the beginning and 302.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 22:10:31,325 INFO L168 Benchmark]: RCFGBuilder took 494.72 ms. Allocated memory was 404.8 MB in the beginning and 593.5 MB in the end (delta: 188.7 MB). Free memory was 302.7 MB in the beginning and 510.3 MB in the end (delta: -207.7 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. [2018-04-11 22:10:31,325 INFO L168 Benchmark]: TraceAbstraction took 82039.34 ms. Allocated memory was 593.5 MB in the beginning and 827.9 MB in the end (delta: 234.4 MB). Free memory was 510.3 MB in the beginning and 717.9 MB in the end (delta: -207.6 MB). Peak memory consumption was 26.8 MB. Max. memory is 5.3 GB. [2018-04-11 22:10:31,326 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.15 ms. Allocated memory is still 404.8 MB. Free memory is still 361.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 244.59 ms. Allocated memory is still 404.8 MB. Free memory was 333.2 MB in the beginning and 305.3 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 46.48 ms. Allocated memory is still 404.8 MB. Free memory was 305.3 MB in the beginning and 302.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 494.72 ms. Allocated memory was 404.8 MB in the beginning and 593.5 MB in the end (delta: 188.7 MB). Free memory was 302.7 MB in the beginning and 510.3 MB in the end (delta: -207.7 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 82039.34 ms. Allocated memory was 593.5 MB in the beginning and 827.9 MB in the end (delta: 234.4 MB). Free memory was 510.3 MB in the beginning and 717.9 MB in the end (delta: -207.6 MB). Peak memory consumption was 26.8 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-11_22-10-31-332.csv Received shutdown request...