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_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 11:05:18,726 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 11:05:18,728 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 11:05:18,742 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 11:05:18,742 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 11:05:18,743 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 11:05:18,744 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 11:05:18,745 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 11:05:18,747 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 11:05:18,748 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 11:05:18,748 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 11:05:18,749 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 11:05:18,749 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 11:05:18,750 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 11:05:18,751 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 11:05:18,753 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 11:05:18,754 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 11:05:18,756 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 11:05:18,757 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 11:05:18,758 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 11:05:18,760 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 11:05:18,760 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 11:05:18,760 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 11:05:18,761 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 11:05:18,762 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 11:05:18,763 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 11:05:18,763 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 11:05:18,764 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 11:05:18,764 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 11:05:18,764 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 11:05:18,765 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 11:05:18,765 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 11:05:18,786 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 11:05:18,787 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 11:05:18,788 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 11:05:18,788 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 11:05:18,788 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 11:05:18,788 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 11:05:18,788 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 11:05:18,788 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 11:05:18,789 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 11:05:18,789 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 11:05:18,789 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 11:05:18,789 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 11:05:18,789 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 11:05:18,789 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 11:05:18,789 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 11:05:18,789 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 11:05:18,789 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 11:05:18,790 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 11:05:18,790 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 11:05:18,790 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 11:05:18,790 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 11:05:18,790 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 11:05:18,790 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 11:05:18,790 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 11:05:18,818 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 11:05:18,826 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 11:05:18,829 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 11:05:18,830 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 11:05:18,831 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 11:05:18,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,150 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG7673069fc [2018-04-11 11:05:19,289 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 11:05:19,290 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 11:05:19,290 INFO L168 CDTParser]: Scanning length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,297 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 11:05:19,298 INFO L215 ultiparseSymbolTable]: [2018-04-11 11:05:19,298 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 11:05:19,298 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flength_test___true_valid_memsafety_i__append ('append') in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,298 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flength_test___true_valid_memsafety_i____bswap_64 ('__bswap_64') in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,298 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,298 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flength_test___true_valid_memsafety_i____bswap_32 ('__bswap_32') in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,298 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 11:05:19,298 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__nlink_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,298 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fd_mask in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__wchar_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_attr_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____sig_atomic_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_once_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_int8_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__dev_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_condattr_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__id_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____u_int in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____clock_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__timer_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__clockid_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__fsid_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____int8_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_spinlock_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____nlink_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____sigset_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__suseconds_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____blkcnt64_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____uint64_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__gid_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__ssize_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__fd_mask in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_short in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__uint in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_long in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____uid_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pid_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fsword_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____ino64_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____uint16_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__int8_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__daddr_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__clock_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____syscall_slong_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____loff_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,302 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____blkcnt_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,302 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__register_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,302 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__int64_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,302 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____daddr_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,302 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fsfilcnt_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,302 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_barrierattr_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,302 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__ldiv_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,302 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_quad_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,303 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__ushort in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,303 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_mutex_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,303 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____time_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,303 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_int64_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,303 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____useconds_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,303 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fsfilcnt64_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,303 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__loff_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,303 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____key_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,303 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__ino_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,304 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____uint8_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,304 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____int64_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,304 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____qaddr_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,304 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__int16_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,304 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__blksize_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,304 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____u_char in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,304 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____blksize_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,304 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_key_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,305 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_rwlock_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,305 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__lldiv_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,305 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____dev_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,305 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fsblkcnt_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,305 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__uid_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,305 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____rlim64_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,305 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____uint32_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,305 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__fsblkcnt_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,305 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__time_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,305 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__div_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,305 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____int32_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____id_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____syscall_ulong_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__ulong in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__mode_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__sigset_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____pthread_slist_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_int32_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____u_short in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__caddr_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__key_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_rwlockattr_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____caddr_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__fd_set in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____off_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____quad_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____mode_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,306 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__fsfilcnt_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fsid_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____gid_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__int32_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____pid_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____ssize_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____socklen_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_mutexattr_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____ino_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__off_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____timer_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____u_long in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_cond_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____int16_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__size_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____intptr_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_int16_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__blkcnt_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____rlim_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____clockid_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_char in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,307 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__u_int in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__quad_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____fsblkcnt64_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____off64_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____suseconds_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i__pthread_barrier_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,308 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___true_valid_memsafety_i____u_quad_t in length_test03_true-valid-memsafety.i [2018-04-11 11:05:19,321 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG7673069fc [2018-04-11 11:05:19,325 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 11:05:19,326 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 11:05:19,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 11:05:19,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 11:05:19,333 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 11:05:19,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 11:05:19" (1/1) ... [2018-04-11 11:05:19,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7451d7e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:05:19, skipping insertion in model container [2018-04-11 11:05:19,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 11:05:19" (1/1) ... [2018-04-11 11:05:19,350 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 11:05:19,379 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 11:05:19,536 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 11:05:19,576 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 11:05:19,583 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 119 non ball SCCs. Number of states in SCCs 119. [2018-04-11 11:05:19,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:05:19 WrapperNode [2018-04-11 11:05:19,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 11:05:19,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 11:05:19,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 11:05:19,621 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 11:05:19,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:05:19" (1/1) ... [2018-04-11 11:05:19,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:05:19" (1/1) ... [2018-04-11 11:05:19,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:05:19" (1/1) ... [2018-04-11 11:05:19,646 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:05:19" (1/1) ... [2018-04-11 11:05:19,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:05:19" (1/1) ... [2018-04-11 11:05:19,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:05:19" (1/1) ... [2018-04-11 11:05:19,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:05:19" (1/1) ... [2018-04-11 11:05:19,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 11:05:19,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 11:05:19,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 11:05:19,668 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 11:05:19,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:05:19" (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 11:05:19,758 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 11:05:19,759 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 11:05:19,759 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___true_valid_memsafety_i____bswap_32 [2018-04-11 11:05:19,759 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___true_valid_memsafety_i____bswap_64 [2018-04-11 11:05:19,759 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___true_valid_memsafety_i__append [2018-04-11 11:05:19,759 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 11:05:19,759 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 11:05:19,759 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 11:05:19,759 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 11:05:19,759 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 11:05:19,760 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 11:05:19,760 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 11:05:19,760 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 11:05:19,760 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 11:05:19,760 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 11:05:19,760 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 11:05:19,760 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 11:05:19,760 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 11:05:19,760 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 11:05:19,761 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 11:05:19,761 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 11:05:19,761 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 11:05:19,761 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 11:05:19,761 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___true_valid_memsafety_i____bswap_32 [2018-04-11 11:05:19,761 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___true_valid_memsafety_i____bswap_64 [2018-04-11 11:05:19,761 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 11:05:19,761 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 11:05:19,761 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 11:05:19,762 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 11:05:19,762 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 11:05:19,762 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 11:05:19,762 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 11:05:19,762 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 11:05:19,762 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 11:05:19,762 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 11:05:19,762 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 11:05:19,762 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 11:05:19,763 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 11:05:19,763 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 11:05:19,763 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 11:05:19,763 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 11:05:19,763 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 11:05:19,763 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 11:05:19,763 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 11:05:19,763 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 11:05:19,763 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 11:05:19,763 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 11:05:19,764 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 11:05:19,764 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 11:05:19,764 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 11:05:19,764 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 11:05:19,764 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 11:05:19,764 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 11:05:19,764 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 11:05:19,764 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 11:05:19,764 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 11:05:19,765 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 11:05:19,765 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 11:05:19,765 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 11:05:19,765 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 11:05:19,765 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 11:05:19,765 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 11:05:19,765 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 11:05:19,765 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 11:05:19,765 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 11:05:19,765 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 11:05:19,766 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 11:05:19,766 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-11 11:05:19,766 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 11:05:19,766 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 11:05:19,766 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-11 11:05:19,766 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 11:05:19,766 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 11:05:19,766 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-11 11:05:19,766 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 11:05:19,766 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 11:05:19,767 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 11:05:19,767 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 11:05:19,767 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 11:05:19,767 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 11:05:19,767 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 11:05:19,767 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 11:05:19,767 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 11:05:19,767 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 11:05:19,767 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 11:05:19,767 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 11:05:19,767 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 11:05:19,768 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 11:05:19,768 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 11:05:19,768 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 11:05:19,768 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 11:05:19,768 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 11:05:19,768 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 11:05:19,768 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 11:05:19,768 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 11:05:19,768 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 11:05:19,768 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 11:05:19,768 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 11:05:19,769 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 11:05:19,769 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 11:05:19,769 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 11:05:19,769 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 11:05:19,769 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 11:05:19,769 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 11:05:19,769 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 11:05:19,769 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 11:05:19,769 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 11:05:19,769 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 11:05:19,770 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 11:05:19,770 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 11:05:19,770 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 11:05:19,770 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 11:05:19,770 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-04-11 11:05:19,770 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 11:05:19,770 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___true_valid_memsafety_i__append [2018-04-11 11:05:19,770 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 11:05:19,770 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 11:05:19,770 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 11:05:19,771 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 11:05:19,771 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 11:05:19,771 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 11:05:19,771 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 11:05:19,771 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 11:05:19,771 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 11:05:19,771 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 11:05:20,133 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 11:05:20,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 11:05:20 BoogieIcfgContainer [2018-04-11 11:05:20,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 11:05:20,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 11:05:20,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 11:05:20,141 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 11:05:20,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 11:05:19" (1/3) ... [2018-04-11 11:05:20,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b215af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 11:05:20, skipping insertion in model container [2018-04-11 11:05:20,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:05:19" (2/3) ... [2018-04-11 11:05:20,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b215af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 11:05:20, skipping insertion in model container [2018-04-11 11:05:20,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 11:05:20" (3/3) ... [2018-04-11 11:05:20,144 INFO L107 eAbstractionObserver]: Analyzing ICFG length_test03_true-valid-memsafety.i [2018-04-11 11:05:20,151 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 11:05:20,159 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-04-11 11:05:20,184 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 11:05:20,185 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 11:05:20,185 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 11:05:20,185 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 11:05:20,185 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 11:05:20,185 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 11:05:20,185 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 11:05:20,185 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 11:05:20,185 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 11:05:20,186 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 11:05:20,196 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2018-04-11 11:05:20,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 11:05:20,203 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:05:20,204 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:05:20,204 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 11:05:20,206 INFO L82 PathProgramCache]: Analyzing trace with hash 785922242, now seen corresponding path program 1 times [2018-04-11 11:05:20,207 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:05:20,208 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:05:20,238 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:20,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:05:20,238 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:05:20,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:05:20,306 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 11:05:20,308 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:05:20,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 11:05:20,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 11:05:20,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 11:05:20,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 11:05:20,319 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 4 states. [2018-04-11 11:05:20,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:05:20,484 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2018-04-11 11:05:20,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 11:05:20,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 11:05:20,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:05:20,495 INFO L225 Difference]: With dead ends: 175 [2018-04-11 11:05:20,495 INFO L226 Difference]: Without dead ends: 172 [2018-04-11 11:05:20,496 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 11:05:20,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-11 11:05:20,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 134. [2018-04-11 11:05:20,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-11 11:05:20,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2018-04-11 11:05:20,539 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 140 transitions. Word has length 8 [2018-04-11 11:05:20,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:05:20,540 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 140 transitions. [2018-04-11 11:05:20,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 11:05:20,540 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2018-04-11 11:05:20,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 11:05:20,540 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:05:20,540 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:05:20,541 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 11:05:20,541 INFO L82 PathProgramCache]: Analyzing trace with hash 785922243, now seen corresponding path program 1 times [2018-04-11 11:05:20,541 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:05:20,541 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:05:20,542 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:20,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:05:20,542 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:05:20,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:05:20,594 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 11:05:20,595 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:05:20,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 11:05:20,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 11:05:20,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 11:05:20,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 11:05:20,597 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. Second operand 4 states. [2018-04-11 11:05:20,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:05:20,702 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2018-04-11 11:05:20,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 11:05:20,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 11:05:20,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:05:20,703 INFO L225 Difference]: With dead ends: 134 [2018-04-11 11:05:20,703 INFO L226 Difference]: Without dead ends: 134 [2018-04-11 11:05:20,704 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 11:05:20,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-11 11:05:20,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-04-11 11:05:20,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-04-11 11:05:20,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 138 transitions. [2018-04-11 11:05:20,712 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 138 transitions. Word has length 8 [2018-04-11 11:05:20,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:05:20,712 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 138 transitions. [2018-04-11 11:05:20,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 11:05:20,713 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 138 transitions. [2018-04-11 11:05:20,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-11 11:05:20,713 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:05:20,713 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:05:20,713 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 11:05:20,713 INFO L82 PathProgramCache]: Analyzing trace with hash 580924999, now seen corresponding path program 1 times [2018-04-11 11:05:20,714 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:05:20,714 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:05:20,715 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:20,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:05:20,715 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:05:20,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:05:20,774 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 11:05:20,775 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:05:20,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 11:05:20,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 11:05:20,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 11:05:20,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 11:05:20,776 INFO L87 Difference]: Start difference. First operand 132 states and 138 transitions. Second operand 4 states. [2018-04-11 11:05:20,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:05:20,867 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2018-04-11 11:05:20,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 11:05:20,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-11 11:05:20,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:05:20,868 INFO L225 Difference]: With dead ends: 132 [2018-04-11 11:05:20,868 INFO L226 Difference]: Without dead ends: 132 [2018-04-11 11:05:20,868 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 11:05:20,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-11 11:05:20,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-04-11 11:05:20,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-11 11:05:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2018-04-11 11:05:20,875 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 12 [2018-04-11 11:05:20,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:05:20,876 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2018-04-11 11:05:20,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 11:05:20,876 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2018-04-11 11:05:20,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-11 11:05:20,876 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:05:20,876 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:05:20,876 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 11:05:20,877 INFO L82 PathProgramCache]: Analyzing trace with hash 580924998, now seen corresponding path program 1 times [2018-04-11 11:05:20,877 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:05:20,877 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:05:20,878 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:20,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:05:20,878 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:05:20,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:05:20,905 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 11:05:20,905 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:05:20,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 11:05:20,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 11:05:20,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 11:05:20,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 11:05:20,906 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand 4 states. [2018-04-11 11:05:20,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:05:20,998 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2018-04-11 11:05:20,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 11:05:20,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-11 11:05:20,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:05:20,999 INFO L225 Difference]: With dead ends: 146 [2018-04-11 11:05:20,999 INFO L226 Difference]: Without dead ends: 146 [2018-04-11 11:05:20,999 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 11:05:20,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-04-11 11:05:21,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 133. [2018-04-11 11:05:21,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-11 11:05:21,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-04-11 11:05:21,003 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 12 [2018-04-11 11:05:21,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:05:21,004 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-04-11 11:05:21,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 11:05:21,004 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-04-11 11:05:21,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 11:05:21,004 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:05:21,004 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 11:05:21,004 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 11:05:21,004 INFO L82 PathProgramCache]: Analyzing trace with hash 606155154, now seen corresponding path program 1 times [2018-04-11 11:05:21,004 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:05:21,004 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:05:21,005 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:21,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:05:21,005 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:05:21,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:05:21,044 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 11:05:21,044 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:05:21,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 11:05:21,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 11:05:21,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 11:05:21,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 11:05:21,045 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 4 states. [2018-04-11 11:05:21,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:05:21,114 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-04-11 11:05:21,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 11:05:21,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-11 11:05:21,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:05:21,115 INFO L225 Difference]: With dead ends: 128 [2018-04-11 11:05:21,115 INFO L226 Difference]: Without dead ends: 128 [2018-04-11 11:05:21,115 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 11:05:21,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-11 11:05:21,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-04-11 11:05:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-11 11:05:21,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-04-11 11:05:21,118 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 20 [2018-04-11 11:05:21,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:05:21,118 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-04-11 11:05:21,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 11:05:21,118 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-04-11 11:05:21,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 11:05:21,119 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:05:21,119 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 11:05:21,119 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 11:05:21,119 INFO L82 PathProgramCache]: Analyzing trace with hash 606155155, now seen corresponding path program 1 times [2018-04-11 11:05:21,119 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:05:21,119 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:05:21,120 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:21,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:05:21,120 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:05:21,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:05:21,160 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 11:05:21,160 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:05:21,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 11:05:21,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 11:05:21,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 11:05:21,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 11:05:21,161 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 4 states. [2018-04-11 11:05:21,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:05:21,215 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-04-11 11:05:21,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 11:05:21,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-11 11:05:21,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:05:21,216 INFO L225 Difference]: With dead ends: 123 [2018-04-11 11:05:21,216 INFO L226 Difference]: Without dead ends: 123 [2018-04-11 11:05:21,216 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 11:05:21,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-11 11:05:21,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-04-11 11:05:21,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 11:05:21,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-04-11 11:05:21,220 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 20 [2018-04-11 11:05:21,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:05:21,220 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-04-11 11:05:21,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 11:05:21,220 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-04-11 11:05:21,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 11:05:21,221 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:05:21,221 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 11:05:21,221 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 11:05:21,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1610940695, now seen corresponding path program 1 times [2018-04-11 11:05:21,221 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:05:21,221 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:05:21,222 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:21,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:05:21,222 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:05:21,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:05:21,293 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 11:05:21,293 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:05:21,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 11:05:21,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 11:05:21,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 11:05:21,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-11 11:05:21,294 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 8 states. [2018-04-11 11:05:21,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:05:21,502 INFO L93 Difference]: Finished difference Result 230 states and 245 transitions. [2018-04-11 11:05:21,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 11:05:21,502 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-04-11 11:05:21,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:05:21,503 INFO L225 Difference]: With dead ends: 230 [2018-04-11 11:05:21,503 INFO L226 Difference]: Without dead ends: 230 [2018-04-11 11:05:21,504 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 11:05:21,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-04-11 11:05:21,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 144. [2018-04-11 11:05:21,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-11 11:05:21,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 164 transitions. [2018-04-11 11:05:21,508 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 164 transitions. Word has length 21 [2018-04-11 11:05:21,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:05:21,509 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 164 transitions. [2018-04-11 11:05:21,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 11:05:21,509 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 164 transitions. [2018-04-11 11:05:21,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 11:05:21,509 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:05:21,509 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 11:05:21,510 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 11:05:21,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1610940696, now seen corresponding path program 1 times [2018-04-11 11:05:21,510 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:05:21,510 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:05:21,510 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:21,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:05:21,511 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:05:21,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:05:21,608 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 11:05:21,608 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:05:21,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 11:05:21,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 11:05:21,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 11:05:21,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 11:05:21,609 INFO L87 Difference]: Start difference. First operand 144 states and 164 transitions. Second operand 8 states. [2018-04-11 11:05:21,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:05:21,794 INFO L93 Difference]: Finished difference Result 172 states and 194 transitions. [2018-04-11 11:05:21,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 11:05:21,794 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-04-11 11:05:21,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:05:21,795 INFO L225 Difference]: With dead ends: 172 [2018-04-11 11:05:21,795 INFO L226 Difference]: Without dead ends: 172 [2018-04-11 11:05:21,796 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-04-11 11:05:21,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-11 11:05:21,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-04-11 11:05:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-04-11 11:05:21,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 194 transitions. [2018-04-11 11:05:21,800 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 194 transitions. Word has length 21 [2018-04-11 11:05:21,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:05:21,800 INFO L459 AbstractCegarLoop]: Abstraction has 170 states and 194 transitions. [2018-04-11 11:05:21,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 11:05:21,800 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 194 transitions. [2018-04-11 11:05:21,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 11:05:21,800 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:05:21,800 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 11:05:21,801 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 11:05:21,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1221998067, now seen corresponding path program 1 times [2018-04-11 11:05:21,801 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:05:21,801 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:05:21,801 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:21,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:05:21,802 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:05:21,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:05:22,001 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 11:05:22,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:05:22,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 11:05:22,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 11:05:22,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 11:05:22,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-04-11 11:05:22,002 INFO L87 Difference]: Start difference. First operand 170 states and 194 transitions. Second operand 11 states. [2018-04-11 11:05:22,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:05:22,317 INFO L93 Difference]: Finished difference Result 172 states and 193 transitions. [2018-04-11 11:05:22,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 11:05:22,318 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-04-11 11:05:22,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:05:22,319 INFO L225 Difference]: With dead ends: 172 [2018-04-11 11:05:22,319 INFO L226 Difference]: Without dead ends: 172 [2018-04-11 11:05:22,319 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-04-11 11:05:22,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-11 11:05:22,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-04-11 11:05:22,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-04-11 11:05:22,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 193 transitions. [2018-04-11 11:05:22,323 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 193 transitions. Word has length 30 [2018-04-11 11:05:22,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:05:22,324 INFO L459 AbstractCegarLoop]: Abstraction has 170 states and 193 transitions. [2018-04-11 11:05:22,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 11:05:22,324 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 193 transitions. [2018-04-11 11:05:22,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 11:05:22,325 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:05:22,325 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 11:05:22,325 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 11:05:22,325 INFO L82 PathProgramCache]: Analyzing trace with hash 547197936, now seen corresponding path program 1 times [2018-04-11 11:05:22,325 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:05:22,325 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:05:22,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:22,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:05:22,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:05:22,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:05:22,668 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 11:05:22,668 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:05:22,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-04-11 11:05:22,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 11:05:22,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 11:05:22,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-04-11 11:05:22,669 INFO L87 Difference]: Start difference. First operand 170 states and 193 transitions. Second operand 14 states. [2018-04-11 11:05:23,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:05:23,143 INFO L93 Difference]: Finished difference Result 196 states and 218 transitions. [2018-04-11 11:05:23,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 11:05:23,143 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-04-11 11:05:23,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:05:23,144 INFO L225 Difference]: With dead ends: 196 [2018-04-11 11:05:23,144 INFO L226 Difference]: Without dead ends: 196 [2018-04-11 11:05:23,145 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2018-04-11 11:05:23,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-04-11 11:05:23,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 161. [2018-04-11 11:05:23,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-11 11:05:23,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 181 transitions. [2018-04-11 11:05:23,149 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 181 transitions. Word has length 32 [2018-04-11 11:05:23,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:05:23,149 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 181 transitions. [2018-04-11 11:05:23,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 11:05:23,149 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 181 transitions. [2018-04-11 11:05:23,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 11:05:23,150 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:05:23,150 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:05:23,150 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 11:05:23,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1510794234, now seen corresponding path program 1 times [2018-04-11 11:05:23,151 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:05:23,151 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:05:23,151 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:23,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:05:23,152 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:05:23,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:05:23,181 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 11:05:23,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:05:23,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 11:05:23,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 11:05:23,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 11:05:23,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 11:05:23,182 INFO L87 Difference]: Start difference. First operand 161 states and 181 transitions. Second operand 3 states. [2018-04-11 11:05:23,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:05:23,192 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2018-04-11 11:05:23,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 11:05:23,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-04-11 11:05:23,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:05:23,193 INFO L225 Difference]: With dead ends: 170 [2018-04-11 11:05:23,193 INFO L226 Difference]: Without dead ends: 170 [2018-04-11 11:05:23,194 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 11:05:23,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-04-11 11:05:23,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2018-04-11 11:05:23,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-04-11 11:05:23,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 173 transitions. [2018-04-11 11:05:23,198 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 173 transitions. Word has length 38 [2018-04-11 11:05:23,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:05:23,198 INFO L459 AbstractCegarLoop]: Abstraction has 157 states and 173 transitions. [2018-04-11 11:05:23,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 11:05:23,198 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 173 transitions. [2018-04-11 11:05:23,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 11:05:23,199 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:05:23,199 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:05:23,199 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 11:05:23,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1650874349, now seen corresponding path program 1 times [2018-04-11 11:05:23,200 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:05:23,200 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:05:23,201 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:23,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:05:23,201 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:05:23,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:05:23,465 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:05:23,465 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:05:23,465 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 11:05:23,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:05:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:05:23,520 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:05:23,676 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:23,676 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:23,679 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 11:05:23,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:23,686 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 11:05:23,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:23,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:23,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 11:05:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 11:05:23,757 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:05:23,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-04-11 11:05:23,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 11:05:23,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 11:05:23,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2018-04-11 11:05:23,758 INFO L87 Difference]: Start difference. First operand 157 states and 173 transitions. Second operand 24 states. [2018-04-11 11:05:24,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:05:24,340 INFO L93 Difference]: Finished difference Result 196 states and 207 transitions. [2018-04-11 11:05:24,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 11:05:24,340 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 41 [2018-04-11 11:05:24,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:05:24,341 INFO L225 Difference]: With dead ends: 196 [2018-04-11 11:05:24,341 INFO L226 Difference]: Without dead ends: 196 [2018-04-11 11:05:24,342 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=942, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 11:05:24,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-04-11 11:05:24,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 157. [2018-04-11 11:05:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-04-11 11:05:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 166 transitions. [2018-04-11 11:05:24,346 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 166 transitions. Word has length 41 [2018-04-11 11:05:24,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:05:24,347 INFO L459 AbstractCegarLoop]: Abstraction has 157 states and 166 transitions. [2018-04-11 11:05:24,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 11:05:24,347 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 166 transitions. [2018-04-11 11:05:24,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 11:05:24,348 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:05:24,348 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 11:05:24,348 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 11:05:24,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1920567715, now seen corresponding path program 1 times [2018-04-11 11:05:24,348 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:05:24,348 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:05:24,349 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:24,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:05:24,349 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:05:24,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:05:24,498 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 11:05:24,498 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:05:24,498 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 11:05:24,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:05:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:05:24,540 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:05:24,568 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base|)) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| 1)))) is different from true [2018-04-11 11:05:24,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:24,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:24,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 11:05:24,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:24,594 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 11:05:24,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-11 11:05:24,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-04-11 11:05:24,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:24,669 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 11:05:24,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:20 [2018-04-11 11:05:24,719 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 11:05:24,738 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:05:24,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-04-11 11:05:24,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 11:05:24,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 11:05:24,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=255, Unknown=1, NotChecked=32, Total=342 [2018-04-11 11:05:24,739 INFO L87 Difference]: Start difference. First operand 157 states and 166 transitions. Second operand 19 states. [2018-04-11 11:05:25,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:05:25,212 INFO L93 Difference]: Finished difference Result 193 states and 203 transitions. [2018-04-11 11:05:25,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 11:05:25,212 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2018-04-11 11:05:25,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:05:25,213 INFO L225 Difference]: With dead ends: 193 [2018-04-11 11:05:25,213 INFO L226 Difference]: Without dead ends: 193 [2018-04-11 11:05:25,213 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=623, Unknown=1, NotChecked=52, Total=812 [2018-04-11 11:05:25,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-11 11:05:25,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 158. [2018-04-11 11:05:25,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-11 11:05:25,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2018-04-11 11:05:25,218 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 43 [2018-04-11 11:05:25,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:05:25,218 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2018-04-11 11:05:25,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 11:05:25,218 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2018-04-11 11:05:25,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 11:05:25,219 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:05:25,219 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:05:25,219 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 11:05:25,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1920567716, now seen corresponding path program 1 times [2018-04-11 11:05:25,220 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:05:25,220 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:05:25,220 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:25,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:05:25,221 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:05:25,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:05:25,368 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 11:05:25,368 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:05:25,368 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 11:05:25,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:05:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:05:25,402 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:05:25,462 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| Int)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| 9))) is different from true [2018-04-11 11:05:25,476 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 11:05:25,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 11:05:25,484 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 11:05:25,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:19 [2018-04-11 11:05:25,549 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 11:05:25,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-11 11:05:25,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 11:05:25,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:47 [2018-04-11 11:05:25,593 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 11:05:25,611 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:05:25,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-04-11 11:05:25,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 11:05:25,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 11:05:25,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=367, Unknown=1, NotChecked=38, Total=462 [2018-04-11 11:05:25,612 INFO L87 Difference]: Start difference. First operand 158 states and 169 transitions. Second operand 22 states. [2018-04-11 11:05:26,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:05:26,436 INFO L93 Difference]: Finished difference Result 217 states and 229 transitions. [2018-04-11 11:05:26,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 11:05:26,437 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-04-11 11:05:26,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:05:26,437 INFO L225 Difference]: With dead ends: 217 [2018-04-11 11:05:26,437 INFO L226 Difference]: Without dead ends: 217 [2018-04-11 11:05:26,438 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 11:05:26,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-11 11:05:26,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 185. [2018-04-11 11:05:26,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-11 11:05:26,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 201 transitions. [2018-04-11 11:05:26,441 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 201 transitions. Word has length 43 [2018-04-11 11:05:26,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:05:26,441 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 201 transitions. [2018-04-11 11:05:26,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 11:05:26,442 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 201 transitions. [2018-04-11 11:05:26,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 11:05:26,443 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:05:26,443 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 11:05:26,443 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 11:05:26,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1552822926, now seen corresponding path program 1 times [2018-04-11 11:05:26,443 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:05:26,443 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:05:26,444 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:26,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:05:26,444 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:05:26,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:05:26,962 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 11:05:26,963 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:05:26,963 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 11:05:26,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:05:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:05:26,993 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:05:27,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 11:05:27,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:27,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:27,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-11 11:05:27,205 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 11:05:27,207 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 11:05:27,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:27,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:27,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:27,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-11 11:05:27,245 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 11:05:27,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, 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 11:05:27,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 11:05:27,282 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 11:05:27,282 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:27,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:05:27,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:05:27,301 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:70 [2018-04-11 11:05:27,353 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 11:05:27,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:27,355 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 11:05:27,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:27,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:27,387 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 11:05:27,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:27,413 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 48 treesize of output 54 [2018-04-11 11:05:27,414 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 11:05:27,444 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:27,445 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 51 treesize of output 66 [2018-04-11 11:05:27,445 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:27,462 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:05:27,478 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 11:05:27,478 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:102, output treesize:115 [2018-04-11 11:05:27,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:27,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:27,536 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 11:05:27,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:27,561 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 11:05:27,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:139, output treesize:60 [2018-04-11 11:05:27,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:27,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:27,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:27,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-11 11:05:27,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:27,682 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 11:05:27,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:74, output treesize:82 [2018-04-11 11:05:27,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-04-11 11:05:27,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:05:27,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:27,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:27,845 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 11:05:27,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:85 [2018-04-11 11:05:27,890 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 11:05:27,892 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 11:05:27,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:27,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:27,917 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 11:05:27,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:98, output treesize:94 [2018-04-11 11:05:27,982 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 11:05:27,986 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 11:05:27,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:27,995 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:05:27,996 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 11:05:27,996 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:28,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:28,004 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 11:05:28,005 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:28,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:28,018 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 11:05:28,018 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:103, output treesize:28 [2018-04-11 11:05:28,069 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 11:05:28,087 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:05:28,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2018-04-11 11:05:28,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-11 11:05:28,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-11 11:05:28,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1827, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 11:05:28,088 INFO L87 Difference]: Start difference. First operand 185 states and 201 transitions. Second operand 45 states. [2018-04-11 11:05:30,878 WARN L151 SmtUtils]: Spent 315ms on a formula simplification. DAG size of input: 100 DAG size of output 69 [2018-04-11 11:05:31,293 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 109 DAG size of output 72 [2018-04-11 11:05:32,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:05:32,026 INFO L93 Difference]: Finished difference Result 247 states and 269 transitions. [2018-04-11 11:05:32,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 11:05:32,026 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 50 [2018-04-11 11:05:32,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:05:32,027 INFO L225 Difference]: With dead ends: 247 [2018-04-11 11:05:32,027 INFO L226 Difference]: Without dead ends: 247 [2018-04-11 11:05:32,029 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=671, Invalid=4879, Unknown=0, NotChecked=0, Total=5550 [2018-04-11 11:05:32,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-11 11:05:32,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 185. [2018-04-11 11:05:32,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-11 11:05:32,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 200 transitions. [2018-04-11 11:05:32,034 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 200 transitions. Word has length 50 [2018-04-11 11:05:32,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:05:32,034 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 200 transitions. [2018-04-11 11:05:32,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-11 11:05:32,034 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 200 transitions. [2018-04-11 11:05:32,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 11:05:32,035 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:05:32,035 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 11:05:32,035 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 11:05:32,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1552822925, now seen corresponding path program 1 times [2018-04-11 11:05:32,035 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:05:32,035 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:05:32,036 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:32,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:05:32,036 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:05:32,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:05:32,529 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 11:05:32,529 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:05:32,529 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 11:05:32,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:05:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:05:32,569 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:05:32,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 11:05:32,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:32,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:32,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-11 11:05:32,676 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 11:05:32,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:32,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:32,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-04-11 11:05:32,735 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 11:05:32,740 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 11:05:32,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:32,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:32,747 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 11:05:32,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:05:32,749 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:32,750 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:32,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:32,755 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-11 11:05:32,801 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 11:05:32,804 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 11:05:32,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:32,823 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 11:05:32,823 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 11:05:32,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:05:32,858 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 11:05:32,861 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 11:05:32,861 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:32,881 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 11:05:32,881 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 11:05:32,892 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:05:32,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 11:05:32,910 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:60, output treesize:203 [2018-04-11 11:05:32,998 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 11:05:33,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:33,011 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 11:05:33,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 11:05:33,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:33,084 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 11:05:33,084 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:33,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:05:33,206 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 11:05:33,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:33,209 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:05:33,210 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 11:05:33,210 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:33,219 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:33,232 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 11:05:33,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:33,235 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 11:05:33,236 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:33,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:33,306 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 11:05:33,307 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-11 11:05:33,340 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:05:33,391 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 11:05:33,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:33,393 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 11:05:33,393 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:33,404 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:33,456 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 11:05:33,458 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:33,458 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 11:05:33,458 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:33,477 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:33,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 11:05:33,513 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:235, output treesize:267 [2018-04-11 11:05:33,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:33,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:33,591 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 150 treesize of output 144 [2018-04-11 11:05:33,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:33,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:33,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:291, output treesize:144 [2018-04-11 11:05:33,759 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 11:05:33,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:33,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:33,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:33,776 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 11:05:33,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:33,790 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 11:05:33,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:158, output treesize:141 [2018-04-11 11:05:33,948 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 11:05:33,951 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 11:05:33,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:34,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:34,016 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 11:05:34,017 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-11 11:05:34,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 11:05:34,119 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 11:05:34,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:34,121 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:05:34,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 11:05:34,123 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:34,136 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:34,141 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 11:05:34,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:34,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:34,145 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:05:34,148 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 11:05:34,148 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:34,161 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:34,175 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 11:05:34,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 158 [2018-04-11 11:05:34,177 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:34,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:34,244 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 11:05:34,245 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-04-11 11:05:34,305 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 11:05:34,355 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 11:05:34,355 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:170, output treesize:327 [2018-04-11 11:05:34,485 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 170 treesize of output 177 [2018-04-11 11:05:34,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:34,491 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 11:05:34,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:34,550 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 11:05:34,550 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:34,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:34,738 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 166 treesize of output 182 [2018-04-11 11:05:34,740 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 11:05:34,741 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:34,829 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:34,929 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 155 treesize of output 138 [2018-04-11 11:05:34,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:34,932 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 11:05:34,932 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:34,947 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:35,035 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 145 treesize of output 131 [2018-04-11 11:05:35,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:35,038 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 11:05:35,038 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:35,050 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:35,110 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:05:35,111 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 11:05:35,112 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 11:05:35,113 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:35,124 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:35,177 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:05:35,178 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 11:05:35,180 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 11:05:35,180 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:35,189 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:35,234 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 11:05:35,235 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 11 variables, input treesize:481, output treesize:391 [2018-04-11 11:05:35,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 134 [2018-04-11 11:05:35,384 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:35,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-04-11 11:05:35,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:35,401 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:05:35,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2018-04-11 11:05:35,401 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:35,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:35,447 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 111 treesize of output 93 [2018-04-11 11:05:35,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 11:05:35,448 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:35,461 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:05:35,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2018-04-11 11:05:35,462 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:35,473 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:35,500 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 82 treesize of output 68 [2018-04-11 11:05:35,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:35,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-04-11 11:05:35,503 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:35,518 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:05:35,518 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 11:05:35,519 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:35,525 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:35,548 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 67 treesize of output 60 [2018-04-11 11:05:35,550 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 11:05:35,550 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:35,560 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:05:35,560 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 11:05:35,560 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:35,567 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:35,584 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 11:05:35,584 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 10 variables, input treesize:265, output treesize:14 [2018-04-11 11:05:35,625 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 11:05:35,643 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:05:35,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 40 [2018-04-11 11:05:35,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-11 11:05:35,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-11 11:05:35,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1528, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 11:05:35,644 INFO L87 Difference]: Start difference. First operand 185 states and 200 transitions. Second operand 41 states. [2018-04-11 11:05:36,520 WARN L151 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 114 DAG size of output 100 [2018-04-11 11:05:37,209 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 175 DAG size of output 105 [2018-04-11 11:05:37,653 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 207 DAG size of output 73 [2018-04-11 11:05:37,880 WARN L151 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 180 DAG size of output 110 [2018-04-11 11:05:39,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:05:39,188 INFO L93 Difference]: Finished difference Result 244 states and 266 transitions. [2018-04-11 11:05:39,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 11:05:39,189 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 50 [2018-04-11 11:05:39,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:05:39,190 INFO L225 Difference]: With dead ends: 244 [2018-04-11 11:05:39,190 INFO L226 Difference]: Without dead ends: 244 [2018-04-11 11:05:39,191 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=514, Invalid=4042, Unknown=0, NotChecked=0, Total=4556 [2018-04-11 11:05:39,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-04-11 11:05:39,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 185. [2018-04-11 11:05:39,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-11 11:05:39,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 199 transitions. [2018-04-11 11:05:39,194 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 199 transitions. Word has length 50 [2018-04-11 11:05:39,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:05:39,194 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 199 transitions. [2018-04-11 11:05:39,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-11 11:05:39,194 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 199 transitions. [2018-04-11 11:05:39,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 11:05:39,195 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:05:39,195 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 11:05:39,195 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 11:05:39,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1015537919, now seen corresponding path program 1 times [2018-04-11 11:05:39,195 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:05:39,195 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:05:39,195 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:39,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:05:39,196 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:05:39,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:05:39,756 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 11:05:39,756 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:05:39,756 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 11:05:39,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:05:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:05:39,784 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:05:39,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:39,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:39,788 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 11:05:39,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:39,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:39,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-11 11:05:39,821 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 11:05:39,822 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 11:05:39,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:39,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:39,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 11:05:39,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:05:39,829 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:39,830 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:39,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:39,834 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2018-04-11 11:05:39,840 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 11:05:39,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:39,842 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 11:05:39,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:39,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:39,853 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 11:05:39,855 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:39,855 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 11:05:39,856 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:39,859 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:39,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:39,864 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-04-11 11:05:40,089 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_flength_test___true_valid_memsafety_i__append_~head.offset Int) (__U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base Int) (__U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset Int)) (let ((.cse1 (+ __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset 1)) (.cse2 (+ __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset 5)) (.cse3 (+ __U_MULTI_flength_test___true_valid_memsafety_i__append_~head.offset 4))) (and (= (select |c_old(#valid)| __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base) 0) (= |c_#memory_$Pointer$.offset| (let ((.cse0 (store |c_old(#memory_$Pointer$.offset)| |c___U_MULTI_flength_test___true_valid_memsafety_i__append_#in~head.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c___U_MULTI_flength_test___true_valid_memsafety_i__append_#in~head.base|) __U_MULTI_flength_test___true_valid_memsafety_i__append_~head.offset __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset) .cse3 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset)))) (store .cse0 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base (store (store (select .cse0 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base) .cse1 0) .cse2 0)))) (= |c_#memory_$Pointer$.base| (let ((.cse4 (store |c_old(#memory_$Pointer$.base)| |c___U_MULTI_flength_test___true_valid_memsafety_i__append_#in~head.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c___U_MULTI_flength_test___true_valid_memsafety_i__append_#in~head.base|) __U_MULTI_flength_test___true_valid_memsafety_i__append_~head.offset __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base) .cse3 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base)))) (store .cse4 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base (store (store (select .cse4 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base) .cse1 0) .cse2 0))))))) is different from true [2018-04-11 11:05:40,216 WARN L148 SmtUtils]: Spent 122ms on a formula simplification that was a NOOP. DAG size: 70 [2018-04-11 11:05:40,222 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:40,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:40,226 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 11:05:40,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:40,331 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 11:05:40,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-04-11 11:05:40,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:40,337 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 11:05:40,337 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:40,344 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:40,370 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 11:05:40,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:40,387 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 11:05:40,389 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 11:05:40,389 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:40,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:40,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:40,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 11:05:40,435 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-11 11:05:40,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:40,477 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:05:40,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 0 case distinctions, treesize of input 30 treesize of output 39 [2018-04-11 11:05:40,479 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:40,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:40,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:40,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:40,525 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 53 [2018-04-11 11:05:40,526 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:40,562 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 11:05:40,600 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 11:05:40,668 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 11:05:40,682 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 11:05:40,684 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 11:05:40,687 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:40,687 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 11:05:40,688 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:40,694 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:40,725 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 11:05:40,728 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 11:05:40,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:40,731 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 11:05:40,731 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:40,745 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:40,757 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:40,772 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:40,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 59 treesize of output 61 [2018-04-11 11:05:40,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 11:05:40,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:40,874 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 11:05:40,874 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:40,882 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:40,897 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 11:05:40,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:40,910 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 11:05:40,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:40,917 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:40,930 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 36 treesize of output 55 [2018-04-11 11:05:40,931 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-04-11 11:05:40,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:40,964 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:05:40,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2018-04-11 11:05:40,966 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:41,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:41,013 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:41,013 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:41,016 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 53 [2018-04-11 11:05:41,016 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:41,041 INFO L267 ElimStorePlain]: Start of recursive call 22: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 11:05:41,064 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 11:05:41,095 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 11:05:41,106 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 11:05:41,109 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 11:05:41,111 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:41,112 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 11:05:41,112 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:41,116 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:41,147 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 11:05:41,149 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 11:05:41,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:41,151 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 11:05:41,152 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:41,155 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:41,162 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:41,170 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:41,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 26 dim-0 vars, and 13 xjuncts. [2018-04-11 11:05:41,257 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 7 variables, input treesize:135, output treesize:1296 [2018-04-11 11:05:43,821 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 42 treesize of output 36 [2018-04-11 11:05:43,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:43,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 11:05:43,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:43,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:43,832 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 11:05:43,832 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:43,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:43,845 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 42 treesize of output 36 [2018-04-11 11:05:43,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:43,847 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 11:05:43,847 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:43,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:43,854 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 11:05:43,854 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:43,857 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:43,860 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 11:05:43,860 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:87, output treesize:7 [2018-04-11 11:05:43,933 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 11:05:43,953 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:05:43,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 35 [2018-04-11 11:05:43,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 11:05:43,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 11:05:43,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1016, Unknown=16, NotChecked=64, Total=1190 [2018-04-11 11:05:43,954 INFO L87 Difference]: Start difference. First operand 185 states and 199 transitions. Second operand 35 states. [2018-04-11 11:05:45,409 WARN L148 SmtUtils]: Spent 114ms on a formula simplification that was a NOOP. DAG size: 66 [2018-04-11 11:05:48,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:05:48,613 INFO L93 Difference]: Finished difference Result 296 states and 318 transitions. [2018-04-11 11:05:48,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 11:05:48,613 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 52 [2018-04-11 11:05:48,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:05:48,614 INFO L225 Difference]: With dead ends: 296 [2018-04-11 11:05:48,615 INFO L226 Difference]: Without dead ends: 296 [2018-04-11 11:05:48,615 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=333, Invalid=2689, Unknown=62, NotChecked=108, Total=3192 [2018-04-11 11:05:48,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-04-11 11:05:48,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 202. [2018-04-11 11:05:48,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-04-11 11:05:48,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 219 transitions. [2018-04-11 11:05:48,620 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 219 transitions. Word has length 52 [2018-04-11 11:05:48,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:05:48,620 INFO L459 AbstractCegarLoop]: Abstraction has 202 states and 219 transitions. [2018-04-11 11:05:48,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 11:05:48,621 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 219 transitions. [2018-04-11 11:05:48,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 11:05:48,621 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:05:48,621 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 11:05:48,621 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 11:05:48,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1386904548, now seen corresponding path program 1 times [2018-04-11 11:05:48,621 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:05:48,621 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:05:48,622 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:48,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:05:48,622 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:05:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:05:48,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:05:49,488 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 11:05:49,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:05:49,489 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 11:05:49,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:05:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:05:49,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:05:49,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:49,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:49,558 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 11:05:49,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:49,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:49,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-11 11:05:49,630 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 11:05:49,631 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 11:05:49,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:49,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:49,640 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 11:05:49,642 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 11:05:49,642 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:49,643 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:49,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:49,649 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-04-11 11:05:49,903 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_flength_test___true_valid_memsafety_i__append_~head.offset Int) (__U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base Int) (__U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset Int)) (let ((.cse1 (+ __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset 1)) (.cse2 (+ __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset 5)) (.cse3 (+ __U_MULTI_flength_test___true_valid_memsafety_i__append_~head.offset 4))) (and (= (select |c_old(#valid)| __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base) 0) (= |c_#memory_$Pointer$.offset| (let ((.cse0 (store |c_old(#memory_$Pointer$.offset)| |c___U_MULTI_flength_test___true_valid_memsafety_i__append_#in~head.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c___U_MULTI_flength_test___true_valid_memsafety_i__append_#in~head.base|) __U_MULTI_flength_test___true_valid_memsafety_i__append_~head.offset __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset) .cse3 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset)))) (store .cse0 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base (store (store (select .cse0 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base) .cse1 0) .cse2 0)))) (= |c_#memory_$Pointer$.base| (let ((.cse4 (store |c_old(#memory_$Pointer$.base)| |c___U_MULTI_flength_test___true_valid_memsafety_i__append_#in~head.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c___U_MULTI_flength_test___true_valid_memsafety_i__append_#in~head.base|) __U_MULTI_flength_test___true_valid_memsafety_i__append_~head.offset __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base) .cse3 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base)))) (store .cse4 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base (store (store (select .cse4 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base) .cse1 0) .cse2 0))))))) is different from true [2018-04-11 11:05:50,012 WARN L148 SmtUtils]: Spent 106ms on a formula simplification that was a NOOP. DAG size: 67 [2018-04-11 11:05:50,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:50,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:50,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, 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 11:05:50,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:50,124 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 11:05:50,126 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 11:05:50,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:50,130 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 11:05:50,130 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:50,138 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:50,160 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 11:05:50,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:50,176 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 11:05:50,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:50,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:50,197 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 36 treesize of output 55 [2018-04-11 11:05:50,198 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 11:05:50,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:50,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:50,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:50,248 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 53 [2018-04-11 11:05:50,248 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:50,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:50,295 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:05:50,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2018-04-11 11:05:50,297 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:50,363 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 11:05:50,399 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 11:05:50,461 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 11:05:50,476 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 11:05:50,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 11:05:50,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:50,488 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 11:05:50,488 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:50,495 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:50,527 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 11:05:50,529 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 11:05:50,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:50,533 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 11:05:50,533 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:50,538 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:50,549 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:50,564 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:50,683 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 11:05:50,685 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 11:05:50,688 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:50,689 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 11:05:50,689 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:50,700 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:50,715 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 11:05:50,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:50,731 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 11:05:50,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:50,735 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:05:50,737 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 45 [2018-04-11 11:05:50,737 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:50,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:50,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:50,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:50,785 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 53 [2018-04-11 11:05:50,785 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:50,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:50,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:50,823 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 11:05:50,824 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-04-11 11:05:50,848 INFO L267 ElimStorePlain]: Start of recursive call 21: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 11:05:50,879 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 11:05:50,911 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 11:05:50,922 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 11:05:50,924 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 11:05:50,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:50,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 11:05:50,928 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:50,934 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:50,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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 11:05:50,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-04-11 11:05:50,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:05:50,963 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 11:05:50,964 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-11 11:05:50,969 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:50,978 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:05:50,986 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 11:05:51,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 20 dim-0 vars, and 10 xjuncts. [2018-04-11 11:05:51,068 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 7 variables, input treesize:124, output treesize:877 [2018-04-11 11:06:11,348 WARN L151 SmtUtils]: Spent 13114ms on a formula simplification. DAG size of input: 258 DAG size of output 35 [2018-04-11 11:06:11,606 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 37 treesize of output 33 [2018-04-11 11:06:11,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:11,608 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 11:06:11,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:11,614 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:06:11,614 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 11:06:11,614 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:11,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:11,629 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 37 treesize of output 33 [2018-04-11 11:06:11,630 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:06:11,631 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 11:06:11,631 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:11,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:11,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 11:06:11,637 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:11,639 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:11,645 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 11:06:11,645 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:86, output treesize:7 [2018-04-11 11:06:11,722 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 11:06:11,740 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:06:11,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 40 [2018-04-11 11:06:11,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-11 11:06:11,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-11 11:06:11,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1356, Unknown=18, NotChecked=74, Total=1560 [2018-04-11 11:06:11,742 INFO L87 Difference]: Start difference. First operand 202 states and 219 transitions. Second operand 40 states. [2018-04-11 11:06:13,553 WARN L148 SmtUtils]: Spent 120ms on a formula simplification that was a NOOP. DAG size: 67 [2018-04-11 11:06:16,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:06:16,642 INFO L93 Difference]: Finished difference Result 278 states and 295 transitions. [2018-04-11 11:06:16,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 11:06:16,643 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 54 [2018-04-11 11:06:16,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:06:16,643 INFO L225 Difference]: With dead ends: 278 [2018-04-11 11:06:16,644 INFO L226 Difference]: Without dead ends: 278 [2018-04-11 11:06:16,644 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=391, Invalid=3454, Unknown=65, NotChecked=122, Total=4032 [2018-04-11 11:06:16,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-04-11 11:06:16,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 199. [2018-04-11 11:06:16,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-11 11:06:16,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 214 transitions. [2018-04-11 11:06:16,648 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 214 transitions. Word has length 54 [2018-04-11 11:06:16,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:06:16,649 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 214 transitions. [2018-04-11 11:06:16,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-11 11:06:16,649 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 214 transitions. [2018-04-11 11:06:16,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 11:06:16,649 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:06:16,649 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 11:06:16,650 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 11:06:16,650 INFO L82 PathProgramCache]: Analyzing trace with hash -967383679, now seen corresponding path program 1 times [2018-04-11 11:06:16,650 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:06:16,650 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:06:16,651 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:06:16,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:06:16,651 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:06:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:06:16,663 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:06:16,685 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 11:06:16,685 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:06:16,685 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 11:06:16,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:06:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:06:16,729 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:06:16,736 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 11:06:16,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:06:16,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-04-11 11:06:16,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 11:06:16,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 11:06:16,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-11 11:06:16,767 INFO L87 Difference]: Start difference. First operand 199 states and 214 transitions. Second operand 5 states. [2018-04-11 11:06:16,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:06:16,792 INFO L93 Difference]: Finished difference Result 229 states and 248 transitions. [2018-04-11 11:06:16,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 11:06:16,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-04-11 11:06:16,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:06:16,794 INFO L225 Difference]: With dead ends: 229 [2018-04-11 11:06:16,794 INFO L226 Difference]: Without dead ends: 229 [2018-04-11 11:06:16,794 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 11:06:16,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-04-11 11:06:16,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 212. [2018-04-11 11:06:16,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-04-11 11:06:16,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 233 transitions. [2018-04-11 11:06:16,798 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 233 transitions. Word has length 58 [2018-04-11 11:06:16,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:06:16,798 INFO L459 AbstractCegarLoop]: Abstraction has 212 states and 233 transitions. [2018-04-11 11:06:16,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 11:06:16,800 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 233 transitions. [2018-04-11 11:06:16,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 11:06:16,801 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:06:16,801 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 11:06:16,801 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 11:06:16,801 INFO L82 PathProgramCache]: Analyzing trace with hash 157417677, now seen corresponding path program 1 times [2018-04-11 11:06:16,801 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:06:16,802 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:06:16,802 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:06:16,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:06:16,802 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:06:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:06:16,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:06:16,837 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 11:06:16,837 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 11:06:16,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 11:06:16,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 11:06:16,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 11:06:16,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 11:06:16,838 INFO L87 Difference]: Start difference. First operand 212 states and 233 transitions. Second operand 3 states. [2018-04-11 11:06:16,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:06:16,844 INFO L93 Difference]: Finished difference Result 214 states and 235 transitions. [2018-04-11 11:06:16,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 11:06:16,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-04-11 11:06:16,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:06:16,845 INFO L225 Difference]: With dead ends: 214 [2018-04-11 11:06:16,845 INFO L226 Difference]: Without dead ends: 214 [2018-04-11 11:06:16,845 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 11:06:16,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-11 11:06:16,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2018-04-11 11:06:16,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-04-11 11:06:16,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 235 transitions. [2018-04-11 11:06:16,851 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 235 transitions. Word has length 64 [2018-04-11 11:06:16,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:06:16,851 INFO L459 AbstractCegarLoop]: Abstraction has 214 states and 235 transitions. [2018-04-11 11:06:16,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 11:06:16,851 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 235 transitions. [2018-04-11 11:06:16,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 11:06:16,852 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:06:16,852 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 11:06:16,852 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 11:06:16,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1168102352, now seen corresponding path program 1 times [2018-04-11 11:06:16,852 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:06:16,852 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:06:16,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:06:16,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:06:16,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:06:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:06:16,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:06:17,311 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 11:06:17,311 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:06:17,311 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 11:06:17,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:06:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:06:17,347 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:06:17,361 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 11:06:17,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:17,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:17,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 11:06:17,491 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 11:06:17,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 11:06:17,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:17,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:17,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:17,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-11 11:06:17,538 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 11:06:17,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:17,548 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 11:06:17,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:17,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:17,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:17,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-04-11 11:06:17,591 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 11:06:17,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:17,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:17,606 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 11:06:17,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-11 11:06:17,644 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 27 treesize of output 26 [2018-04-11 11:06:17,644 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:17,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 11:06:17,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 11:06:17,684 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:39, output treesize:108 [2018-04-11 11:06:17,739 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 11:06:17,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:17,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:17,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:17,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:17,743 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 11:06:17,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:17,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:17,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 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 64 [2018-04-11 11:06:17,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:17,800 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 11:06:17,800 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:17,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:17,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:17,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:17,834 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 87 [2018-04-11 11:06:17,835 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:06:17,866 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:06:17,897 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 11:06:17,916 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 11:06:17,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:17,953 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 11:06:17,956 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 11:06:17,956 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:17,962 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:18,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 11:06:18,001 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:144, output treesize:177 [2018-04-11 11:06:18,070 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 11:06:18,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:18,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:18,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:18,085 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 11:06:18,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:18,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:06:18,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:197, output treesize:60 [2018-04-11 11:06:18,200 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 11:06:18,218 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:06:18,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 32 [2018-04-11 11:06:18,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 11:06:18,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 11:06:18,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2018-04-11 11:06:18,219 INFO L87 Difference]: Start difference. First operand 214 states and 235 transitions. Second operand 32 states. [2018-04-11 11:06:19,181 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 105 DAG size of output 88 [2018-04-11 11:06:20,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:06:20,421 INFO L93 Difference]: Finished difference Result 249 states and 264 transitions. [2018-04-11 11:06:20,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 11:06:20,421 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2018-04-11 11:06:20,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:06:20,422 INFO L225 Difference]: With dead ends: 249 [2018-04-11 11:06:20,422 INFO L226 Difference]: Without dead ends: 230 [2018-04-11 11:06:20,423 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=512, Invalid=3648, Unknown=0, NotChecked=0, Total=4160 [2018-04-11 11:06:20,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-04-11 11:06:20,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 185. [2018-04-11 11:06:20,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-11 11:06:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 198 transitions. [2018-04-11 11:06:20,426 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 198 transitions. Word has length 66 [2018-04-11 11:06:20,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:06:20,426 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 198 transitions. [2018-04-11 11:06:20,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 11:06:20,426 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 198 transitions. [2018-04-11 11:06:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 11:06:20,426 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:06:20,426 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 11:06:20,426 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 11:06:20,427 INFO L82 PathProgramCache]: Analyzing trace with hash -2075583150, now seen corresponding path program 1 times [2018-04-11 11:06:20,427 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:06:20,427 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:06:20,427 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:06:20,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:06:20,427 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:06:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:06:20,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:06:20,616 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 11:06:20,616 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:06:20,616 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 11:06:20,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:06:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:06:20,652 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:06:20,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:20,734 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 11:06:20,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:20,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:20,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:20,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 11:06:20,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:20,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:20,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 11:06:20,806 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 11:06:20,836 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:06:20,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2018-04-11 11:06:20,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 11:06:20,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 11:06:20,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2018-04-11 11:06:20,838 INFO L87 Difference]: Start difference. First operand 185 states and 198 transitions. Second operand 23 states. [2018-04-11 11:06:21,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:06:21,324 INFO L93 Difference]: Finished difference Result 227 states and 236 transitions. [2018-04-11 11:06:21,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 11:06:21,324 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2018-04-11 11:06:21,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:06:21,325 INFO L225 Difference]: With dead ends: 227 [2018-04-11 11:06:21,325 INFO L226 Difference]: Without dead ends: 227 [2018-04-11 11:06:21,325 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2018-04-11 11:06:21,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-04-11 11:06:21,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 210. [2018-04-11 11:06:21,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-11 11:06:21,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 225 transitions. [2018-04-11 11:06:21,328 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 225 transitions. Word has length 66 [2018-04-11 11:06:21,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:06:21,328 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 225 transitions. [2018-04-11 11:06:21,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 11:06:21,328 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 225 transitions. [2018-04-11 11:06:21,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-11 11:06:21,328 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:06:21,329 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 11:06:21,329 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 11:06:21,329 INFO L82 PathProgramCache]: Analyzing trace with hash -269068196, now seen corresponding path program 1 times [2018-04-11 11:06:21,329 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:06:21,329 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:06:21,329 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:06:21,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:06:21,329 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:06:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:06:21,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:06:21,557 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 11:06:21,557 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:06:21,557 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 11:06:21,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:06:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:06:21,589 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:06:21,647 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| Int)) (and (= |c_#length| (store |c_old(#length)| |__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| 9)) (= 0 (select |c_old(#valid)| |__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base|)))) is different from true [2018-04-11 11:06:21,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:21,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:21,654 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 11:06:21,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:21,660 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 11:06:21,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:21,664 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 11:06:21,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-11 11:06:21,707 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| Int)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~malloc2.base| 9))) is different from true [2018-04-11 11:06:21,730 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 11:06:21,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 11:06:21,740 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 11:06:21,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:25 [2018-04-11 11:06:21,811 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 11:06:21,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 11:06:21,822 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 11:06:21,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:25 [2018-04-11 11:06:21,895 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 11:06:21,915 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:06:21,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2018-04-11 11:06:21,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 11:06:21,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 11:06:21,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=674, Unknown=2, NotChecked=106, Total=870 [2018-04-11 11:06:21,915 INFO L87 Difference]: Start difference. First operand 210 states and 225 transitions. Second operand 30 states. [2018-04-11 11:06:22,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:06:22,835 INFO L93 Difference]: Finished difference Result 233 states and 244 transitions. [2018-04-11 11:06:22,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 11:06:22,835 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 68 [2018-04-11 11:06:22,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:06:22,836 INFO L225 Difference]: With dead ends: 233 [2018-04-11 11:06:22,836 INFO L226 Difference]: Without dead ends: 233 [2018-04-11 11:06:22,837 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=1224, Unknown=2, NotChecked=146, Total=1560 [2018-04-11 11:06:22,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-11 11:06:22,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 204. [2018-04-11 11:06:22,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-04-11 11:06:22,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 219 transitions. [2018-04-11 11:06:22,840 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 219 transitions. Word has length 68 [2018-04-11 11:06:22,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:06:22,840 INFO L459 AbstractCegarLoop]: Abstraction has 204 states and 219 transitions. [2018-04-11 11:06:22,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 11:06:22,840 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 219 transitions. [2018-04-11 11:06:22,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-11 11:06:22,841 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:06:22,841 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 11:06:22,841 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 11:06:22,841 INFO L82 PathProgramCache]: Analyzing trace with hash 610363464, now seen corresponding path program 1 times [2018-04-11 11:06:22,841 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:06:22,841 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:06:22,842 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:06:22,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:06:22,842 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:06:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:06:22,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:06:23,447 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 11:06:23,447 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:06:23,447 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:06:23,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:06:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:06:23,482 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:06:23,633 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 11:06:23,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:23,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:06:23,637 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:14 [2018-04-11 11:06:23,818 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 11:06:23,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:06:23,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:23,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:23,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:23,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-11 11:06:23,859 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 11:06:23,860 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 11:06:23,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:23,877 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 11:06:23,877 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 11:06:23,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:06:23,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:06:23,897 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:70 [2018-04-11 11:06:23,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-04-11 11:06:23,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:23,958 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 11:06:23,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:23,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:23,991 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 11:06:23,993 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:23,993 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 11:06:23,994 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:24,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:24,032 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 43 treesize of output 53 [2018-04-11 11:06:24,033 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 11:06:24,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:06:24,072 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 11:06:24,072 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:102, output treesize:115 [2018-04-11 11:06:24,130 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 11:06:24,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:24,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:24,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:24,144 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 11:06:24,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:24,158 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 11:06:24,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:139, output treesize:60 [2018-04-11 11:06:24,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:24,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:24,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:24,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-11 11:06:24,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:24,290 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 11:06:24,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:74, output treesize:82 [2018-04-11 11:06:24,456 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 11:06:24,457 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 11:06:24,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:24,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:24,482 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 11:06:24,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:85 [2018-04-11 11:06:24,545 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 11:06:24,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:06:24,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:24,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:24,584 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 11:06:24,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:98, output treesize:94 [2018-04-11 11:06:24,696 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 11:06:24,698 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:24,699 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 11:06:24,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:24,707 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:06:24,707 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 11:06:24,708 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:24,713 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 11:06:24,713 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:24,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:24,725 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 11:06:24,725 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:103, output treesize:28 [2018-04-11 11:06:24,778 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-11 11:06:24,796 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:06:24,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 47 [2018-04-11 11:06:24,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-11 11:06:24,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-11 11:06:24,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2091, Unknown=12, NotChecked=0, Total=2256 [2018-04-11 11:06:24,797 INFO L87 Difference]: Start difference. First operand 204 states and 219 transitions. Second operand 48 states. [2018-04-11 11:06:27,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:06:27,277 INFO L93 Difference]: Finished difference Result 301 states and 316 transitions. [2018-04-11 11:06:27,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 11:06:27,277 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 72 [2018-04-11 11:06:27,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:06:27,278 INFO L225 Difference]: With dead ends: 301 [2018-04-11 11:06:27,278 INFO L226 Difference]: Without dead ends: 301 [2018-04-11 11:06:27,279 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=773, Invalid=5695, Unknown=12, NotChecked=0, Total=6480 [2018-04-11 11:06:27,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-04-11 11:06:27,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 204. [2018-04-11 11:06:27,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-04-11 11:06:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 218 transitions. [2018-04-11 11:06:27,282 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 218 transitions. Word has length 72 [2018-04-11 11:06:27,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:06:27,282 INFO L459 AbstractCegarLoop]: Abstraction has 204 states and 218 transitions. [2018-04-11 11:06:27,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-11 11:06:27,282 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 218 transitions. [2018-04-11 11:06:27,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-11 11:06:27,283 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:06:27,283 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 11:06:27,283 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 11:06:27,283 INFO L82 PathProgramCache]: Analyzing trace with hash 610363465, now seen corresponding path program 1 times [2018-04-11 11:06:27,283 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:06:27,283 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:06:27,283 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:06:27,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:06:27,284 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:06:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:06:27,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:06:27,821 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 11:06:27,821 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:06:27,821 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:06:27,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:06:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:06:27,855 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:06:27,981 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 11:06:27,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:27,984 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 11:06:27,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:14 [2018-04-11 11:06:28,026 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 11:06:28,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:28,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:28,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-04-11 11:06:28,106 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 11:06:28,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 11:06:28,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:28,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:28,116 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 11:06:28,118 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 11:06:28,118 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:28,119 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:28,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:28,125 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-11 11:06:28,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 53 [2018-04-11 11:06:28,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-04-11 11:06:28,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:28,198 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 33 treesize of output 48 [2018-04-11 11:06:28,199 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 11:06:28,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:06:28,242 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 47 treesize of output 57 [2018-04-11 11:06:28,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 48 [2018-04-11 11:06:28,251 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 11:06:28,280 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 44 treesize of output 43 [2018-04-11 11:06:28,281 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:28,299 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:06:28,301 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:06:28,303 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-04-11 11:06:28,304 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:06:28,305 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 38 treesize of output 29 [2018-04-11 11:06:28,306 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:28,311 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:28,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:06:28,338 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:60, output treesize:103 [2018-04-11 11:06:28,413 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 11:06:28,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:28,416 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 11:06:28,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:28,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:28,504 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 162 treesize of output 162 [2018-04-11 11:06:28,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:28,507 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 11:06:28,508 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:28,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:28,595 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 142 treesize of output 160 [2018-04-11 11:06:28,596 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 11:06:28,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:06:28,762 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 152 treesize of output 143 [2018-04-11 11:06:28,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:28,787 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 130 treesize of output 142 [2018-04-11 11:06:28,787 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 11:06:28,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:28,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 162 [2018-04-11 11:06:28,854 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:28,890 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 11:06:28,893 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 86 [2018-04-11 11:06:28,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:28,897 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 76 treesize of output 56 [2018-04-11 11:06:28,898 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:28,909 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:28,957 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 11:06:28,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:28,959 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 11:06:28,959 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:28,971 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:29,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 11:06:29,012 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:235, output treesize:267 [2018-04-11 11:06:29,112 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 11:06:29,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:29,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:29,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:29,156 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 11:06:29,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:29,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:29,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:291, output treesize:144 [2018-04-11 11:06:29,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:29,337 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:29,337 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 11:06:29,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:29,356 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 26 [2018-04-11 11:06:29,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:29,373 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 11:06:29,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:158, output treesize:141 [2018-04-11 11:06:29,571 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 119 treesize of output 130 [2018-04-11 11:06:29,574 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 130 treesize of output 129 [2018-04-11 11:06:29,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:29,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:29,639 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 88 treesize of output 139 [2018-04-11 11:06:29,639 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-11 11:06:29,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 11:06:29,764 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 148 treesize of output 168 [2018-04-11 11:06:29,767 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 11:06:29,767 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:29,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:29,851 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 11:06:29,852 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-04-11 11:06:29,920 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 11:06:29,927 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 122 treesize of output 119 [2018-04-11 11:06:29,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:29,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:29,931 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:06:29,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 90 [2018-04-11 11:06:29,934 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:29,947 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:29,954 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 122 treesize of output 119 [2018-04-11 11:06:29,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:29,957 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:06:29,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 76 [2018-04-11 11:06:29,960 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:29,973 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:30,042 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 11:06:30,042 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:170, output treesize:339 [2018-04-11 11:06:30,201 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 11:06:30,205 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 177 treesize of output 176 [2018-04-11 11:06:30,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:30,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:30,508 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 11:06:30,510 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 11:06:30,511 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:30,622 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:30,745 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 155 treesize of output 138 [2018-04-11 11:06:30,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:30,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 63 [2018-04-11 11:06:30,748 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:30,765 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:30,864 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:06:30,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 141 [2018-04-11 11:06:30,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 11:06:30,868 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:30,882 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:30,980 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:06:30,981 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 11:06:30,982 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 11:06:30,983 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:30,994 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:31,064 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 145 treesize of output 131 [2018-04-11 11:06:31,066 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:31,066 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 11:06:31,067 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:31,082 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:31,135 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 11:06:31,135 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 11 variables, input treesize:481, output treesize:391 [2018-04-11 11:06:31,279 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 11:06:31,280 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 11:06:31,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:31,294 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:06:31,294 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 11:06:31,294 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:31,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:31,339 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 11:06:31,340 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 11:06:31,340 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:31,350 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:06:31,350 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 11:06:31,350 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:31,357 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:31,387 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 153 treesize of output 134 [2018-04-11 11:06:31,389 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:31,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-04-11 11:06:31,389 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:31,405 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:06:31,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2018-04-11 11:06:31,406 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:31,418 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:31,442 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 78 treesize of output 64 [2018-04-11 11:06:31,444 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:31,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-04-11 11:06:31,444 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:31,454 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:06:31,455 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 11:06:31,455 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:31,462 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:31,477 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 11:06:31,478 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 10 variables, input treesize:265, output treesize:14 [2018-04-11 11:06:31,536 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-11 11:06:31,552 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:06:31,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2018-04-11 11:06:31,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-11 11:06:31,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-11 11:06:31,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=2027, Unknown=7, NotChecked=0, Total=2162 [2018-04-11 11:06:31,554 INFO L87 Difference]: Start difference. First operand 204 states and 218 transitions. Second operand 47 states. [2018-04-11 11:06:32,715 WARN L151 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 122 DAG size of output 99 [2018-04-11 11:06:33,816 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 191 DAG size of output 89 [2018-04-11 11:06:34,211 WARN L151 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 196 DAG size of output 94 [2018-04-11 11:06:34,686 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 217 DAG size of output 71 [2018-04-11 11:06:35,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 11:06:35,943 INFO L93 Difference]: Finished difference Result 298 states and 313 transitions. [2018-04-11 11:06:35,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 11:06:35,943 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2018-04-11 11:06:35,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 11:06:35,944 INFO L225 Difference]: With dead ends: 298 [2018-04-11 11:06:35,944 INFO L226 Difference]: Without dead ends: 298 [2018-04-11 11:06:35,945 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1197 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=670, Invalid=5329, Unknown=7, NotChecked=0, Total=6006 [2018-04-11 11:06:35,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-04-11 11:06:35,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 204. [2018-04-11 11:06:35,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-04-11 11:06:35,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 217 transitions. [2018-04-11 11:06:35,947 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 217 transitions. Word has length 72 [2018-04-11 11:06:35,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 11:06:35,947 INFO L459 AbstractCegarLoop]: Abstraction has 204 states and 217 transitions. [2018-04-11 11:06:35,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-11 11:06:35,948 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 217 transitions. [2018-04-11 11:06:35,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 11:06:35,948 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 11:06:35,948 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 11:06:35,948 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_flength_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr23RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr18RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr9RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr12RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr21RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr22RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr15RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr25RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr14RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr19RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr8RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr11RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr24RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr16RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr13RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr17RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr20RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr5RequiresViolation, __U_MULTI_flength_test___true_valid_memsafety_i__appendErr10RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE]=== [2018-04-11 11:06:35,948 INFO L82 PathProgramCache]: Analyzing trace with hash 2062857170, now seen corresponding path program 1 times [2018-04-11 11:06:35,949 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 11:06:35,949 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 11:06:35,949 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:06:35,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:06:35,949 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 11:06:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:06:35,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 11:06:37,123 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 75 DAG size of output 62 [2018-04-11 11:06:37,341 WARN L151 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 79 DAG size of output 66 [2018-04-11 11:06:37,720 WARN L151 SmtUtils]: Spent 292ms on a formula simplification. DAG size of input: 90 DAG size of output 79 [2018-04-11 11:06:38,276 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 76 DAG size of output 64 [2018-04-11 11:06:38,690 WARN L151 SmtUtils]: Spent 297ms on a formula simplification. DAG size of input: 94 DAG size of output 79 [2018-04-11 11:06:39,513 WARN L151 SmtUtils]: Spent 622ms on a formula simplification. DAG size of input: 101 DAG size of output 95 [2018-04-11 11:06:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 11:06:40,210 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 11:06:40,210 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 11:06:40,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 11:06:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 11:06:40,276 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 11:06:40,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:40,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:40,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 11:06:40,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:40,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:40,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-11 11:06:40,498 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 11:06:40,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 11:06:40,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:40,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:40,508 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 11:06:40,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 11:06:40,509 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:40,510 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:40,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:40,516 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2018-04-11 11:06:40,579 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 11:06:40,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:40,581 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 11:06:40,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:40,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:40,600 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 11:06:40,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:40,602 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 11:06:40,603 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:40,606 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:40,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:40,614 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-04-11 11:06:41,576 WARN L151 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 81 DAG size of output 63 [2018-04-11 11:06:41,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:41,582 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:41,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:41,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-04-11 11:06:41,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:41,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 60 [2018-04-11 11:06:41,651 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 11:06:41,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:41,659 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 11:06:41,659 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:41,666 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:41,697 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 11:06:41,701 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 11:06:41,704 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:41,704 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 11:06:41,704 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:41,710 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:41,724 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:41,734 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 11:06:41,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 66 [2018-04-11 11:06:41,785 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 11:06:41,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:41,787 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 11:06:41,788 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:41,793 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:41,812 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 57 treesize of output 87 [2018-04-11 11:06:41,814 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 21 treesize of output 24 [2018-04-11 11:06:41,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:41,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-04-11 11:06:41,817 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:41,822 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:41,834 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:41,843 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:41,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:06:41,874 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:160, output treesize:197 [2018-04-11 11:06:42,648 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~mem7.offset| Int) (|__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~mem6.offset| Int) (__U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base Int) (__U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset Int) (|__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~mem6.base| Int)) (let ((.cse7 (+ __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset 1)) (.cse8 (+ __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset 5))) (let ((.cse2 (store |c_old(#memory_$Pointer$.base)| __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base (store (store (select |c_old(#memory_$Pointer$.base)| __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base) .cse7 |__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~mem6.base|) .cse8 0))) (.cse1 (+ |c___U_MULTI_flength_test___true_valid_memsafety_i__append_#in~head.offset| 4))) (let ((.cse3 (select (select .cse2 |c___U_MULTI_flength_test___true_valid_memsafety_i__append_#in~head.base|) .cse1)) (.cse4 (+ |__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~mem7.offset| 5))) (and (= (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base)))) (store .cse0 |c___U_MULTI_flength_test___true_valid_memsafety_i__append_#in~head.base| (store (select .cse0 |c___U_MULTI_flength_test___true_valid_memsafety_i__append_#in~head.base|) .cse1 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base))) |c_#memory_$Pointer$.base|) (= (select |c_old(#valid)| __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base) 0) (= (let ((.cse5 (let ((.cse6 (store |c_old(#memory_$Pointer$.offset)| __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.base) .cse7 |__U_MULTI_flength_test___true_valid_memsafety_i__append_#t~mem6.offset|) .cse8 0)))) (store .cse6 .cse3 (store (select .cse6 .cse3) .cse4 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset))))) (store .cse5 |c___U_MULTI_flength_test___true_valid_memsafety_i__append_#in~head.base| (store (select .cse5 |c___U_MULTI_flength_test___true_valid_memsafety_i__append_#in~head.base|) .cse1 __U_MULTI_flength_test___true_valid_memsafety_i__append_~node~0.offset))) |c_#memory_$Pointer$.offset|)))))) is different from true [2018-04-11 11:06:43,409 WARN L151 SmtUtils]: Spent 753ms on a formula simplification. DAG size of input: 153 DAG size of output 98 [2018-04-11 11:06:43,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:43,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:43,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:43,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:43,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 43 [2018-04-11 11:06:43,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:43,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:43,587 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:06:43,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 378 treesize of output 343 [2018-04-11 11:06:43,853 WARN L151 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 95 DAG size of output 83 [2018-04-11 11:06:43,857 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 11:06:43,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:43,867 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 11:06:43,867 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:43,881 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:43,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:43,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:43,974 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:06:44,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 314 [2018-04-11 11:06:44,031 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:44,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 106 [2018-04-11 11:06:44,058 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-04-11 11:06:44,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:44,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:44,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:44,229 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:44,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 273 treesize of output 281 [2018-04-11 11:06:44,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:44,234 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:06:44,235 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 190 [2018-04-11 11:06:44,235 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:44,283 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:44,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:44,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:44,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:44,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:44,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 265 treesize of output 279 [2018-04-11 11:06:44,337 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:44,337 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:06:44,338 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 175 [2018-04-11 11:06:44,338 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:44,380 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:44,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:44,389 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:44,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:44,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:44,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 265 treesize of output 279 [2018-04-11 11:06:44,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:44,425 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:06:44,426 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 175 [2018-04-11 11:06:44,426 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:44,470 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:44,669 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 11:06:44,900 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 11:06:45,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 259 treesize of output 266 [2018-04-11 11:06:45,193 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 25 treesize of output 28 [2018-04-11 11:06:45,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:45,198 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 28 treesize of output 47 [2018-04-11 11:06:45,198 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:45,205 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:45,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 219 [2018-04-11 11:06:45,279 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:45,280 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:06:45,283 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 41 treesize of output 72 [2018-04-11 11:06:45,284 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:45,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 202 [2018-04-11 11:06:45,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:45,337 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:06:45,340 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 82 treesize of output 71 [2018-04-11 11:06:45,340 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:45,375 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:45,390 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:45,422 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:45,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 259 treesize of output 266 [2018-04-11 11:06:45,486 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 25 treesize of output 28 [2018-04-11 11:06:45,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:45,491 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 28 treesize of output 47 [2018-04-11 11:06:45,491 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:45,498 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:45,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 219 [2018-04-11 11:06:45,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:45,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:45,570 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:06:45,573 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 41 treesize of output 86 [2018-04-11 11:06:45,573 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:45,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 202 [2018-04-11 11:06:45,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:45,620 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:06:45,623 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 82 treesize of output 69 [2018-04-11 11:06:45,623 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:45,644 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:45,656 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:45,684 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:45,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 265 treesize of output 272 [2018-04-11 11:06:45,717 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 25 treesize of output 28 [2018-04-11 11:06:45,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:45,722 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 28 treesize of output 47 [2018-04-11 11:06:45,722 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:45,730 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:45,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 225 [2018-04-11 11:06:45,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:45,842 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 41 treesize of output 100 [2018-04-11 11:06:45,843 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 4 xjuncts. [2018-04-11 11:06:45,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 215 [2018-04-11 11:06:45,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:45,932 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:06:45,934 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 82 treesize of output 69 [2018-04-11 11:06:45,934 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:45,967 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:45,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 221 [2018-04-11 11:06:45,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:45,988 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:06:45,991 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 88 treesize of output 82 [2018-04-11 11:06:45,991 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:46,014 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:46,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 215 [2018-04-11 11:06:46,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:06:46,034 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 11:06:46,037 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 82 treesize of output 71 [2018-04-11 11:06:46,037 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-11 11:06:46,063 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:06:46,124 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 11:06:46,193 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 11:06:46,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-04-11 11:06:46,346 INFO L202 ElimStorePlain]: Needed 38 recursive calls to eliminate 11 variables, input treesize:556, output treesize:772 [2018-04-11 11:07:11,062 WARN L148 SmtUtils]: Spent 22494ms on a formula simplification that was a NOOP. DAG size: 161 [2018-04-11 11:07:31,592 WARN L148 SmtUtils]: Spent 20236ms on a formula simplification that was a NOOP. DAG size: 161 [2018-04-11 11:07:50,823 WARN L148 SmtUtils]: Spent 19050ms on a formula simplification that was a NOOP. DAG size: 161 [2018-04-11 11:07:50,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 269 treesize of output 211 [2018-04-11 11:07:50,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 59 [2018-04-11 11:07:50,843 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:07:50,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:07:50,871 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 11:07:50,871 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 11:07:50,896 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 11:07:50,897 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 11:07:50,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:07:50,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 44 [2018-04-11 11:07:50,920 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:07:50,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:07:51,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 269 treesize of output 213 [2018-04-11 11:07:51,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:07:51,057 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 11:07:51,057 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 11:07:51,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:07:51,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2018-04-11 11:07:51,088 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 11:07:51,114 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:07:51,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 111 [2018-04-11 11:07:51,116 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:07:51,141 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 11:07:51,142 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 11:07:51,160 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:07:51,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 84 [2018-04-11 11:07:51,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:07:51,257 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 11:07:51,257 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 11:07:51,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:07:51,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2018-04-11 11:07:51,273 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 11:07:51,286 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 11:07:51,286 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 11:07:51,302 INFO L267 ElimStorePlain]: Start of recursive call 12: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:07:51,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 217 [2018-04-11 11:07:51,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:07:51,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 102 [2018-04-11 11:07:51,389 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-04-11 11:07:51,435 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 11:07:51,435 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 11:07:51,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 107 [2018-04-11 11:07:51,483 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 11:07:51,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 83 [2018-04-11 11:07:51,485 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:07:51,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:07:51,527 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 11:07:51,527 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 11:07:51,562 INFO L267 ElimStorePlain]: Start of recursive call 16: 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 11:07:51,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 111 [2018-04-11 11:07:51,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:07:51,660 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2018-04-11 11:07:51,660 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:07:51,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:07:51,682 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 11:07:51,683 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 11:07:51,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:07:51,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:07:51,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:07:51,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2018-04-11 11:07:51,705 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:07:51,719 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 11:07:51,719 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-11 11:07:51,730 INFO L267 ElimStorePlain]: Start of recursive call 22: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:07:51,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 91 [2018-04-11 11:07:51,737 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 11:07:51,737 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 11:07:51,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:07:51,755 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 11:07:51,755 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-11 11:07:51,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:07:51,771 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2018-04-11 11:07:51,771 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 11:07:51,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:07:51,784 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 11:07:51,785 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-11 11:07:51,793 INFO L267 ElimStorePlain]: Start of recursive call 27: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:07:51,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 106 [2018-04-11 11:07:51,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:07:51,851 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 11:07:51,851 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-11 11:07:51,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 11:07:51,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 45 treesize of output 35 [2018-04-11 11:07:51,866 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-11 11:07:51,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2018-04-11 11:07:51,878 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-11 11:07:51,884 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 11:07:51,884 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-11 11:07:51,888 INFO L267 ElimStorePlain]: Start of recursive call 32: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:07:51,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 11:07:51,922 INFO L202 ElimStorePlain]: Needed 36 recursive calls to eliminate 19 variables, input treesize:814, output treesize:7 [2018-04-11 11:07:52,101 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-04-11 11:07:52,119 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 11:07:52,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 61 [2018-04-11 11:07:52,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-11 11:07:52,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-11 11:07:52,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=3326, Unknown=24, NotChecked=116, Total=3660 [2018-04-11 11:07:52,120 INFO L87 Difference]: Start difference. First operand 204 states and 217 transitions. Second operand 61 states. [2018-04-11 11:07:52,700 WARN L148 SmtUtils]: Spent 281ms on a formula simplification that was a NOOP. DAG size: 102 [2018-04-11 11:07:53,348 WARN L148 SmtUtils]: Spent 308ms on a formula simplification that was a NOOP. DAG size: 107 [2018-04-11 11:08:03,721 WARN L151 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 114 DAG size of output 55 [2018-04-11 11:08:04,237 WARN L151 SmtUtils]: Spent 224ms on a formula simplification. DAG size of input: 144 DAG size of output 61 [2018-04-11 11:08:04,863 WARN L151 SmtUtils]: Spent 290ms on a formula simplification. DAG size of input: 128 DAG size of output 66 [2018-04-11 11:08:05,857 WARN L151 SmtUtils]: Spent 515ms on a formula simplification. DAG size of input: 132 DAG size of output 76 [2018-04-11 11:08:11,225 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 125 DAG size of output 60 [2018-04-11 11:08:11,470 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 126 DAG size of output 61 [2018-04-11 11:08:12,108 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 78 DAG size of output 61 [2018-04-11 11:08:12,341 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 118 DAG size of output 56 [2018-04-11 11:08:12,638 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 86 DAG size of output 67 [2018-04-11 11:08:13,226 WARN L151 SmtUtils]: Spent 201ms on a formula simplification. DAG size of input: 109 DAG size of output 73 [2018-04-11 11:08:15,913 WARN L151 SmtUtils]: Spent 1684ms on a formula simplification. DAG size of input: 135 DAG size of output 129 Received shutdown request... [2018-04-11 11:08:42,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 11:08:42,651 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 11:08:42,654 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 11:08:42,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 11:08:42 BoogieIcfgContainer [2018-04-11 11:08:42,654 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 11:08:42,655 INFO L168 Benchmark]: Toolchain (without parser) took 203329.63 ms. Allocated memory was 404.8 MB in the beginning and 1.1 GB in the end (delta: 697.8 MB). Free memory was 337.7 MB in the beginning and 817.9 MB in the end (delta: -480.2 MB). Peak memory consumption was 217.6 MB. Max. memory is 5.3 GB. [2018-04-11 11:08:42,656 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 404.8 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 11:08:42,656 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.58 ms. Allocated memory is still 404.8 MB. Free memory was 335.8 MB in the beginning and 310.7 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-04-11 11:08:42,656 INFO L168 Benchmark]: Boogie Preprocessor took 46.17 ms. Allocated memory is still 404.8 MB. Free memory was 310.7 MB in the beginning and 308.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 11:08:42,656 INFO L168 Benchmark]: RCFGBuilder took 469.91 ms. Allocated memory was 404.8 MB in the beginning and 593.0 MB in the end (delta: 188.2 MB). Free memory was 306.7 MB in the beginning and 510.6 MB in the end (delta: -203.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-04-11 11:08:42,656 INFO L168 Benchmark]: TraceAbstraction took 202516.63 ms. Allocated memory was 593.0 MB in the beginning and 1.1 GB in the end (delta: 509.6 MB). Free memory was 510.6 MB in the beginning and 817.9 MB in the end (delta: -307.2 MB). Peak memory consumption was 202.4 MB. Max. memory is 5.3 GB. [2018-04-11 11:08:42,657 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.12 ms. Allocated memory is still 404.8 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 293.58 ms. Allocated memory is still 404.8 MB. Free memory was 335.8 MB in the beginning and 310.7 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 46.17 ms. Allocated memory is still 404.8 MB. Free memory was 310.7 MB in the beginning and 308.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 469.91 ms. Allocated memory was 404.8 MB in the beginning and 593.0 MB in the end (delta: 188.2 MB). Free memory was 306.7 MB in the beginning and 510.6 MB in the end (delta: -203.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 202516.63 ms. Allocated memory was 593.0 MB in the beginning and 1.1 GB in the end (delta: 509.6 MB). Free memory was 510.6 MB in the beginning and 817.9 MB in the end (delta: -307.2 MB). Peak memory consumption was 202.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 541]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 541]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 559]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 575]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 576]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 576). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 580]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 580). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 582]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 582). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 575]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 580]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 580). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 583]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 583). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 572]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 583]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 583). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 582]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 582). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 573]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 572]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 573]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 559]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 576]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 576). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (204states) and interpolant automaton (currently 32 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 193. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 145 locations, 55 error locations. TIMEOUT Result, 202.4s OverallTime, 26 OverallIterations, 3 TraceHistogramMax, 81.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2211 SDtfs, 10813 SDslu, 15987 SDs, 0 SdLazy, 20016 SolverSat, 1596 SolverUnsat, 366 SolverUnknown, 0 SolverNotchecked, 26.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1483 GetRequests, 641 SyntacticMatches, 44 SemanticMatches, 797 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 10617 ImplicationChecksByTransitivity, 131.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 892 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 119.0s InterpolantComputationTime, 1904 NumberOfCodeBlocks, 1904 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1864 ConstructedInterpolants, 256 QuantifiedInterpolants, 3139385 SizeOfPredicates, 205 NumberOfNonLiveVariables, 3981 ConjunctsInSsa, 607 ConjunctsInUnsatCore, 40 InterpolantComputations, 12 PerfectInterpolantSequences, 220/591 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_11-08-42-664.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_11-08-42-664.csv Completed graceful shutdown