java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/optional_data_creation_test04_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 16:08:26,823 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 16:08:26,824 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 16:08:26,834 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 16:08:26,834 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 16:08:26,835 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 16:08:26,835 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 16:08:26,836 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 16:08:26,838 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 16:08:26,839 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 16:08:26,839 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 16:08:26,840 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 16:08:26,840 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 16:08:26,841 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 16:08:26,842 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 16:08:26,843 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 16:08:26,845 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 16:08:26,846 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 16:08:26,847 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 16:08:26,848 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 16:08:26,850 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 16:08:26,850 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 16:08:26,850 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 16:08:26,851 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 16:08:26,852 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 16:08:26,852 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 16:08:26,853 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 16:08:26,853 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 16:08:26,854 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 16:08:26,854 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 16:08:26,854 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 16:08:26,855 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-11 16:08:26,875 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 16:08:26,876 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 16:08:26,876 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 16:08:26,877 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 16:08:26,877 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 16:08:26,877 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 16:08:26,877 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 16:08:26,877 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 16:08:26,877 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 16:08:26,878 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 16:08:26,878 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 16:08:26,878 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 16:08:26,878 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 16:08:26,878 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 16:08:26,878 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 16:08:26,878 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 16:08:26,879 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 16:08:26,879 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 16:08:26,879 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 16:08:26,879 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 16:08:26,879 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 16:08:26,879 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 16:08:26,879 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 16:08:26,880 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 16:08:26,908 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 16:08:26,919 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 16:08:26,922 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 16:08:26,924 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 16:08:26,924 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 16:08:26,925 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,282 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG04f37d273 [2018-04-11 16:08:27,416 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 16:08:27,417 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 16:08:27,417 INFO L168 CDTParser]: Scanning optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,425 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 16:08:27,426 INFO L215 ultiparseSymbolTable]: [2018-04-11 16:08:27,426 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 16:08:27,426 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeData ('freeData') in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,426 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____bswap_64 ('__bswap_64') in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,426 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,426 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____bswap_32 ('__bswap_32') in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,426 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_data ('create_data') in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,427 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append ('append') in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,427 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 16:08:27,427 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____useconds_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,427 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____u_int in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,427 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__pthread_condattr_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,427 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__dev_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,427 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____uint8_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,427 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____key_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,427 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__uint in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__loff_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__nlink_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__pthread_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__u_int8_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__quad_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____fd_mask in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____int64_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____clockid_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,428 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__clockid_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____sig_atomic_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__pthread_attr_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__wchar_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__suseconds_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____uint64_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__pthread_once_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____fsword_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____syscall_slong_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__fd_mask in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,429 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____blkcnt_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____uid_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__ssize_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__u_int16_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__pthread_cond_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__pthread_spinlock_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____ino64_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____sigset_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____ino_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,430 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__id_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____blkcnt64_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__pthread_rwlockattr_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____int16_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__u_char in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__off_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____off_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__blkcnt_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__fsfilcnt_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____ssize_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,431 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__timer_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__pthread_barrier_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____nlink_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__int32_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____socklen_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__pthread_mutexattr_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____pid_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__key_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____u_quad_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,432 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____off64_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__u_int32_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____fsblkcnt64_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____u_char in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____gid_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____quad_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____syscall_ulong_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____id_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____timer_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__u_int in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____rlim64_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____uint32_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,433 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__fsblkcnt_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,434 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____suseconds_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,434 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__pthread_rwlock_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,434 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__div_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,434 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__time_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,434 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____pthread_slist_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,434 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____int32_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,434 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____dev_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,434 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____fsblkcnt_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,434 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__mode_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,434 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__int16_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,434 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__pthread_key_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__Data in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____caddr_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__fd_set in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__lldiv_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____rlim_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__uid_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____u_short in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____intptr_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__size_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____mode_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__blksize_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__caddr_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____u_long in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__sigset_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__ldiv_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__u_short in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__ino_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__daddr_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__u_int64_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____fsid_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__gid_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__register_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__ulong in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__pthread_barrierattr_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____int8_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__u_long in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__pid_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____fsfilcnt64_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__clock_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____fsfilcnt_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__pthread_mutex_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____time_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____loff_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__fsid_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__u_quad_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__ushort in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____blksize_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____clock_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__int8_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____uint16_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____daddr_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__int64_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____qaddr_t in optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:27,452 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG04f37d273 [2018-04-11 16:08:27,455 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 16:08:27,456 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 16:08:27,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 16:08:27,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 16:08:27,461 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 16:08:27,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 04:08:27" (1/1) ... [2018-04-11 16:08:27,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ddcebd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:08:27, skipping insertion in model container [2018-04-11 16:08:27,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 04:08:27" (1/1) ... [2018-04-11 16:08:27,481 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 16:08:27,508 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 16:08:27,664 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 16:08:27,705 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 16:08:27,710 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 120 non ball SCCs. Number of states in SCCs 120. [2018-04-11 16:08:27,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:08:27 WrapperNode [2018-04-11 16:08:27,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 16:08:27,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 16:08:27,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 16:08:27,753 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 16:08:27,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:08:27" (1/1) ... [2018-04-11 16:08:27,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:08:27" (1/1) ... [2018-04-11 16:08:27,778 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:08:27" (1/1) ... [2018-04-11 16:08:27,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:08:27" (1/1) ... [2018-04-11 16:08:27,788 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:08:27" (1/1) ... [2018-04-11 16:08:27,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:08:27" (1/1) ... [2018-04-11 16:08:27,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:08:27" (1/1) ... [2018-04-11 16:08:27,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 16:08:27,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 16:08:27,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 16:08:27,799 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 16:08:27,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:08:27" (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 16:08:27,895 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 16:08:27,895 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 16:08:27,895 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____bswap_32 [2018-04-11 16:08:27,895 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____bswap_64 [2018-04-11 16:08:27,895 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_data [2018-04-11 16:08:27,895 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeData [2018-04-11 16:08:27,895 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append [2018-04-11 16:08:27,895 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 16:08:27,895 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 16:08:27,896 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 16:08:27,896 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 16:08:27,896 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 16:08:27,896 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 16:08:27,896 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 16:08:27,896 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 16:08:27,896 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 16:08:27,896 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 16:08:27,896 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 16:08:27,897 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 16:08:27,897 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 16:08:27,897 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 16:08:27,897 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 16:08:27,897 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 16:08:27,897 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 16:08:27,897 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 16:08:27,897 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____bswap_32 [2018-04-11 16:08:27,897 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i____bswap_64 [2018-04-11 16:08:27,898 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 16:08:27,898 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 16:08:27,898 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 16:08:27,898 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 16:08:27,898 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 16:08:27,898 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 16:08:27,898 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 16:08:27,898 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 16:08:27,898 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 16:08:27,898 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 16:08:27,899 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 16:08:27,899 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 16:08:27,899 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 16:08:27,899 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 16:08:27,899 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 16:08:27,899 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 16:08:27,899 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 16:08:27,899 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 16:08:27,899 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 16:08:27,900 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 16:08:27,900 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 16:08:27,900 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 16:08:27,900 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 16:08:27,900 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 16:08:27,900 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 16:08:27,900 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 16:08:27,900 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 16:08:27,900 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 16:08:27,900 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 16:08:27,901 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 16:08:27,901 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 16:08:27,901 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 16:08:27,901 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 16:08:27,901 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 16:08:27,901 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 16:08:27,901 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 16:08:27,901 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 16:08:27,901 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 16:08:27,901 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 16:08:27,902 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 16:08:27,902 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 16:08:27,902 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 16:08:27,902 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-11 16:08:27,902 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 16:08:27,902 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 16:08:27,902 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-11 16:08:27,902 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 16:08:27,902 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 16:08:27,902 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-11 16:08:27,903 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 16:08:27,903 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 16:08:27,903 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 16:08:27,903 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 16:08:27,903 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 16:08:27,903 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 16:08:27,903 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 16:08:27,903 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 16:08:27,903 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 16:08:27,904 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 16:08:27,904 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 16:08:27,904 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 16:08:27,904 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 16:08:27,904 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 16:08:27,904 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 16:08:27,904 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 16:08:27,904 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 16:08:27,904 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 16:08:27,904 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 16:08:27,905 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 16:08:27,905 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 16:08:27,905 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 16:08:27,905 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 16:08:27,905 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 16:08:27,905 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 16:08:27,905 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 16:08:27,905 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 16:08:27,905 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 16:08:27,906 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 16:08:27,906 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 16:08:27,906 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 16:08:27,906 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 16:08:27,906 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 16:08:27,906 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 16:08:27,906 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 16:08:27,906 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 16:08:27,906 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 16:08:27,906 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 16:08:27,907 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 16:08:27,907 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_data [2018-04-11 16:08:27,907 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 16:08:27,907 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 16:08:27,907 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 16:08:27,907 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 16:08:27,907 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeData [2018-04-11 16:08:27,907 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 16:08:27,907 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append [2018-04-11 16:08:27,907 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 16:08:27,908 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 16:08:27,908 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 16:08:27,908 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 16:08:27,908 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 16:08:28,353 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 16:08:28,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 04:08:28 BoogieIcfgContainer [2018-04-11 16:08:28,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 16:08:28,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 16:08:28,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 16:08:28,357 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 16:08:28,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 04:08:27" (1/3) ... [2018-04-11 16:08:28,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fda388d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 04:08:28, skipping insertion in model container [2018-04-11 16:08:28,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:08:27" (2/3) ... [2018-04-11 16:08:28,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fda388d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 04:08:28, skipping insertion in model container [2018-04-11 16:08:28,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 04:08:28" (3/3) ... [2018-04-11 16:08:28,359 INFO L107 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04_true-valid-memsafety.i [2018-04-11 16:08:28,364 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 16:08:28,370 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-04-11 16:08:28,400 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 16:08:28,400 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 16:08:28,400 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 16:08:28,400 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 16:08:28,400 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 16:08:28,400 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 16:08:28,401 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 16:08:28,401 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 16:08:28,401 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 16:08:28,401 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 16:08:28,410 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-04-11 16:08:28,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-04-11 16:08:28,416 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:28,416 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:08:28,417 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:28,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1089139594, now seen corresponding path program 1 times [2018-04-11 16:08:28,420 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:28,421 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:28,451 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:28,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:28,451 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:28,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:28,526 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 16:08:28,528 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:28,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 16:08:28,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 16:08:28,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 16:08:28,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 16:08:28,539 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2018-04-11 16:08:28,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:28,650 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2018-04-11 16:08:28,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 16:08:28,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-04-11 16:08:28,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:28,664 INFO L225 Difference]: With dead ends: 129 [2018-04-11 16:08:28,664 INFO L226 Difference]: Without dead ends: 126 [2018-04-11 16:08:28,666 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 16:08:28,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-11 16:08:28,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2018-04-11 16:08:28,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 16:08:28,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2018-04-11 16:08:28,707 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 7 [2018-04-11 16:08:28,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:28,707 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2018-04-11 16:08:28,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 16:08:28,707 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2018-04-11 16:08:28,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-04-11 16:08:28,707 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:28,707 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:08:28,708 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:28,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1089139593, now seen corresponding path program 1 times [2018-04-11 16:08:28,708 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:28,708 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:28,709 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:28,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:28,709 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:28,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:28,744 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 16:08:28,744 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:28,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 16:08:28,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 16:08:28,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 16:08:28,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 16:08:28,745 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 3 states. [2018-04-11 16:08:28,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:28,800 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-04-11 16:08:28,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 16:08:28,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-04-11 16:08:28,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:28,802 INFO L225 Difference]: With dead ends: 124 [2018-04-11 16:08:28,802 INFO L226 Difference]: Without dead ends: 124 [2018-04-11 16:08:28,802 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 16:08:28,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-11 16:08:28,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-04-11 16:08:28,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-11 16:08:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-04-11 16:08:28,810 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 7 [2018-04-11 16:08:28,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:28,811 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-04-11 16:08:28,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 16:08:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-04-11 16:08:28,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 16:08:28,811 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:28,811 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:08:28,811 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:28,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1575434585, now seen corresponding path program 1 times [2018-04-11 16:08:28,812 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:28,812 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:28,813 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:28,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:28,813 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:28,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:28,836 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:08:28,837 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:08:28,837 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:08:28,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:28,871 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:08:28,896 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 16:08:28,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:28,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:28,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 16:08:28,915 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 16:08:28,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:28,929 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 16:08:28,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-11 16:08:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:08:28,939 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:28,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 16:08:28,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 16:08:28,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 16:08:28,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 16:08:28,940 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 5 states. [2018-04-11 16:08:29,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:29,097 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2018-04-11 16:08:29,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 16:08:29,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-11 16:08:29,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:29,099 INFO L225 Difference]: With dead ends: 135 [2018-04-11 16:08:29,099 INFO L226 Difference]: Without dead ends: 135 [2018-04-11 16:08:29,099 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 16:08:29,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-11 16:08:29,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2018-04-11 16:08:29,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-11 16:08:29,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-04-11 16:08:29,107 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 14 [2018-04-11 16:08:29,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:29,107 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-04-11 16:08:29,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 16:08:29,107 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-04-11 16:08:29,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 16:08:29,108 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:29,108 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:08:29,108 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:29,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1575434586, now seen corresponding path program 1 times [2018-04-11 16:08:29,108 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:29,108 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:29,109 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:29,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:29,109 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:29,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:29,127 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:08:29,127 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:08:29,127 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:08:29,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:29,159 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:08:29,164 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 16:08:29,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:29,168 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 16:08:29,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:29,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:29,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 16:08:29,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:29,218 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:29,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 16:08:29,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:29,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:29,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:29,235 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 16:08:29,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:29,240 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 16:08:29,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-04-11 16:08:29,261 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 16:08:29,261 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:29,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 16:08:29,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 16:08:29,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 16:08:29,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 16:08:29,262 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 6 states. [2018-04-11 16:08:29,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:29,473 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-04-11 16:08:29,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 16:08:29,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-04-11 16:08:29,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:29,475 INFO L225 Difference]: With dead ends: 133 [2018-04-11 16:08:29,475 INFO L226 Difference]: Without dead ends: 133 [2018-04-11 16:08:29,475 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-11 16:08:29,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-11 16:08:29,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2018-04-11 16:08:29,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-11 16:08:29,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-04-11 16:08:29,483 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 14 [2018-04-11 16:08:29,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:29,483 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-04-11 16:08:29,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 16:08:29,483 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-04-11 16:08:29,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 16:08:29,484 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:29,484 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:08:29,484 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:29,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1593831908, now seen corresponding path program 1 times [2018-04-11 16:08:29,484 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:29,484 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:29,485 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:29,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:29,485 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:29,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:29,519 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 16:08:29,519 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:29,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 16:08:29,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 16:08:29,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 16:08:29,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 16:08:29,520 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 4 states. [2018-04-11 16:08:29,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:29,580 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2018-04-11 16:08:29,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 16:08:29,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-11 16:08:29,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:29,581 INFO L225 Difference]: With dead ends: 127 [2018-04-11 16:08:29,581 INFO L226 Difference]: Without dead ends: 127 [2018-04-11 16:08:29,581 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 16:08:29,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-11 16:08:29,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-04-11 16:08:29,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-11 16:08:29,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2018-04-11 16:08:29,587 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 15 [2018-04-11 16:08:29,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:29,587 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2018-04-11 16:08:29,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 16:08:29,587 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2018-04-11 16:08:29,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 16:08:29,588 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:29,588 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:08:29,588 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:29,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1593831909, now seen corresponding path program 1 times [2018-04-11 16:08:29,588 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:29,588 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:29,589 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:29,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:29,589 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:29,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:29,622 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 16:08:29,622 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:29,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 16:08:29,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 16:08:29,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 16:08:29,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 16:08:29,623 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand 4 states. [2018-04-11 16:08:29,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:29,679 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-04-11 16:08:29,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 16:08:29,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-11 16:08:29,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:29,680 INFO L225 Difference]: With dead ends: 126 [2018-04-11 16:08:29,680 INFO L226 Difference]: Without dead ends: 126 [2018-04-11 16:08:29,681 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 16:08:29,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-11 16:08:29,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-04-11 16:08:29,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-11 16:08:29,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-04-11 16:08:29,685 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 15 [2018-04-11 16:08:29,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:29,685 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-04-11 16:08:29,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 16:08:29,686 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-04-11 16:08:29,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 16:08:29,686 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:29,686 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] [2018-04-11 16:08:29,686 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:29,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1559978866, now seen corresponding path program 1 times [2018-04-11 16:08:29,687 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:29,687 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:29,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:29,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:29,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:29,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:29,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:08:29,722 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:29,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 16:08:29,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 16:08:29,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 16:08:29,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 16:08:29,723 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 5 states. [2018-04-11 16:08:29,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:29,836 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2018-04-11 16:08:29,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 16:08:29,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-04-11 16:08:29,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:29,837 INFO L225 Difference]: With dead ends: 143 [2018-04-11 16:08:29,838 INFO L226 Difference]: Without dead ends: 143 [2018-04-11 16:08:29,838 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 16:08:29,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-04-11 16:08:29,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 129. [2018-04-11 16:08:29,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 16:08:29,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2018-04-11 16:08:29,843 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 22 [2018-04-11 16:08:29,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:29,843 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2018-04-11 16:08:29,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 16:08:29,843 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2018-04-11 16:08:29,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 16:08:29,844 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:29,844 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] [2018-04-11 16:08:29,844 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:29,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1559978865, now seen corresponding path program 1 times [2018-04-11 16:08:29,844 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:29,844 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:29,845 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:29,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:29,845 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:29,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:29,885 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 16:08:29,885 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:29,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 16:08:29,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 16:08:29,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 16:08:29,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 16:08:29,886 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand 5 states. [2018-04-11 16:08:29,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:29,991 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-04-11 16:08:29,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 16:08:29,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-04-11 16:08:29,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:29,992 INFO L225 Difference]: With dead ends: 135 [2018-04-11 16:08:29,992 INFO L226 Difference]: Without dead ends: 135 [2018-04-11 16:08:29,992 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 16:08:29,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-11 16:08:29,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 129. [2018-04-11 16:08:29,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 16:08:29,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2018-04-11 16:08:29,996 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 22 [2018-04-11 16:08:29,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:29,997 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2018-04-11 16:08:29,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 16:08:29,997 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2018-04-11 16:08:29,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 16:08:29,997 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:29,997 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] [2018-04-11 16:08:29,997 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:29,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1115224327, now seen corresponding path program 1 times [2018-04-11 16:08:29,998 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:29,998 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:29,999 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:29,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:29,999 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:30,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:30,028 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 16:08:30,028 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:30,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 16:08:30,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 16:08:30,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 16:08:30,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 16:08:30,029 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 4 states. [2018-04-11 16:08:30,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:30,101 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-04-11 16:08:30,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 16:08:30,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-04-11 16:08:30,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:30,102 INFO L225 Difference]: With dead ends: 125 [2018-04-11 16:08:30,102 INFO L226 Difference]: Without dead ends: 125 [2018-04-11 16:08:30,102 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 16:08:30,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-11 16:08:30,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-04-11 16:08:30,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-11 16:08:30,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2018-04-11 16:08:30,105 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 23 [2018-04-11 16:08:30,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:30,105 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2018-04-11 16:08:30,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 16:08:30,105 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2018-04-11 16:08:30,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 16:08:30,106 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:30,106 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] [2018-04-11 16:08:30,106 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:30,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1115224326, now seen corresponding path program 1 times [2018-04-11 16:08:30,106 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:30,106 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:30,107 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:30,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:30,107 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:30,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:30,147 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 16:08:30,147 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:30,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 16:08:30,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 16:08:30,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 16:08:30,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 16:08:30,148 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand 4 states. [2018-04-11 16:08:30,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:30,210 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2018-04-11 16:08:30,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 16:08:30,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-04-11 16:08:30,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:30,211 INFO L225 Difference]: With dead ends: 129 [2018-04-11 16:08:30,211 INFO L226 Difference]: Without dead ends: 129 [2018-04-11 16:08:30,212 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 16:08:30,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-04-11 16:08:30,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2018-04-11 16:08:30,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-11 16:08:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-04-11 16:08:30,215 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 23 [2018-04-11 16:08:30,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:30,215 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-04-11 16:08:30,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 16:08:30,216 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-04-11 16:08:30,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 16:08:30,216 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:30,216 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] [2018-04-11 16:08:30,216 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:30,217 INFO L82 PathProgramCache]: Analyzing trace with hash -196102737, now seen corresponding path program 1 times [2018-04-11 16:08:30,217 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:30,217 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:30,218 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:30,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:30,218 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:30,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:30,247 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 16:08:30,248 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:30,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 16:08:30,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 16:08:30,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 16:08:30,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 16:08:30,248 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 4 states. [2018-04-11 16:08:30,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:30,345 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2018-04-11 16:08:30,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 16:08:30,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-04-11 16:08:30,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:30,346 INFO L225 Difference]: With dead ends: 136 [2018-04-11 16:08:30,346 INFO L226 Difference]: Without dead ends: 136 [2018-04-11 16:08:30,346 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 16:08:30,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-11 16:08:30,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2018-04-11 16:08:30,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-11 16:08:30,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-04-11 16:08:30,350 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 24 [2018-04-11 16:08:30,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:30,350 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-04-11 16:08:30,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 16:08:30,350 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-04-11 16:08:30,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 16:08:30,350 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:30,350 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] [2018-04-11 16:08:30,350 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:30,351 INFO L82 PathProgramCache]: Analyzing trace with hash -196102736, now seen corresponding path program 1 times [2018-04-11 16:08:30,351 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:30,351 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:30,351 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:30,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:30,351 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:30,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:30,418 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 16:08:30,418 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:30,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 16:08:30,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 16:08:30,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 16:08:30,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 16:08:30,419 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 7 states. [2018-04-11 16:08:30,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:30,560 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-04-11 16:08:30,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 16:08:30,560 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-04-11 16:08:30,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:30,560 INFO L225 Difference]: With dead ends: 128 [2018-04-11 16:08:30,560 INFO L226 Difference]: Without dead ends: 128 [2018-04-11 16:08:30,561 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-04-11 16:08:30,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-11 16:08:30,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-04-11 16:08:30,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-11 16:08:30,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-04-11 16:08:30,563 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 24 [2018-04-11 16:08:30,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:30,563 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-04-11 16:08:30,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 16:08:30,563 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-04-11 16:08:30,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 16:08:30,563 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:30,563 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] [2018-04-11 16:08:30,563 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:30,563 INFO L82 PathProgramCache]: Analyzing trace with hash -212244555, now seen corresponding path program 1 times [2018-04-11 16:08:30,563 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:30,563 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:30,564 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:30,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:30,564 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:30,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:30,573 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:08:30,573 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:08:30,573 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:08:30,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:30,589 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:08:30,595 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 16:08:30,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:30,602 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 16:08:30,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:30,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:30,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 16:08:30,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:30,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:30,643 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 16:08:30,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:30,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:30,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 16:08:30,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:30,660 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 16:08:30,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-04-11 16:08:30,669 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 16:08:30,670 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:30,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 16:08:30,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 16:08:30,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 16:08:30,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 16:08:30,670 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 5 states. [2018-04-11 16:08:30,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:30,812 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-04-11 16:08:30,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 16:08:30,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-04-11 16:08:30,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:30,815 INFO L225 Difference]: With dead ends: 128 [2018-04-11 16:08:30,815 INFO L226 Difference]: Without dead ends: 128 [2018-04-11 16:08:30,815 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 16:08:30,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-11 16:08:30,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2018-04-11 16:08:30,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 16:08:30,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-04-11 16:08:30,817 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 24 [2018-04-11 16:08:30,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:30,818 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-04-11 16:08:30,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 16:08:30,818 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-04-11 16:08:30,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 16:08:30,818 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:30,818 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] [2018-04-11 16:08:30,818 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:30,819 INFO L82 PathProgramCache]: Analyzing trace with hash 748060877, now seen corresponding path program 1 times [2018-04-11 16:08:30,819 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:30,819 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:30,819 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:30,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:30,820 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:30,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:30,831 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:08:30,831 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:08:30,831 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:08:30,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:30,850 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:08:30,866 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_data_#t~malloc3.base| Int)) (= (store |c_old(#valid)| |__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_data_#t~malloc3.base| 1) |c_#valid|)) is different from true [2018-04-11 16:08:30,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, 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 16:08:30,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:30,877 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 16:08:30,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-11 16:08:30,880 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 16:08:30,880 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:30,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 16:08:30,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 16:08:30,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 16:08:30,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-04-11 16:08:30,881 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 5 states. [2018-04-11 16:08:30,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:30,948 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2018-04-11 16:08:30,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 16:08:30,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-11 16:08:30,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:30,950 INFO L225 Difference]: With dead ends: 137 [2018-04-11 16:08:30,950 INFO L226 Difference]: Without dead ends: 137 [2018-04-11 16:08:30,950 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-04-11 16:08:30,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-11 16:08:30,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 129. [2018-04-11 16:08:30,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 16:08:30,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2018-04-11 16:08:30,953 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 29 [2018-04-11 16:08:30,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:30,953 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2018-04-11 16:08:30,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 16:08:30,953 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2018-04-11 16:08:30,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 16:08:30,954 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:30,954 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] [2018-04-11 16:08:30,954 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:30,954 INFO L82 PathProgramCache]: Analyzing trace with hash 748060878, now seen corresponding path program 1 times [2018-04-11 16:08:30,954 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:30,955 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:30,955 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:30,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:30,955 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:30,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:30,966 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:08:30,966 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:08:30,967 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:08:30,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:30,981 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:08:31,013 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_data_#t~malloc3.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_data_#t~malloc3.base|) 0) (= (store |c_old(#length)| |__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_data_#t~malloc3.base| 8) |c_#length|))) is different from true [2018-04-11 16:08:31,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:31,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:31,027 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-11 16:08:31,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:31,034 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 16:08:31,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:31,039 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 16:08:31,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-11 16:08:31,050 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 16:08:31,050 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:31,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 16:08:31,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 16:08:31,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 16:08:31,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2018-04-11 16:08:31,051 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand 8 states. [2018-04-11 16:08:31,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:31,177 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-04-11 16:08:31,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 16:08:31,177 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-04-11 16:08:31,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:31,178 INFO L225 Difference]: With dead ends: 144 [2018-04-11 16:08:31,178 INFO L226 Difference]: Without dead ends: 144 [2018-04-11 16:08:31,178 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=63, Unknown=1, NotChecked=16, Total=110 [2018-04-11 16:08:31,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-04-11 16:08:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 129. [2018-04-11 16:08:31,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 16:08:31,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2018-04-11 16:08:31,180 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 29 [2018-04-11 16:08:31,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:31,181 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2018-04-11 16:08:31,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 16:08:31,181 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2018-04-11 16:08:31,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 16:08:31,181 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:31,181 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 16:08:31,181 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:31,181 INFO L82 PathProgramCache]: Analyzing trace with hash 2087682397, now seen corresponding path program 1 times [2018-04-11 16:08:31,181 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:31,182 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:31,182 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:31,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:31,182 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:31,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:31,241 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 16:08:31,242 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:31,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 16:08:31,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 16:08:31,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 16:08:31,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 16:08:31,242 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 5 states. [2018-04-11 16:08:31,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:31,360 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2018-04-11 16:08:31,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 16:08:31,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-04-11 16:08:31,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:31,362 INFO L225 Difference]: With dead ends: 127 [2018-04-11 16:08:31,362 INFO L226 Difference]: Without dead ends: 127 [2018-04-11 16:08:31,362 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 16:08:31,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-11 16:08:31,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-04-11 16:08:31,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-11 16:08:31,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2018-04-11 16:08:31,365 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 30 [2018-04-11 16:08:31,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:31,365 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2018-04-11 16:08:31,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 16:08:31,365 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2018-04-11 16:08:31,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 16:08:31,366 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:31,366 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 16:08:31,366 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:31,366 INFO L82 PathProgramCache]: Analyzing trace with hash 2087682398, now seen corresponding path program 1 times [2018-04-11 16:08:31,366 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:31,366 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:31,367 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:31,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:31,367 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:31,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:31,442 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 16:08:31,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:31,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 16:08:31,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 16:08:31,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 16:08:31,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 16:08:31,443 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 6 states. [2018-04-11 16:08:31,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:31,588 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2018-04-11 16:08:31,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 16:08:31,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-04-11 16:08:31,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:31,590 INFO L225 Difference]: With dead ends: 132 [2018-04-11 16:08:31,590 INFO L226 Difference]: Without dead ends: 132 [2018-04-11 16:08:31,590 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-11 16:08:31,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-11 16:08:31,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2018-04-11 16:08:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-11 16:08:31,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2018-04-11 16:08:31,594 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 30 [2018-04-11 16:08:31,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:31,594 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2018-04-11 16:08:31,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 16:08:31,594 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2018-04-11 16:08:31,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 16:08:31,594 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:31,595 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 16:08:31,595 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:31,595 INFO L82 PathProgramCache]: Analyzing trace with hash 72869690, now seen corresponding path program 1 times [2018-04-11 16:08:31,595 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:31,595 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:31,596 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:31,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:31,596 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:31,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:08:31,628 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:31,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 16:08:31,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 16:08:31,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 16:08:31,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 16:08:31,629 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand 5 states. [2018-04-11 16:08:31,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:31,731 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-04-11 16:08:31,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 16:08:31,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-04-11 16:08:31,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:31,736 INFO L225 Difference]: With dead ends: 124 [2018-04-11 16:08:31,736 INFO L226 Difference]: Without dead ends: 124 [2018-04-11 16:08:31,736 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 16:08:31,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-11 16:08:31,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-04-11 16:08:31,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-11 16:08:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-04-11 16:08:31,740 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 30 [2018-04-11 16:08:31,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:31,741 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-04-11 16:08:31,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 16:08:31,741 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-04-11 16:08:31,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 16:08:31,741 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:31,742 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 16:08:31,742 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:31,742 INFO L82 PathProgramCache]: Analyzing trace with hash 72869691, now seen corresponding path program 1 times [2018-04-11 16:08:31,742 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:31,742 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:31,744 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:31,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:31,744 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:31,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:31,809 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 16:08:31,809 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:31,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 16:08:31,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 16:08:31,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 16:08:31,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 16:08:31,810 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 6 states. [2018-04-11 16:08:31,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:31,905 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-04-11 16:08:31,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 16:08:31,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-04-11 16:08:31,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:31,906 INFO L225 Difference]: With dead ends: 131 [2018-04-11 16:08:31,906 INFO L226 Difference]: Without dead ends: 131 [2018-04-11 16:08:31,906 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-04-11 16:08:31,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-04-11 16:08:31,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2018-04-11 16:08:31,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 16:08:31,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2018-04-11 16:08:31,908 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 30 [2018-04-11 16:08:31,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:31,909 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2018-04-11 16:08:31,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 16:08:31,909 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2018-04-11 16:08:31,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 16:08:31,909 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:31,909 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] [2018-04-11 16:08:31,909 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:31,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1626965550, now seen corresponding path program 1 times [2018-04-11 16:08:31,909 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:31,909 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:31,910 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:31,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:31,910 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:31,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:31,917 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:08:31,917 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:08:31,917 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:08:31,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:31,938 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:08:31,952 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_data_#t~malloc3.base| Int)) (= (store |c_old(#valid)| |__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_data_#t~malloc3.base| 1) |c_#valid|)) is different from true [2018-04-11 16:08:31,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, 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 16:08:31,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:31,963 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 16:08:31,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-11 16:08:31,967 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 16:08:31,967 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:31,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 16:08:31,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 16:08:31,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 16:08:31,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-04-11 16:08:31,968 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 5 states. [2018-04-11 16:08:32,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:32,025 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-04-11 16:08:32,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 16:08:32,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-04-11 16:08:32,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:32,026 INFO L225 Difference]: With dead ends: 139 [2018-04-11 16:08:32,026 INFO L226 Difference]: Without dead ends: 139 [2018-04-11 16:08:32,027 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-04-11 16:08:32,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-04-11 16:08:32,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2018-04-11 16:08:32,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-11 16:08:32,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2018-04-11 16:08:32,029 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 31 [2018-04-11 16:08:32,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:32,029 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2018-04-11 16:08:32,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 16:08:32,029 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2018-04-11 16:08:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 16:08:32,029 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:32,029 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] [2018-04-11 16:08:32,029 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:32,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1626965551, now seen corresponding path program 1 times [2018-04-11 16:08:32,030 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:32,030 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:32,030 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:32,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:32,030 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:32,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:32,042 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:08:32,042 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:08:32,042 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:08:32,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:32,058 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:08:32,075 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_data_#t~malloc3.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_data_#t~malloc3.base|) 0) (= (store |c_old(#length)| |__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_data_#t~malloc3.base| 8) |c_#length|))) is different from true [2018-04-11 16:08:32,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:32,086 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 16:08:32,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:32,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:32,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:32,098 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-11 16:08:32,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:32,104 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 16:08:32,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-11 16:08:32,124 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 16:08:32,125 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:32,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 16:08:32,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 16:08:32,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 16:08:32,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2018-04-11 16:08:32,126 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand 6 states. [2018-04-11 16:08:32,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:32,288 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2018-04-11 16:08:32,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 16:08:32,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-11 16:08:32,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:32,290 INFO L225 Difference]: With dead ends: 140 [2018-04-11 16:08:32,290 INFO L226 Difference]: Without dead ends: 140 [2018-04-11 16:08:32,290 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2018-04-11 16:08:32,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-04-11 16:08:32,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 126. [2018-04-11 16:08:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-11 16:08:32,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-04-11 16:08:32,293 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 31 [2018-04-11 16:08:32,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:32,294 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-04-11 16:08:32,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 16:08:32,294 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-04-11 16:08:32,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 16:08:32,294 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:32,294 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] [2018-04-11 16:08:32,294 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:32,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1275051825, now seen corresponding path program 1 times [2018-04-11 16:08:32,295 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:32,295 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:32,296 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:32,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:32,296 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:32,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:32,357 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 16:08:32,357 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:32,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 16:08:32,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 16:08:32,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 16:08:32,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 16:08:32,358 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 7 states. [2018-04-11 16:08:32,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:32,505 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2018-04-11 16:08:32,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 16:08:32,506 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-04-11 16:08:32,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:32,506 INFO L225 Difference]: With dead ends: 141 [2018-04-11 16:08:32,506 INFO L226 Difference]: Without dead ends: 141 [2018-04-11 16:08:32,506 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-11 16:08:32,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-11 16:08:32,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 131. [2018-04-11 16:08:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-11 16:08:32,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2018-04-11 16:08:32,509 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 33 [2018-04-11 16:08:32,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:32,509 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2018-04-11 16:08:32,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 16:08:32,509 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2018-04-11 16:08:32,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 16:08:32,509 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:32,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:08:32,510 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:32,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1275051824, now seen corresponding path program 1 times [2018-04-11 16:08:32,510 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:32,510 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:32,510 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:32,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:32,510 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:32,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:32,572 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 16:08:32,572 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:32,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 16:08:32,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 16:08:32,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 16:08:32,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 16:08:32,572 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand 9 states. [2018-04-11 16:08:32,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:32,869 INFO L93 Difference]: Finished difference Result 178 states and 195 transitions. [2018-04-11 16:08:32,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 16:08:32,869 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-04-11 16:08:32,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:32,870 INFO L225 Difference]: With dead ends: 178 [2018-04-11 16:08:32,870 INFO L226 Difference]: Without dead ends: 178 [2018-04-11 16:08:32,870 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-04-11 16:08:32,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-11 16:08:32,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 149. [2018-04-11 16:08:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-11 16:08:32,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 164 transitions. [2018-04-11 16:08:32,874 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 164 transitions. Word has length 33 [2018-04-11 16:08:32,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:32,874 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 164 transitions. [2018-04-11 16:08:32,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 16:08:32,875 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 164 transitions. [2018-04-11 16:08:32,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 16:08:32,875 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:32,875 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:08:32,875 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:32,876 INFO L82 PathProgramCache]: Analyzing trace with hash 573717311, now seen corresponding path program 1 times [2018-04-11 16:08:32,876 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:32,876 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:32,877 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:32,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:32,877 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:32,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:32,889 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:08:32,889 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:08:32,889 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:08:32,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:32,914 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:08:32,936 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 16:08:32,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:32,942 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 16:08:32,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:32,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:32,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 16:08:32,958 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_#t~malloc12.base| Int)) (and (= (select |c_old(#valid)| |__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_#t~malloc12.base|) 0) (= (store |c_old(#length)| |__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_#t~malloc12.base| 8) |c_#length|))) is different from true [2018-04-11 16:08:32,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:32,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:32,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 16:08:32,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:32,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:32,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:32,988 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 16:08:32,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:32,994 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 16:08:32,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-04-11 16:08:33,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:33,038 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:33,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:08:33,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 16:08:33,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 16:08:33,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:38 [2018-04-11 16:08:33,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-11 16:08:33,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:08:33,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 16:08:33,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 16:08:33,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 16:08:33,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=56, Unknown=1, NotChecked=14, Total=90 [2018-04-11 16:08:33,097 INFO L87 Difference]: Start difference. First operand 149 states and 164 transitions. Second operand 10 states. [2018-04-11 16:08:33,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:33,521 INFO L93 Difference]: Finished difference Result 207 states and 230 transitions. [2018-04-11 16:08:33,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 16:08:33,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-04-11 16:08:33,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:33,523 INFO L225 Difference]: With dead ends: 207 [2018-04-11 16:08:33,523 INFO L226 Difference]: Without dead ends: 207 [2018-04-11 16:08:33,523 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=120, Unknown=1, NotChecked=22, Total=182 [2018-04-11 16:08:33,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-04-11 16:08:33,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 190. [2018-04-11 16:08:33,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-04-11 16:08:33,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 221 transitions. [2018-04-11 16:08:33,528 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 221 transitions. Word has length 34 [2018-04-11 16:08:33,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:33,528 INFO L459 AbstractCegarLoop]: Abstraction has 190 states and 221 transitions. [2018-04-11 16:08:33,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 16:08:33,529 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 221 transitions. [2018-04-11 16:08:33,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 16:08:33,529 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:33,529 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] [2018-04-11 16:08:33,529 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:33,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1260047476, now seen corresponding path program 1 times [2018-04-11 16:08:33,530 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:33,530 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:33,530 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:33,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:33,530 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:33,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:33,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 16:08:33,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:33,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 16:08:33,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 16:08:33,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 16:08:33,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 16:08:33,594 INFO L87 Difference]: Start difference. First operand 190 states and 221 transitions. Second operand 8 states. [2018-04-11 16:08:33,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:33,728 INFO L93 Difference]: Finished difference Result 222 states and 259 transitions. [2018-04-11 16:08:33,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 16:08:33,729 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-04-11 16:08:33,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:33,730 INFO L225 Difference]: With dead ends: 222 [2018-04-11 16:08:33,730 INFO L226 Difference]: Without dead ends: 222 [2018-04-11 16:08:33,730 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-04-11 16:08:33,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-04-11 16:08:33,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 190. [2018-04-11 16:08:33,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-04-11 16:08:33,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 218 transitions. [2018-04-11 16:08:33,735 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 218 transitions. Word has length 35 [2018-04-11 16:08:33,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:33,735 INFO L459 AbstractCegarLoop]: Abstraction has 190 states and 218 transitions. [2018-04-11 16:08:33,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 16:08:33,735 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 218 transitions. [2018-04-11 16:08:33,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 16:08:33,736 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:33,736 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] [2018-04-11 16:08:33,736 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:33,736 INFO L82 PathProgramCache]: Analyzing trace with hash -378073276, now seen corresponding path program 1 times [2018-04-11 16:08:33,736 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:33,736 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:33,737 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:33,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:33,737 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:33,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:33,764 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 16:08:33,764 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:33,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 16:08:33,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 16:08:33,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 16:08:33,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 16:08:33,765 INFO L87 Difference]: Start difference. First operand 190 states and 218 transitions. Second operand 5 states. [2018-04-11 16:08:33,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:33,857 INFO L93 Difference]: Finished difference Result 189 states and 216 transitions. [2018-04-11 16:08:33,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 16:08:33,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-04-11 16:08:33,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:33,858 INFO L225 Difference]: With dead ends: 189 [2018-04-11 16:08:33,858 INFO L226 Difference]: Without dead ends: 189 [2018-04-11 16:08:33,859 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 16:08:33,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-04-11 16:08:33,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-04-11 16:08:33,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-11 16:08:33,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 216 transitions. [2018-04-11 16:08:33,863 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 216 transitions. Word has length 36 [2018-04-11 16:08:33,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:33,863 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 216 transitions. [2018-04-11 16:08:33,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 16:08:33,864 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 216 transitions. [2018-04-11 16:08:33,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 16:08:33,864 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:33,864 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] [2018-04-11 16:08:33,864 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:33,864 INFO L82 PathProgramCache]: Analyzing trace with hash -378073275, now seen corresponding path program 1 times [2018-04-11 16:08:33,864 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:33,865 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:33,865 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:33,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:33,865 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:33,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:33,990 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 16:08:33,990 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:33,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 16:08:33,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 16:08:33,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 16:08:33,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-11 16:08:33,991 INFO L87 Difference]: Start difference. First operand 189 states and 216 transitions. Second operand 10 states. [2018-04-11 16:08:34,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:34,323 INFO L93 Difference]: Finished difference Result 226 states and 262 transitions. [2018-04-11 16:08:34,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 16:08:34,324 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-04-11 16:08:34,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:34,325 INFO L225 Difference]: With dead ends: 226 [2018-04-11 16:08:34,325 INFO L226 Difference]: Without dead ends: 226 [2018-04-11 16:08:34,325 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-04-11 16:08:34,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-04-11 16:08:34,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 195. [2018-04-11 16:08:34,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-04-11 16:08:34,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 222 transitions. [2018-04-11 16:08:34,331 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 222 transitions. Word has length 36 [2018-04-11 16:08:34,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:34,331 INFO L459 AbstractCegarLoop]: Abstraction has 195 states and 222 transitions. [2018-04-11 16:08:34,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 16:08:34,331 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 222 transitions. [2018-04-11 16:08:34,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 16:08:34,332 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:34,332 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] [2018-04-11 16:08:34,332 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:34,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1381840613, now seen corresponding path program 1 times [2018-04-11 16:08:34,332 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:34,332 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:34,333 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:34,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:34,333 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:34,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:34,464 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 16:08:34,464 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:08:34,464 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:08:34,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:34,487 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:08:34,495 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 16:08:34,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:08:34,521 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 16:08:34,523 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 16:08:34,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,535 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 16:08:34,537 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 16:08:34,537 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,538 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,545 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:21 [2018-04-11 16:08:34,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-11 16:08:34,635 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 17 treesize of output 5 [2018-04-11 16:08:34,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-04-11 16:08:34,646 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 26 treesize of output 11 [2018-04-11 16:08:34,646 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:34,653 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:19 [2018-04-11 16:08:34,670 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 16:08:34,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:08:34,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-04-11 16:08:34,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 16:08:34,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 16:08:34,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-04-11 16:08:34,672 INFO L87 Difference]: Start difference. First operand 195 states and 222 transitions. Second operand 16 states. [2018-04-11 16:08:35,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:35,092 INFO L93 Difference]: Finished difference Result 205 states and 232 transitions. [2018-04-11 16:08:35,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 16:08:35,093 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-04-11 16:08:35,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:35,094 INFO L225 Difference]: With dead ends: 205 [2018-04-11 16:08:35,094 INFO L226 Difference]: Without dead ends: 205 [2018-04-11 16:08:35,094 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2018-04-11 16:08:35,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-04-11 16:08:35,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-04-11 16:08:35,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-11 16:08:35,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 232 transitions. [2018-04-11 16:08:35,098 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 232 transitions. Word has length 37 [2018-04-11 16:08:35,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:35,098 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 232 transitions. [2018-04-11 16:08:35,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 16:08:35,099 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 232 transitions. [2018-04-11 16:08:35,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 16:08:35,100 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:35,100 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:08:35,100 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:35,100 INFO L82 PathProgramCache]: Analyzing trace with hash 760893153, now seen corresponding path program 1 times [2018-04-11 16:08:35,100 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:35,100 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:35,101 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:35,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:35,101 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:35,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:35,113 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:08:35,113 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:08:35,113 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:08:35,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:35,143 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:08:35,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:08:35,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:08:35,160 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 16:08:35,161 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 16:08:35,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-11 16:08:35,260 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 16:08:35,262 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 16:08:35,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,276 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 16:08:35,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:08:35,278 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,280 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,288 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-04-11 16:08:35,356 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 19 treesize of output 31 [2018-04-11 16:08:35,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 16:08:35,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,389 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 17 treesize of output 22 [2018-04-11 16:08:35,390 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 16:08:35,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:08:35,441 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 19 treesize of output 31 [2018-04-11 16:08:35,446 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:35,447 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 17 treesize of output 21 [2018-04-11 16:08:35,447 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:08:35,461 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,466 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 16:08:35,484 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:54, output treesize:97 [2018-04-11 16:08:35,551 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 16:08:35,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:35,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:35,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2018-04-11 16:08:35,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-11 16:08:35,591 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 5 treesize of output 1 [2018-04-11 16:08:35,592 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,593 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:08:35,605 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:127, output treesize:62 [2018-04-11 16:08:35,688 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:35,689 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:35,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 61 [2018-04-11 16:08:35,696 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:35,696 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 42 treesize of output 26 [2018-04-11 16:08:35,697 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 16:08:35,710 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:35,710 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 16:08:35,711 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:08:35,740 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 33 treesize of output 27 [2018-04-11 16:08:35,743 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:35,744 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 13 treesize of output 9 [2018-04-11 16:08:35,744 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,753 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:35,754 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 16:08:35,754 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,758 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:35,769 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 16:08:35,770 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:94, output treesize:7 [2018-04-11 16:08:35,832 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 16:08:35,832 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:35,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-04-11 16:08:35,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 16:08:35,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 16:08:35,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=265, Unknown=1, NotChecked=0, Total=306 [2018-04-11 16:08:35,833 INFO L87 Difference]: Start difference. First operand 205 states and 232 transitions. Second operand 18 states. [2018-04-11 16:08:36,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:08:36,754 INFO L93 Difference]: Finished difference Result 246 states and 276 transitions. [2018-04-11 16:08:36,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 16:08:36,775 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-04-11 16:08:36,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:08:36,776 INFO L225 Difference]: With dead ends: 246 [2018-04-11 16:08:36,776 INFO L226 Difference]: Without dead ends: 246 [2018-04-11 16:08:36,777 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=801, Unknown=4, NotChecked=0, Total=930 [2018-04-11 16:08:36,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-04-11 16:08:36,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 210. [2018-04-11 16:08:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-11 16:08:36,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 237 transitions. [2018-04-11 16:08:36,782 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 237 transitions. Word has length 40 [2018-04-11 16:08:36,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:08:36,782 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 237 transitions. [2018-04-11 16:08:36,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 16:08:36,783 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 237 transitions. [2018-04-11 16:08:36,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 16:08:36,783 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:08:36,783 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:08:36,783 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:08:36,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1372557105, now seen corresponding path program 1 times [2018-04-11 16:08:36,784 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:08:36,784 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:08:36,784 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:36,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:36,785 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:08:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:36,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:08:36,822 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:08:36,823 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:08:36,823 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:08:36,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:08:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:08:36,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:08:36,877 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 16:08:36,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:36,882 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 16:08:36,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:36,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:36,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 16:08:36,896 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 16:08:36,898 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 16:08:36,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:36,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:36,910 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 16:08:36,911 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 16:08:36,912 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:36,913 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:36,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:36,920 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-04-11 16:08:37,676 WARN L148 SmtUtils]: Spent 195ms on a formula simplification that was a NOOP. DAG size: 85 [2018-04-11 16:08:37,685 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:37,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:37,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:37,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:37,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-04-11 16:08:37,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:37,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:37,892 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 38 [2018-04-11 16:08:37,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 52 [2018-04-11 16:08:37,938 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 16:08:38,052 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:08:38,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:38,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-04-11 16:08:38,064 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 34 [2018-04-11 16:08:38,065 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,115 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:38,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 87 [2018-04-11 16:08:38,313 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 16:08:38,313 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:38,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:38,381 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 75 [2018-04-11 16:08:38,386 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 64 treesize of output 63 [2018-04-11 16:08:38,387 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,567 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:38,569 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 53 treesize of output 52 [2018-04-11 16:08:38,570 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:38,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:38,775 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 65 [2018-04-11 16:08:38,779 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:38,782 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 50 treesize of output 66 [2018-04-11 16:08:38,782 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:38,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 68 [2018-04-11 16:08:38,884 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:38,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:38,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 69 [2018-04-11 16:08:38,990 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-04-11 16:08:39,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:39,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:39,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 104 [2018-04-11 16:08:39,177 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 16:08:39,190 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:39,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 73 [2018-04-11 16:08:39,205 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 4 xjuncts. [2018-04-11 16:08:40,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:40,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 54 treesize of output 81 [2018-04-11 16:08:40,473 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 8 xjuncts. [2018-04-11 16:08:40,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2018-04-11 16:08:40,827 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:41,075 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:41,077 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 60 treesize of output 60 [2018-04-11 16:08:41,077 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:41,280 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 5 case distinctions, treesize of input 58 treesize of output 71 [2018-04-11 16:08:41,281 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 4 xjuncts. [2018-04-11 16:08:41,614 INFO L267 ElimStorePlain]: Start of recursive call 16: 8 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-04-11 16:08:41,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:41,923 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:41,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 97 [2018-04-11 16:08:41,977 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 16:08:41,991 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 16:08:41,991 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:42,736 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:42,738 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 51 [2018-04-11 16:08:42,738 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:42,979 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:42,993 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 39 treesize of output 61 [2018-04-11 16:08:42,993 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 4 xjuncts. [2018-04-11 16:08:43,299 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 5 case distinctions, treesize of input 49 treesize of output 76 [2018-04-11 16:08:43,300 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 8 xjuncts. [2018-04-11 16:08:43,588 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 50 treesize of output 49 [2018-04-11 16:08:43,588 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:43,995 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 47 treesize of output 60 [2018-04-11 16:08:43,995 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 4 xjuncts. [2018-04-11 16:08:44,171 INFO L267 ElimStorePlain]: Start of recursive call 22: 8 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-04-11 16:08:44,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:44,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:44,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 95 [2018-04-11 16:08:44,218 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 16:08:44,227 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 16:08:44,227 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:44,665 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 2 case distinctions, treesize of input 49 treesize of output 56 [2018-04-11 16:08:44,666 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-04-11 16:08:45,189 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:45,221 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 39 treesize of output 61 [2018-04-11 16:08:45,222 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 4 xjuncts. [2018-04-11 16:08:45,524 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 44 treesize of output 43 [2018-04-11 16:08:45,524 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:45,752 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 47 treesize of output 58 [2018-04-11 16:08:45,752 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 4 xjuncts. [2018-04-11 16:08:45,939 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:45,941 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 45 treesize of output 45 [2018-04-11 16:08:45,941 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:46,151 INFO L267 ElimStorePlain]: Start of recursive call 29: 8 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-04-11 16:08:46,582 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, 3 dim-2 vars, End of recursive call: and 12 xjuncts. [2018-04-11 16:08:47,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:47,117 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 0 case distinctions, treesize of input 47 treesize of output 41 [2018-04-11 16:08:47,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:47,129 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 16:08:47,129 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:47,159 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:47,183 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 64 [2018-04-11 16:08:47,203 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 44 treesize of output 43 [2018-04-11 16:08:47,203 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:47,301 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:47,303 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 33 treesize of output 33 [2018-04-11 16:08:47,303 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:47,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:47,371 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 31 treesize of output 50 [2018-04-11 16:08:47,371 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 4 xjuncts. [2018-04-11 16:08:47,465 INFO L267 ElimStorePlain]: Start of recursive call 38: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 16:08:47,517 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 16:08:47,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:47,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:47,944 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2018-04-11 16:08:47,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2018-04-11 16:08:47,951 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:48,047 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:48,050 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 42 treesize of output 58 [2018-04-11 16:08:48,050 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:48,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:48,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:48,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 46 treesize of output 94 [2018-04-11 16:08:48,208 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 16:08:48,216 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 16:08:48,216 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:48,630 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2018-04-11 16:08:48,631 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:48,834 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:48,836 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 44 treesize of output 44 [2018-04-11 16:08:48,837 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:49,007 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 2 case distinctions, treesize of input 44 treesize of output 51 [2018-04-11 16:08:49,008 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 2 xjuncts. [2018-04-11 16:08:49,162 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 4 case distinctions, treesize of input 42 treesize of output 53 [2018-04-11 16:08:49,163 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 4 xjuncts. [2018-04-11 16:08:49,496 INFO L267 ElimStorePlain]: Start of recursive call 45: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-11 16:08:49,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:49,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:49,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 45 treesize of output 91 [2018-04-11 16:08:49,722 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 16:08:49,751 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:49,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 73 [2018-04-11 16:08:49,767 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 4 xjuncts. [2018-04-11 16:08:50,453 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 42 treesize of output 41 [2018-04-11 16:08:50,454 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:50,642 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:50,644 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 43 treesize of output 43 [2018-04-11 16:08:50,657 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:50,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:50,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 83 [2018-04-11 16:08:50,815 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 4 xjuncts. [2018-04-11 16:08:51,142 INFO L267 ElimStorePlain]: Start of recursive call 51: 6 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-04-11 16:08:51,404 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-04-11 16:08:51,581 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-04-11 16:08:51,690 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-04-11 16:08:51,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:51,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 87 [2018-04-11 16:08:51,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:08:51,871 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:51,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:51,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:51,913 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 75 [2018-04-11 16:08:51,920 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 64 treesize of output 63 [2018-04-11 16:08:51,920 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:51,993 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:51,994 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 53 treesize of output 52 [2018-04-11 16:08:51,995 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:52,053 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:52,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:52,101 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 65 [2018-04-11 16:08:52,105 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:52,107 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 50 treesize of output 66 [2018-04-11 16:08:52,107 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:52,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:52,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 69 [2018-04-11 16:08:52,165 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 2 xjuncts. [2018-04-11 16:08:52,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:52,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:52,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 57 treesize of output 101 [2018-04-11 16:08:52,266 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 16:08:52,311 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 67 treesize of output 80 [2018-04-11 16:08:52,312 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 4 xjuncts. [2018-04-11 16:08:52,559 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 54 treesize of output 53 [2018-04-11 16:08:52,559 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:52,718 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 0 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 74 [2018-04-11 16:08:52,719 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 4 xjuncts. [2018-04-11 16:08:52,961 INFO L267 ElimStorePlain]: Start of recursive call 64: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 16:08:52,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:52,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:53,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 51 treesize of output 99 [2018-04-11 16:08:53,005 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 16:08:53,020 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 16:08:53,021 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:53,319 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 47 treesize of output 58 [2018-04-11 16:08:53,319 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 4 xjuncts. [2018-04-11 16:08:53,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-04-11 16:08:53,530 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:53,625 INFO L267 ElimStorePlain]: Start of recursive call 68: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 16:08:53,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:53,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:53,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 45 treesize of output 91 [2018-04-11 16:08:53,779 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 16:08:53,789 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:53,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 67 [2018-04-11 16:08:53,801 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 2 xjuncts. [2018-04-11 16:08:54,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-04-11 16:08:54,019 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:54,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:54,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 71 [2018-04-11 16:08:54,097 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 2 xjuncts. [2018-04-11 16:08:54,286 INFO L267 ElimStorePlain]: Start of recursive call 72: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 16:08:54,454 INFO L267 ElimStorePlain]: Start of recursive call 61: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-04-11 16:08:54,582 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:54,583 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:54,597 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2018-04-11 16:08:54,603 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 53 treesize of output 54 [2018-04-11 16:08:54,603 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:54,659 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:54,661 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 42 treesize of output 58 [2018-04-11 16:08:54,662 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:54,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:54,716 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 6 case distinctions, treesize of input 47 treesize of output 74 [2018-04-11 16:08:54,721 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:54,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 [2018-04-11 16:08:54,722 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:54,795 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 16:08:54,795 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:54,822 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:54,829 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 2 case distinctions, treesize of input 41 treesize of output 50 [2018-04-11 16:08:54,829 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 2 xjuncts. [2018-04-11 16:08:54,874 INFO L267 ElimStorePlain]: Start of recursive call 79: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:08:54,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:54,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:54,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 45 treesize of output 91 [2018-04-11 16:08:54,956 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 16:08:55,342 WARN L151 SmtUtils]: Spent 378ms on a formula simplification. DAG size of input: 168 DAG size of output 90 [2018-04-11 16:08:55,345 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 50 treesize of output 49 [2018-04-11 16:08:55,345 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:55,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:55,451 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 1 case distinctions, treesize of input 47 treesize of output 50 [2018-04-11 16:08:55,452 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:55,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:55,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 71 [2018-04-11 16:08:55,534 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 2 xjuncts. [2018-04-11 16:08:55,602 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:55,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 52 [2018-04-11 16:08:55,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:55,617 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 2 case distinctions, treesize of input 28 treesize of output 37 [2018-04-11 16:08:55,618 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 2 xjuncts. [2018-04-11 16:08:55,645 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:08:55,719 INFO L267 ElimStorePlain]: Start of recursive call 83: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-11 16:08:55,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:55,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:55,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 42 treesize of output 90 [2018-04-11 16:08:55,827 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 16:08:55,836 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:55,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 67 [2018-04-11 16:08:55,848 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 2 xjuncts. [2018-04-11 16:08:56,275 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 39 treesize of output 38 [2018-04-11 16:08:56,275 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:56,345 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 42 treesize of output 53 [2018-04-11 16:08:56,345 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 4 xjuncts. [2018-04-11 16:08:56,437 INFO L267 ElimStorePlain]: Start of recursive call 89: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 16:08:56,474 INFO L267 ElimStorePlain]: Start of recursive call 76: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 16:08:56,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:56,538 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 0 case distinctions, treesize of input 47 treesize of output 41 [2018-04-11 16:08:56,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:56,543 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 16:08:56,543 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:56,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:56,573 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 64 [2018-04-11 16:08:56,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:56,585 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 2 case distinctions, treesize of input 39 treesize of output 52 [2018-04-11 16:08:56,585 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 2 xjuncts. [2018-04-11 16:08:56,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-04-11 16:08:56,707 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:56,725 INFO L267 ElimStorePlain]: Start of recursive call 95: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:08:56,742 INFO L267 ElimStorePlain]: Start of recursive call 93: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:08:56,784 INFO L267 ElimStorePlain]: Start of recursive call 58: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-11 16:08:56,824 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-11 16:08:56,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 71 dim-0 vars, and 23 xjuncts. [2018-04-11 16:08:56,986 INFO L202 ElimStorePlain]: Needed 97 recursive calls to eliminate 14 variables, input treesize:335, output treesize:1935 [2018-04-11 16:08:57,922 WARN L151 SmtUtils]: Spent 748ms on a formula simplification. DAG size of input: 641 DAG size of output 140 [2018-04-11 16:08:58,269 WARN L148 SmtUtils]: Spent 261ms on a formula simplification that was a NOOP. DAG size: 144 [2018-04-11 16:08:58,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:58,418 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 16:08:58,421 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:58,421 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 25 treesize of output 17 [2018-04-11 16:08:58,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:58,431 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 16:08:58,431 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:58,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:58,449 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:08:58,450 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 24 treesize of output 22 [2018-04-11 16:08:58,452 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:08:58,453 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 11 treesize of output 7 [2018-04-11 16:08:58,453 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:58,467 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 16:08:58,468 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 16:08:58,469 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:08:58,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 16:08:58,484 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:95, output treesize:39 [2018-04-11 16:08:58,546 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 16:08:58,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:08:58,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-04-11 16:08:58,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 16:08:58,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 16:08:58,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=280, Unknown=23, NotChecked=0, Total=342 [2018-04-11 16:08:58,547 INFO L87 Difference]: Start difference. First operand 210 states and 237 transitions. Second operand 19 states. [2018-04-11 16:09:04,146 WARN L151 SmtUtils]: Spent 470ms on a formula simplification. DAG size of input: 149 DAG size of output 149 [2018-04-11 16:09:21,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:09:21,929 INFO L93 Difference]: Finished difference Result 265 states and 303 transitions. [2018-04-11 16:09:21,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 16:09:21,929 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2018-04-11 16:09:21,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:09:21,930 INFO L225 Difference]: With dead ends: 265 [2018-04-11 16:09:21,930 INFO L226 Difference]: Without dead ends: 265 [2018-04-11 16:09:21,931 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=78, Invalid=532, Unknown=40, NotChecked=0, Total=650 [2018-04-11 16:09:21,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-04-11 16:09:21,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 243. [2018-04-11 16:09:21,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-11 16:09:21,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 286 transitions. [2018-04-11 16:09:21,937 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 286 transitions. Word has length 40 [2018-04-11 16:09:21,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:09:21,937 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 286 transitions. [2018-04-11 16:09:21,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 16:09:21,937 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 286 transitions. [2018-04-11 16:09:21,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 16:09:21,937 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:09:21,938 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:09:21,938 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:09:21,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1045215486, now seen corresponding path program 1 times [2018-04-11 16:09:21,938 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:09:21,938 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:09:21,939 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:09:21,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:09:21,939 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:09:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:09:21,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:09:21,950 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:09:21,950 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:09:21,951 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:09:21,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:09:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:09:21,995 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:09:21,998 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 16:09:21,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:22,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:22,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:09:22,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:22,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:22,079 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 16:09:22,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:22,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:22,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-04-11 16:09:22,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:22,119 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 16:09:22,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:22,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:22,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:22,128 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 16:09:22,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:22,132 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 16:09:22,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-04-11 16:09:22,149 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:09:22,150 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:09:22,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-11 16:09:22,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 16:09:22,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 16:09:22,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=107, Unknown=2, NotChecked=0, Total=132 [2018-04-11 16:09:22,151 INFO L87 Difference]: Start difference. First operand 243 states and 286 transitions. Second operand 12 states. [2018-04-11 16:09:22,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:09:22,495 INFO L93 Difference]: Finished difference Result 267 states and 314 transitions. [2018-04-11 16:09:22,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 16:09:22,495 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-04-11 16:09:22,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:09:22,497 INFO L225 Difference]: With dead ends: 267 [2018-04-11 16:09:22,497 INFO L226 Difference]: Without dead ends: 267 [2018-04-11 16:09:22,498 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=240, Unknown=6, NotChecked=0, Total=306 [2018-04-11 16:09:22,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-04-11 16:09:22,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 233. [2018-04-11 16:09:22,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-11 16:09:22,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 274 transitions. [2018-04-11 16:09:22,504 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 274 transitions. Word has length 41 [2018-04-11 16:09:22,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:09:22,505 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 274 transitions. [2018-04-11 16:09:22,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 16:09:22,505 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 274 transitions. [2018-04-11 16:09:22,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 16:09:22,505 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:09:22,506 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:09:22,506 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:09:22,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1203361471, now seen corresponding path program 1 times [2018-04-11 16:09:22,506 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:09:22,506 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:09:22,507 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:09:22,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:09:22,507 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:09:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:09:22,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:09:22,575 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 16:09:22,576 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:09:22,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 16:09:22,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 16:09:22,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 16:09:22,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 16:09:22,576 INFO L87 Difference]: Start difference. First operand 233 states and 274 transitions. Second operand 8 states. [2018-04-11 16:09:22,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:09:22,689 INFO L93 Difference]: Finished difference Result 258 states and 301 transitions. [2018-04-11 16:09:22,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 16:09:22,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-04-11 16:09:22,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:09:22,691 INFO L225 Difference]: With dead ends: 258 [2018-04-11 16:09:22,691 INFO L226 Difference]: Without dead ends: 258 [2018-04-11 16:09:22,691 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-04-11 16:09:22,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-04-11 16:09:22,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 245. [2018-04-11 16:09:22,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-04-11 16:09:22,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 289 transitions. [2018-04-11 16:09:22,697 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 289 transitions. Word has length 44 [2018-04-11 16:09:22,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:09:22,697 INFO L459 AbstractCegarLoop]: Abstraction has 245 states and 289 transitions. [2018-04-11 16:09:22,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 16:09:22,697 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 289 transitions. [2018-04-11 16:09:22,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 16:09:22,697 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:09:22,698 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:09:22,698 INFO L408 AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:09:22,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1760106820, now seen corresponding path program 1 times [2018-04-11 16:09:22,698 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:09:22,698 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:09:22,699 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:09:22,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:09:22,699 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:09:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:09:22,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:09:22,809 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 16:09:22,809 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:09:22,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 16:09:22,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 16:09:22,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 16:09:22,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-11 16:09:22,810 INFO L87 Difference]: Start difference. First operand 245 states and 289 transitions. Second operand 10 states. [2018-04-11 16:09:23,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:09:23,012 INFO L93 Difference]: Finished difference Result 257 states and 299 transitions. [2018-04-11 16:09:23,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 16:09:23,012 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-04-11 16:09:23,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:09:23,013 INFO L225 Difference]: With dead ends: 257 [2018-04-11 16:09:23,013 INFO L226 Difference]: Without dead ends: 257 [2018-04-11 16:09:23,014 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-04-11 16:09:23,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-04-11 16:09:23,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 242. [2018-04-11 16:09:23,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-04-11 16:09:23,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 284 transitions. [2018-04-11 16:09:23,018 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 284 transitions. Word has length 43 [2018-04-11 16:09:23,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:09:23,019 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 284 transitions. [2018-04-11 16:09:23,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 16:09:23,019 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 284 transitions. [2018-04-11 16:09:23,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 16:09:23,019 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:09:23,019 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:09:23,019 INFO L408 AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:09:23,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1350499908, now seen corresponding path program 1 times [2018-04-11 16:09:23,020 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:09:23,020 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:09:23,020 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:09:23,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:09:23,020 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:09:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:09:23,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:09:23,050 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 16:09:23,050 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:09:23,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 16:09:23,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 16:09:23,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 16:09:23,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 16:09:23,051 INFO L87 Difference]: Start difference. First operand 242 states and 284 transitions. Second operand 6 states. [2018-04-11 16:09:23,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:09:23,175 INFO L93 Difference]: Finished difference Result 261 states and 304 transitions. [2018-04-11 16:09:23,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 16:09:23,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-04-11 16:09:23,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:09:23,176 INFO L225 Difference]: With dead ends: 261 [2018-04-11 16:09:23,177 INFO L226 Difference]: Without dead ends: 261 [2018-04-11 16:09:23,177 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-11 16:09:23,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-04-11 16:09:23,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 251. [2018-04-11 16:09:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-04-11 16:09:23,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 296 transitions. [2018-04-11 16:09:23,182 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 296 transitions. Word has length 45 [2018-04-11 16:09:23,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:09:23,182 INFO L459 AbstractCegarLoop]: Abstraction has 251 states and 296 transitions. [2018-04-11 16:09:23,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 16:09:23,182 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 296 transitions. [2018-04-11 16:09:23,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 16:09:23,183 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:09:23,183 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:09:23,183 INFO L408 AbstractCegarLoop]: === Iteration 35 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:09:23,184 INFO L82 PathProgramCache]: Analyzing trace with hash 816398688, now seen corresponding path program 1 times [2018-04-11 16:09:23,184 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:09:23,184 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:09:23,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:09:23,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:09:23,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:09:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:09:23,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:09:23,197 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:09:23,197 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:09:23,197 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:09:23,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:09:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:09:23,230 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:09:23,236 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 16:09:23,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:23,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:09:23,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:23,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:23,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 16:09:23,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:23,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:23,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:23,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2018-04-11 16:09:23,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:23,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:23,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:54 [2018-04-11 16:09:23,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 16:09:23,427 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:09:23,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:23,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:23,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:23,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:73 [2018-04-11 16:09:23,490 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 50 treesize of output 56 [2018-04-11 16:09:23,492 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 51 treesize of output 50 [2018-04-11 16:09:23,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:23,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 40 [2018-04-11 16:09:23,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:09:23,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:09:23,572 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 16:09:23,573 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 16:09:23,573 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:23,575 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:23,601 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 2 xjuncts. [2018-04-11 16:09:23,602 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:92, output treesize:176 [2018-04-11 16:09:23,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:23,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:23,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2018-04-11 16:09:23,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:23,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:23,710 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 54 [2018-04-11 16:09:23,712 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 46 treesize of output 89 [2018-04-11 16:09:23,712 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:23,719 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:23,733 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 16:09:23,733 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:202, output treesize:103 [2018-04-11 16:09:23,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:23,804 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:09:23,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:23,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:23,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 66 [2018-04-11 16:09:23,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:23,819 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 16:09:23,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:118, output treesize:91 [2018-04-11 16:09:23,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 63 [2018-04-11 16:09:23,850 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:09:23,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, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 54 [2018-04-11 16:09:23,851 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 16:09:23,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:09:23,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 16:09:23,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:102, output treesize:78 [2018-04-11 16:09:23,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:23,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:23,898 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:09:23,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:23,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 62 [2018-04-11 16:09:23,901 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:09:23,905 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 33 [2018-04-11 16:09:23,906 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 16:09:23,918 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:09:23,918 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 34 treesize of output 26 [2018-04-11 16:09:23,919 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:23,920 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:09:23,924 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 2 case distinctions, treesize of input 40 treesize of output 38 [2018-04-11 16:09:23,925 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 16:09:23,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 16:09:23,959 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 2 xjuncts. [2018-04-11 16:09:23,959 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:85, output treesize:57 [2018-04-11 16:09:24,046 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 16:09:24,047 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:09:24,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-04-11 16:09:24,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 16:09:24,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 16:09:24,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2018-04-11 16:09:24,047 INFO L87 Difference]: Start difference. First operand 251 states and 296 transitions. Second operand 22 states. [2018-04-11 16:09:25,347 WARN L151 SmtUtils]: Spent 476ms on a formula simplification. DAG size of input: 34 DAG size of output 28 [2018-04-11 16:09:25,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:09:25,776 INFO L93 Difference]: Finished difference Result 305 states and 361 transitions. [2018-04-11 16:09:25,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 16:09:25,777 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2018-04-11 16:09:25,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:09:25,777 INFO L225 Difference]: With dead ends: 305 [2018-04-11 16:09:25,777 INFO L226 Difference]: Without dead ends: 305 [2018-04-11 16:09:25,778 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=112, Invalid=1010, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 16:09:25,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-04-11 16:09:25,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 275. [2018-04-11 16:09:25,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-04-11 16:09:25,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 332 transitions. [2018-04-11 16:09:25,783 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 332 transitions. Word has length 47 [2018-04-11 16:09:25,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:09:25,783 INFO L459 AbstractCegarLoop]: Abstraction has 275 states and 332 transitions. [2018-04-11 16:09:25,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 16:09:25,783 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 332 transitions. [2018-04-11 16:09:25,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 16:09:25,784 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:09:25,784 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:09:25,784 INFO L408 AbstractCegarLoop]: === Iteration 36 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:09:25,784 INFO L82 PathProgramCache]: Analyzing trace with hash 816398689, now seen corresponding path program 1 times [2018-04-11 16:09:25,784 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:09:25,784 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:09:25,785 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:09:25,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:09:25,785 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:09:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:09:25,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:09:25,800 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:09:25,800 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:09:25,800 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:09:25,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:09:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:09:25,844 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:09:25,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:09:25,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:25,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:09:25,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:25,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:25,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 16:09:25,871 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 16:09:25,873 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 16:09:25,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:25,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:25,886 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 16:09:25,888 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 16:09:25,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:25,889 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:25,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:25,897 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:28 [2018-04-11 16:09:26,202 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~pointerToList.base Int) (__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~pointerToList.offset Int) (__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~node~0.base Int) (|__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_#t~mem13.offset| Int) (|__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_#t~ret14.base| Int) (|__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_#t~mem13.base| Int)) (let ((.cse0 (store |c_old(#length)| __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~node~0.base 8))) (and (= (store .cse0 |__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_#t~ret14.base| 8) |c_#length|) (= (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_old(#memory_$Pointer$.offset)| __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~node~0.base (store (select |c_old(#memory_$Pointer$.offset)| __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~node~0.base) 4 |__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_#t~mem13.offset|)))) (store .cse3 |__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_#t~ret14.base| (store (select .cse3 |__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_#t~ret14.base|) 4 0))))) (store .cse2 __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~node~0.base (store (select .cse2 __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~node~0.base) 0 0))))) (store .cse1 __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~pointerToList.base (store (select .cse1 __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~pointerToList.base) __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~pointerToList.offset 0))) |c_#memory_$Pointer$.offset|) (<= 0 __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~pointerToList.offset) (<= (+ __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~pointerToList.offset 4) (select .cse0 __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~pointerToList.base)) (<= (select (store |c_old(#valid)| __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~node~0.base 1) |__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_#t~ret14.base|) 0) (= (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_old(#memory_$Pointer$.base)| __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~node~0.base (store (select |c_old(#memory_$Pointer$.base)| __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~node~0.base) 4 |__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_#t~mem13.base|)))) (store .cse6 |__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_#t~ret14.base| (store (select .cse6 |__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_#t~ret14.base|) 4 0))))) (store .cse5 __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~node~0.base (store (select .cse5 __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~node~0.base) 0 |__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_#t~ret14.base|))))) (store .cse4 __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~pointerToList.base (store (select .cse4 __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~pointerToList.base) __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~pointerToList.offset __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~node~0.base))) |c_#memory_$Pointer$.base|) (<= (select |c_old(#valid)| __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~node~0.base) 0)))) is different from true [2018-04-11 16:09:26,345 WARN L148 SmtUtils]: Spent 138ms on a formula simplification that was a NOOP. DAG size: 76 [2018-04-11 16:09:26,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:26,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:26,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:26,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:26,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 27 [2018-04-11 16:09:26,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:26,473 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:26,475 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 38 [2018-04-11 16:09:26,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 52 [2018-04-11 16:09:26,503 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 16:09:26,589 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:09:26,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:26,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-04-11 16:09:26,596 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 34 [2018-04-11 16:09:26,597 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:26,631 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:26,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:26,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 79 [2018-04-11 16:09:26,800 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 16:09:26,801 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:26,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:26,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:26,856 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 74 treesize of output 62 [2018-04-11 16:09:26,859 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 16:09:26,859 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:26,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:26,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:26,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 51 [2018-04-11 16:09:26,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-04-11 16:09:26,913 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:26,950 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:26,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:27,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 92 [2018-04-11 16:09:27,004 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 16:09:27,011 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:09:27,011 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 58 treesize of output 58 [2018-04-11 16:09:27,011 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:27,567 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 37 treesize of output 36 [2018-04-11 16:09:27,568 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:27,642 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 2 case distinctions, treesize of input 36 treesize of output 43 [2018-04-11 16:09:27,642 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-04-11 16:09:27,764 INFO L267 ElimStorePlain]: Start of recursive call 13: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:09:27,799 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:09:27,833 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:09:27,865 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:09:27,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:27,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 79 [2018-04-11 16:09:27,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:09:27,951 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:27,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:27,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:27,971 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 74 treesize of output 62 [2018-04-11 16:09:27,973 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 16:09:27,974 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:27,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:27,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:27,995 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 49 treesize of output 51 [2018-04-11 16:09:28,000 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 14 treesize of output 15 [2018-04-11 16:09:28,000 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:28,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:28,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:28,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 92 [2018-04-11 16:09:28,045 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 16:09:28,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 61 treesize of output 60 [2018-04-11 16:09:28,052 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:28,285 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 36 treesize of output 47 [2018-04-11 16:09:28,285 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 4 xjuncts. [2018-04-11 16:09:28,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 43 [2018-04-11 16:09:28,489 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-04-11 16:09:28,681 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:09:28,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 38 [2018-04-11 16:09:28,682 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:28,762 INFO L267 ElimStorePlain]: Start of recursive call 23: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-11 16:09:28,797 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-11 16:09:28,834 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-11 16:09:28,870 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-11 16:09:28,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 10 xjuncts. [2018-04-11 16:09:28,948 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 10 variables, input treesize:309, output treesize:926 [2018-04-11 16:09:29,829 WARN L151 SmtUtils]: Spent 795ms on a formula simplification. DAG size of input: 264 DAG size of output 148 [2018-04-11 16:09:33,731 WARN L148 SmtUtils]: Spent 3820ms on a formula simplification that was a NOOP. DAG size: 152 [2018-04-11 16:09:33,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:33,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:33,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:33,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:33,846 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:09:33,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:33,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, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 113 [2018-04-11 16:09:33,853 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:09:33,856 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 46 [2018-04-11 16:09:33,857 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:09:33,877 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:09:33,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2018-04-11 16:09:33,878 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:09:33,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:09:33,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:33,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:33,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2018-04-11 16:09:33,906 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:09:33,906 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 11 treesize of output 7 [2018-04-11 16:09:33,907 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:33,913 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:09:33,913 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 11 treesize of output 7 [2018-04-11 16:09:33,913 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:33,916 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:33,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:09:33,925 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:142, output treesize:32 [2018-04-11 16:09:34,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:09:34,057 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:09:34,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-04-11 16:09:34,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 16:09:34,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 16:09:34,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=414, Unknown=5, NotChecked=40, Total=506 [2018-04-11 16:09:34,058 INFO L87 Difference]: Start difference. First operand 275 states and 332 transitions. Second operand 23 states. [2018-04-11 16:09:35,721 WARN L151 SmtUtils]: Spent 974ms on a formula simplification. DAG size of input: 157 DAG size of output 157 [2018-04-11 16:09:36,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:09:36,716 INFO L93 Difference]: Finished difference Result 316 states and 370 transitions. [2018-04-11 16:09:36,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 16:09:36,716 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 47 [2018-04-11 16:09:36,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:09:36,717 INFO L225 Difference]: With dead ends: 316 [2018-04-11 16:09:36,717 INFO L226 Difference]: Without dead ends: 316 [2018-04-11 16:09:36,717 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=113, Invalid=1007, Unknown=6, NotChecked=64, Total=1190 [2018-04-11 16:09:36,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-04-11 16:09:36,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 293. [2018-04-11 16:09:36,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-04-11 16:09:36,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 353 transitions. [2018-04-11 16:09:36,721 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 353 transitions. Word has length 47 [2018-04-11 16:09:36,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:09:36,721 INFO L459 AbstractCegarLoop]: Abstraction has 293 states and 353 transitions. [2018-04-11 16:09:36,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 16:09:36,721 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 353 transitions. [2018-04-11 16:09:36,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 16:09:36,722 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:09:36,722 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:09:36,722 INFO L408 AbstractCegarLoop]: === Iteration 37 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:09:36,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1783942653, now seen corresponding path program 1 times [2018-04-11 16:09:36,722 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:09:36,722 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:09:36,722 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:09:36,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:09:36,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:09:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:09:36,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:09:36,729 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:09:36,729 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:09:36,730 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:09:36,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:09:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:09:36,741 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:09:36,743 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 16:09:36,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:36,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:36,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:09:36,817 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 16:09:36,818 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 16:09:36,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:36,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:36,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:09:36,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2018-04-11 16:09:36,827 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~pointerToList.offset Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c___U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_#in~pointerToList.base|) __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~pointerToList.offset))) (and (<= 0 __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~pointerToList.offset) (= |c_#valid| (store |c_old(#valid)| .cse0 1)) (<= __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~pointerToList.offset |c___U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_#in~pointerToList.offset|) (<= (select |c_old(#valid)| .cse0) 0)))) is different from true [2018-04-11 16:09:36,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:36,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:36,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 32 [2018-04-11 16:09:36,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:36,838 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 16:09:36,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2018-04-11 16:09:36,855 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 16:09:36,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:36,859 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 16:09:36,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2018-04-11 16:09:42,873 WARN L148 SmtUtils]: Spent 2004ms on a formula simplification that was a NOOP. DAG size: 16 [2018-04-11 16:09:42,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-11 16:09:42,916 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:09:42,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-11 16:09:42,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:42,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:42,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:09:42,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:15 [2018-04-11 16:09:42,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:09:42,942 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 16:09:42,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:09:42,946 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 16:09:42,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-11 16:09:42,962 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 16:09:42,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:09:42,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-11 16:09:42,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 16:09:42,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 16:09:42,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=106, Unknown=3, NotChecked=20, Total=156 [2018-04-11 16:09:42,963 INFO L87 Difference]: Start difference. First operand 293 states and 353 transitions. Second operand 13 states. [2018-04-11 16:10:03,138 WARN L148 SmtUtils]: Spent 2005ms on a formula simplification that was a NOOP. DAG size: 21 [2018-04-11 16:10:41,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:10:41,773 INFO L93 Difference]: Finished difference Result 380 states and 457 transitions. [2018-04-11 16:10:41,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 16:10:41,773 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-04-11 16:10:41,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:10:41,775 INFO L225 Difference]: With dead ends: 380 [2018-04-11 16:10:41,775 INFO L226 Difference]: Without dead ends: 380 [2018-04-11 16:10:41,775 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=58, Invalid=249, Unknown=3, NotChecked=32, Total=342 [2018-04-11 16:10:41,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-04-11 16:10:41,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 321. [2018-04-11 16:10:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-04-11 16:10:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 387 transitions. [2018-04-11 16:10:41,779 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 387 transitions. Word has length 48 [2018-04-11 16:10:41,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:10:41,779 INFO L459 AbstractCegarLoop]: Abstraction has 321 states and 387 transitions. [2018-04-11 16:10:41,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 16:10:41,779 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 387 transitions. [2018-04-11 16:10:41,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 16:10:41,780 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:10:41,780 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:10:41,780 INFO L408 AbstractCegarLoop]: === Iteration 38 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:10:41,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1066362853, now seen corresponding path program 1 times [2018-04-11 16:10:41,780 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:10:41,780 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:10:41,780 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:10:41,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:10:41,780 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:10:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:10:41,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:10:41,791 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:10:41,791 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:10:41,791 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:10:41,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:10:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:10:41,850 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:10:41,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:10:41,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:41,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:41,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:10:41,867 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 16:10:41,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:41,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:41,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2018-04-11 16:10:41,905 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 3 [2018-04-11 16:10:41,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:41,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:41,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:24 [2018-04-11 16:10:41,944 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 16:10:41,945 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 16:10:41,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:41,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:41,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, 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 16:10:41,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:10:41,954 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:41,971 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:41,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:41,976 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-04-11 16:10:42,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:10:42,048 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 19 treesize of output 20 [2018-04-11 16:10:42,050 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 16:10:42,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:42,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:42,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:10:42,072 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 19 treesize of output 20 [2018-04-11 16:10:42,074 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 16:10:42,074 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:42,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:42,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:42,091 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:62 [2018-04-11 16:10:42,123 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:10:42,142 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 78 [2018-04-11 16:10:42,145 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 16:10:42,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2018-04-11 16:10:42,224 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:42,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:10:42,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 48 [2018-04-11 16:10:42,308 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:10:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 49 [2018-04-11 16:10:42,355 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 16:10:42,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 16:10:42,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:10:42,428 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:10:42,430 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 59 treesize of output 67 [2018-04-11 16:10:42,431 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-11 16:10:42,431 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:42,438 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:42,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:10:42,441 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:10:42,442 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 54 treesize of output 62 [2018-04-11 16:10:42,444 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-11 16:10:42,444 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:42,453 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:42,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:10:42,472 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 115 [2018-04-11 16:10:42,475 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 16:10:42,475 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:42,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2018-04-11 16:10:42,553 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:42,574 INFO L267 ElimStorePlain]: Start of recursive call 11: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:42,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:10:42,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 72 [2018-04-11 16:10:42,583 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:10:42,583 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 14 treesize of output 18 [2018-04-11 16:10:42,583 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:42,593 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:42,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-04-11 16:10:42,641 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:81, output treesize:339 [2018-04-11 16:10:42,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:10:42,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:10:42,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:10:42,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 45 [2018-04-11 16:10:42,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:42,785 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 16:10:42,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:263, output treesize:113 [2018-04-11 16:10:42,879 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 9 treesize of output 1 [2018-04-11 16:10:42,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:42,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 16:10:42,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:154, output treesize:138 [2018-04-11 16:10:43,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:10:43,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:10:43,013 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:10:43,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:10:43,014 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:10:43,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:10:43,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 140 [2018-04-11 16:10:43,027 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:10:43,033 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 64 [2018-04-11 16:10:43,035 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 16:10:43,069 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:10:43,074 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 70 [2018-04-11 16:10:43,075 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 16:10:43,077 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:10:43,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 58 [2018-04-11 16:10:43,078 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:10:43,121 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:10:43,121 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 64 treesize of output 60 [2018-04-11 16:10:43,121 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:43,123 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:10:43,124 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 60 treesize of output 56 [2018-04-11 16:10:43,124 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:43,126 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:10:43,126 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 60 treesize of output 56 [2018-04-11 16:10:43,127 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:43,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-04-11 16:10:43,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2018-04-11 16:10:43,207 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 17 treesize of output 5 [2018-04-11 16:10:43,207 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:43,217 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 3 [2018-04-11 16:10:43,217 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:43,225 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:10:43,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, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 16:10:43,227 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:43,232 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:43,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 47 [2018-04-11 16:10:43,237 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:10:43,237 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-04-11 16:10:43,237 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:10:43,248 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:10:43,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 16:10:43,249 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:43,259 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 16:10:43,259 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:43,265 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:43,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2018-04-11 16:10:43,271 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:10:43,271 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 16:10:43,271 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:43,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 7 treesize of output 1 [2018-04-11 16:10:43,280 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:43,288 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:10:43,288 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 16:10:43,288 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:43,293 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:43,311 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 16:10:43,311 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 6 variables, input treesize:166, output treesize:7 [2018-04-11 16:10:43,340 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 16:10:43,340 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:10:43,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-04-11 16:10:43,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 16:10:43,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 16:10:43,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=406, Unknown=12, NotChecked=0, Total=462 [2018-04-11 16:10:43,341 INFO L87 Difference]: Start difference. First operand 321 states and 387 transitions. Second operand 22 states. [2018-04-11 16:10:44,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:10:44,842 INFO L93 Difference]: Finished difference Result 390 states and 466 transitions. [2018-04-11 16:10:44,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 16:10:44,842 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2018-04-11 16:10:44,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:10:44,844 INFO L225 Difference]: With dead ends: 390 [2018-04-11 16:10:44,844 INFO L226 Difference]: Without dead ends: 390 [2018-04-11 16:10:44,844 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=132, Invalid=1178, Unknown=22, NotChecked=0, Total=1332 [2018-04-11 16:10:44,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-04-11 16:10:44,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 336. [2018-04-11 16:10:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-04-11 16:10:44,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 402 transitions. [2018-04-11 16:10:44,851 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 402 transitions. Word has length 50 [2018-04-11 16:10:44,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:10:44,852 INFO L459 AbstractCegarLoop]: Abstraction has 336 states and 402 transitions. [2018-04-11 16:10:44,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 16:10:44,852 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 402 transitions. [2018-04-11 16:10:44,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 16:10:44,853 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:10:44,853 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:10:44,853 INFO L408 AbstractCegarLoop]: === Iteration 39 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:10:44,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1740139545, now seen corresponding path program 1 times [2018-04-11 16:10:44,853 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:10:44,853 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:10:44,854 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:10:44,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:10:44,854 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:10:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:10:44,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:10:44,866 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:10:44,866 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:10:44,866 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:10:44,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:10:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:10:44,891 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:10:44,905 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 16:10:44,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:44,911 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 16:10:44,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:44,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:44,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 16:10:44,924 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 16:10:44,925 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 16:10:44,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:44,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:44,936 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 16:10:44,938 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 16:10:44,938 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:44,939 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:44,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:44,946 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-04-11 16:10:45,309 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 68 DAG size of output 50 [2018-04-11 16:10:45,312 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 3 [2018-04-11 16:10:45,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:45,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:10:45,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:10:45,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 16:10:45,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:45,366 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 36 treesize of output 40 [2018-04-11 16:10:45,368 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 17 treesize of output 20 [2018-04-11 16:10:45,370 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:10:45,372 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 20 treesize of output 27 [2018-04-11 16:10:45,372 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:45,377 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:45,389 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 39 treesize of output 36 [2018-04-11 16:10:45,391 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:10:45,392 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 25 treesize of output 26 [2018-04-11 16:10:45,393 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:45,399 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:45,403 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:45,420 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 36 treesize of output 40 [2018-04-11 16:10:45,422 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 17 treesize of output 20 [2018-04-11 16:10:45,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:10:45,425 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 20 treesize of output 27 [2018-04-11 16:10:45,425 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:45,429 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:45,438 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 39 treesize of output 36 [2018-04-11 16:10:45,440 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:10:45,441 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-11 16:10:45,441 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:45,446 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:45,450 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 16:10:45,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:10:45,461 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 9 variables, input treesize:136, output treesize:52 [2018-04-11 16:10:45,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:10:45,788 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:10:45,793 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 73 treesize of output 77 [2018-04-11 16:10:45,797 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 64 treesize of output 58 [2018-04-11 16:10:45,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:45,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:45,817 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:10:45,819 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 81 treesize of output 85 [2018-04-11 16:10:45,820 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 63 [2018-04-11 16:10:45,821 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:45,829 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:45,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:10:45,838 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:116, output treesize:70 [2018-04-11 16:10:45,881 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 36 treesize of output 30 [2018-04-11 16:10:45,882 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 19 treesize of output 15 [2018-04-11 16:10:45,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:45,909 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 15 treesize of output 3 [2018-04-11 16:10:45,909 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:45,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:45,919 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 36 treesize of output 30 [2018-04-11 16:10:45,921 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 19 treesize of output 15 [2018-04-11 16:10:45,921 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:45,925 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 15 treesize of output 3 [2018-04-11 16:10:45,925 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:45,926 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:45,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:45,931 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:81, output treesize:7 [2018-04-11 16:10:45,965 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:10:45,965 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:10:45,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 16:10:45,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 16:10:45,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 16:10:45,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=475, Unknown=11, NotChecked=0, Total=552 [2018-04-11 16:10:45,966 INFO L87 Difference]: Start difference. First operand 336 states and 402 transitions. Second operand 24 states. [2018-04-11 16:10:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:10:46,864 INFO L93 Difference]: Finished difference Result 327 states and 382 transitions. [2018-04-11 16:10:46,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 16:10:46,865 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 53 [2018-04-11 16:10:46,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:10:46,866 INFO L225 Difference]: With dead ends: 327 [2018-04-11 16:10:46,866 INFO L226 Difference]: Without dead ends: 327 [2018-04-11 16:10:46,866 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=810, Unknown=15, NotChecked=0, Total=930 [2018-04-11 16:10:46,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-04-11 16:10:46,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 319. [2018-04-11 16:10:46,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-04-11 16:10:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 374 transitions. [2018-04-11 16:10:46,870 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 374 transitions. Word has length 53 [2018-04-11 16:10:46,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:10:46,871 INFO L459 AbstractCegarLoop]: Abstraction has 319 states and 374 transitions. [2018-04-11 16:10:46,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 16:10:46,871 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 374 transitions. [2018-04-11 16:10:46,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 16:10:46,872 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:10:46,872 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:10:46,872 INFO L408 AbstractCegarLoop]: === Iteration 40 === [__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr6AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr5AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr7AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__freeDataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr9RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr8RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr5RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__create_dataErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr2RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr4RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr7RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr6RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr0RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr3RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr1RequiresViolation, __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__appendErr5RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr18EnsuresViolationMEMORY_LEAK, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr15AssertViolationMEMORY_FREE]=== [2018-04-11 16:10:46,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1532747612, now seen corresponding path program 1 times [2018-04-11 16:10:46,872 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:10:46,872 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:10:46,873 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:10:46,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:10:46,873 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:10:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:10:46,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:10:46,880 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:10:46,881 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:10:46,881 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:10:46,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:10:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:10:46,898 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:10:46,967 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 16:10:46,969 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 16:10:46,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:46,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:46,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:10:46,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2018-04-11 16:10:46,977 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~pointerToList.offset Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c___U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_#in~pointerToList.base|) __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~pointerToList.offset))) (and (<= 0 __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~pointerToList.offset) (= |c_#valid| (store |c_old(#valid)| .cse0 1)) (<= __U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_~pointerToList.offset |c___U_MULTI_foptional_data_creation_test___true_valid_memsafety_i__append_#in~pointerToList.offset|) (= (select |c_old(#valid)| .cse0) 0)))) is different from true [2018-04-11 16:10:47,001 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 16:10:47,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:47,005 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 16:10:47,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2018-04-11 16:10:53,018 WARN L148 SmtUtils]: Spent 2002ms on a formula simplification that was a NOOP. DAG size: 16 [2018-04-11 16:10:53,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-04-11 16:10:53,040 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:10:53,041 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 27 treesize of output 21 [2018-04-11 16:10:53,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:10:53,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:53,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:10:53,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:23 [2018-04-11 16:10:53,082 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#list~0.base| Int) (|main_#t~mem20.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_~#list~0.base| 1))) (and (= 0 (select |c_old(#valid)| |main_~#list~0.base|)) (= (store (store .cse0 |main_#t~mem20.base| 0) |main_~#list~0.base| 0) |c_#valid|) (= 0 (select .cse0 |main_#t~mem20.base|))))) is different from true [2018-04-11 16:10:53,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:10:53,090 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:10:53,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 16:10:53,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 16:10:53,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 16:10:53,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=106, Unknown=6, NotChecked=42, Total=182 [2018-04-11 16:10:53,090 INFO L87 Difference]: Start difference. First operand 319 states and 374 transitions. Second operand 14 states. [2018-04-11 16:11:13,274 WARN L148 SmtUtils]: Spent 2005ms on a formula simplification that was a NOOP. DAG size: 21 Received shutdown request... [2018-04-11 16:11:53,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 16:11:53,866 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 16:11:53,869 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 16:11:53,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 04:11:53 BoogieIcfgContainer [2018-04-11 16:11:53,869 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 16:11:53,870 INFO L168 Benchmark]: Toolchain (without parser) took 206414.25 ms. Allocated memory was 397.4 MB in the beginning and 985.1 MB in the end (delta: 587.7 MB). Free memory was 328.9 MB in the beginning and 404.8 MB in the end (delta: -76.0 MB). Peak memory consumption was 511.7 MB. Max. memory is 5.3 GB. [2018-04-11 16:11:53,871 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 397.4 MB. Free memory is still 356.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 16:11:53,871 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.87 ms. Allocated memory is still 397.4 MB. Free memory was 328.9 MB in the beginning and 300.9 MB in the end (delta: 27.9 MB). Peak memory consumption was 26.6 MB. Max. memory is 5.3 GB. [2018-04-11 16:11:53,871 INFO L168 Benchmark]: Boogie Preprocessor took 45.81 ms. Allocated memory is still 397.4 MB. Free memory was 300.9 MB in the beginning and 298.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 16:11:53,871 INFO L168 Benchmark]: RCFGBuilder took 554.94 ms. Allocated memory was 397.4 MB in the beginning and 605.0 MB in the end (delta: 207.6 MB). Free memory was 298.3 MB in the beginning and 525.5 MB in the end (delta: -227.2 MB). Peak memory consumption was 23.4 MB. Max. memory is 5.3 GB. [2018-04-11 16:11:53,871 INFO L168 Benchmark]: TraceAbstraction took 205514.85 ms. Allocated memory was 605.0 MB in the beginning and 985.1 MB in the end (delta: 380.1 MB). Free memory was 525.5 MB in the beginning and 404.8 MB in the end (delta: 120.7 MB). Peak memory consumption was 500.8 MB. Max. memory is 5.3 GB. [2018-04-11 16:11:53,872 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 397.4 MB. Free memory is still 356.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 295.87 ms. Allocated memory is still 397.4 MB. Free memory was 328.9 MB in the beginning and 300.9 MB in the end (delta: 27.9 MB). Peak memory consumption was 26.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 45.81 ms. Allocated memory is still 397.4 MB. Free memory was 300.9 MB in the beginning and 298.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 554.94 ms. Allocated memory was 397.4 MB in the beginning and 605.0 MB in the end (delta: 207.6 MB). Free memory was 298.3 MB in the beginning and 525.5 MB in the end (delta: -227.2 MB). Peak memory consumption was 23.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 205514.85 ms. Allocated memory was 605.0 MB in the beginning and 985.1 MB in the end (delta: 380.1 MB). Free memory was 525.5 MB in the beginning and 404.8 MB in the end (delta: 120.7 MB). Peak memory consumption was 500.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 562]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 559]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 562]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 559]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 547]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 547]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 547]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 547]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 567]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 568]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 568]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 567]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 577]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 571]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 580]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 580). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 571]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 570]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 576]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 576). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 577]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 580]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 580). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 576]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 576). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 577]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 577]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (319states) and interpolant automaton (currently 15 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (220 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 133 locations, 45 error locations. TIMEOUT Result, 205.4s OverallTime, 40 OverallIterations, 2 TraceHistogramMax, 155.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3880 SDtfs, 2388 SDslu, 12775 SDs, 0 SdLazy, 14108 SolverSat, 377 SolverUnsat, 316 SolverUnknown, 0 SolverNotchecked, 142.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 932 GetRequests, 479 SyntacticMatches, 11 SemanticMatches, 442 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1227 ImplicationChecksByTransitivity, 33.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=336occurred in iteration=38, 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, 39 MinimizatonAttempts, 532 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 48.5s InterpolantComputationTime, 1935 NumberOfCodeBlocks, 1935 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 1267 ConstructedInterpolants, 233 QuantifiedInterpolants, 1044575 SizeOfPredicates, 176 NumberOfNonLiveVariables, 3121 ConjunctsInSsa, 590 ConjunctsInUnsatCore, 41 InterpolantComputations, 35 PerfectInterpolantSequences, 4/30 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/optional_data_creation_test04_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_16-11-53-876.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_16-11-53-876.csv Completed graceful shutdown