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_Array.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0504_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-12 23:51:00,029 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 23:51:00,030 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 23:51:00,042 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 23:51:00,042 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 23:51:00,043 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 23:51:00,043 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 23:51:00,045 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 23:51:00,046 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 23:51:00,047 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 23:51:00,048 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 23:51:00,048 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 23:51:00,049 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 23:51:00,049 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 23:51:00,050 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 23:51:00,052 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 23:51:00,053 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 23:51:00,055 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 23:51:00,055 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 23:51:00,056 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 23:51:00,058 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 23:51:00,058 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 23:51:00,058 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 23:51:00,059 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 23:51:00,060 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 23:51:00,061 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 23:51:00,061 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 23:51:00,061 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 23:51:00,062 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 23:51:00,062 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 23:51:00,063 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 23:51:00,063 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_Array.epf [2018-04-12 23:51:00,072 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 23:51:00,072 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 23:51:00,073 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-12 23:51:00,073 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-12 23:51:00,073 INFO L133 SettingsManager]: * Use SBE=true [2018-04-12 23:51:00,074 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 23:51:00,074 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 23:51:00,074 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 23:51:00,074 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 23:51:00,074 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 23:51:00,074 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 23:51:00,074 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 23:51:00,075 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-12 23:51:00,075 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 23:51:00,075 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 23:51:00,075 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 23:51:00,075 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-12 23:51:00,075 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-12 23:51:00,075 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 23:51:00,075 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 23:51:00,075 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 23:51:00,076 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-12 23:51:00,102 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 23:51:00,110 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 23:51:00,112 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 23:51:00,113 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 23:51:00,113 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 23:51:00,114 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,398 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG7348c0ae3 [2018-04-12 23:51:00,535 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 23:51:00,535 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 23:51:00,535 INFO L168 CDTParser]: Scanning test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,544 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 23:51:00,544 INFO L215 ultiparseSymbolTable]: [2018-04-12 23:51:00,544 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 23:51:00,544 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,544 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 23:51:00,544 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__uid_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,544 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uint32_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,545 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fd_set in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,545 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__lldiv_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,545 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____id_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,545 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____qaddr_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,545 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__int16_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,545 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____rlim64_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,545 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fsblkcnt_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,545 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__blksize_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,545 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____blksize_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,545 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____int32_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,546 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____dev_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,546 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsblkcnt_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,546 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__div_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,546 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__time_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,546 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_key_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,546 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_rwlock_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,546 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_short in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,546 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int32_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,546 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__key_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,546 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__caddr_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,546 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__sigset_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,547 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__mode_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,547 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____caddr_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,547 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ulong in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,547 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int64_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,547 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ino_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,547 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__clock_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,547 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pid_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,547 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ldiv_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,547 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsfilcnt64_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,547 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uint16_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,547 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____int8_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____loff_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__daddr_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__int64_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_mutex_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsfilcnt_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____WAIT_STATUS in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_barrierattr_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____swblk_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__register_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____daddr_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____key_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____int64_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_quad_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ushort in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____time_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__int8_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uint8_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__loff_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_condattr_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__dev_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____useconds_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__id_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__wchar_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____clockid_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__clockid_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____clock_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____sig_atomic_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_int in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fd_mask in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__quad_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int16_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int8_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_cond_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fsid_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____sigset_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__suseconds_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____blkcnt_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fd_mask in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_once_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uint64_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_spinlock_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_long in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____ino_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____ino64_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__gid_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uid_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_short in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ssize_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__nlink_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsid_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__uint in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____socklen_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____blkcnt64_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____ssize_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_rwlockattr_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____mode_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fsfilcnt_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____off_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__int32_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____gid_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_long in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____nlink_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____intptr_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____int16_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__timer_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__blkcnt_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__size_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_char in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__off_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsblkcnt64_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____pthread_list_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_mutexattr_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____rlim_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____timer_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_attr_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_barrier_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_quad_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____pid_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____quad_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____off64_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____suseconds_t in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_char in test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:00,568 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG7348c0ae3 [2018-04-12 23:51:00,571 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 23:51:00,572 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 23:51:00,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 23:51:00,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 23:51:00,577 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 23:51:00,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 11:51:00" (1/1) ... [2018-04-12 23:51:00,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cb0a6a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:51:00, skipping insertion in model container [2018-04-12 23:51:00,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 11:51:00" (1/1) ... [2018-04-12 23:51:00,591 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 23:51:00,613 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 23:51:00,740 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 23:51:00,779 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 23:51:00,786 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 113 non ball SCCs. Number of states in SCCs 113. [2018-04-12 23:51:00,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:51:00 WrapperNode [2018-04-12 23:51:00,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 23:51:00,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 23:51:00,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 23:51:00,820 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 23:51:00,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:51:00" (1/1) ... [2018-04-12 23:51:00,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:51:00" (1/1) ... [2018-04-12 23:51:00,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:51:00" (1/1) ... [2018-04-12 23:51:00,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:51:00" (1/1) ... [2018-04-12 23:51:00,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:51:00" (1/1) ... [2018-04-12 23:51:00,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:51:00" (1/1) ... [2018-04-12 23:51:00,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:51:00" (1/1) ... [2018-04-12 23:51:00,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 23:51:00,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 23:51:00,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 23:51:00,864 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 23:51:00,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:51:00" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 23:51:00,954 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 23:51:00,954 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 23:51:00,954 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 23:51:00,955 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-12 23:51:00,955 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-12 23:51:00,955 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-12 23:51:00,955 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-12 23:51:00,955 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-12 23:51:00,955 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-12 23:51:00,955 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-12 23:51:00,955 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-12 23:51:00,955 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-12 23:51:00,955 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-12 23:51:00,956 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-12 23:51:00,956 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-12 23:51:00,956 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-12 23:51:00,956 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-12 23:51:00,956 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-12 23:51:00,956 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-12 23:51:00,956 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-12 23:51:00,956 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-12 23:51:00,956 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-12 23:51:00,956 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-12 23:51:00,957 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-12 23:51:00,957 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-12 23:51:00,957 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-12 23:51:00,957 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-12 23:51:00,957 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-12 23:51:00,957 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-12 23:51:00,957 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-12 23:51:00,957 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-12 23:51:00,957 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-12 23:51:00,957 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-12 23:51:00,957 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-12 23:51:00,958 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-12 23:51:00,958 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-12 23:51:00,958 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-12 23:51:00,958 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-12 23:51:00,958 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-12 23:51:00,958 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-12 23:51:00,958 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-12 23:51:00,958 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-12 23:51:00,958 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-12 23:51:00,959 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-12 23:51:00,959 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-12 23:51:00,959 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-12 23:51:00,959 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-12 23:51:00,959 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-12 23:51:00,959 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-12 23:51:00,959 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-12 23:51:00,959 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-12 23:51:00,959 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-12 23:51:00,960 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-12 23:51:00,960 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-12 23:51:00,960 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-12 23:51:00,960 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-12 23:51:00,960 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-12 23:51:00,960 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-12 23:51:00,960 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-12 23:51:00,960 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-12 23:51:00,960 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-12 23:51:00,960 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-12 23:51:00,961 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-12 23:51:00,961 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-12 23:51:00,961 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-12 23:51:00,961 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-12 23:51:00,961 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-12 23:51:00,961 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-12 23:51:00,961 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-12 23:51:00,961 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-12 23:51:00,961 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-12 23:51:00,961 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-12 23:51:00,961 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-12 23:51:00,961 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-12 23:51:00,961 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-12 23:51:00,961 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-12 23:51:00,961 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-12 23:51:00,961 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-12 23:51:00,962 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-12 23:51:00,962 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-12 23:51:00,962 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-12 23:51:00,962 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-12 23:51:00,962 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-12 23:51:00,962 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-12 23:51:00,962 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-12 23:51:00,962 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-12 23:51:00,962 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-12 23:51:00,962 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-12 23:51:00,962 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-12 23:51:00,962 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-12 23:51:00,962 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-12 23:51:00,963 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-12 23:51:00,963 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-12 23:51:00,963 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-12 23:51:00,963 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-12 23:51:00,963 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-12 23:51:00,963 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-12 23:51:00,963 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-12 23:51:00,963 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-12 23:51:00,963 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-12 23:51:00,963 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-12 23:51:00,963 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-12 23:51:00,963 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-12 23:51:00,963 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-12 23:51:00,964 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-12 23:51:00,964 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-12 23:51:00,964 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 23:51:00,964 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-12 23:51:00,964 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-12 23:51:00,964 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-12 23:51:00,964 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-12 23:51:00,964 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-12 23:51:00,964 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-12 23:51:00,964 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 23:51:00,965 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 23:51:00,965 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-12 23:51:01,328 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 23:51:01,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 11:51:01 BoogieIcfgContainer [2018-04-12 23:51:01,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 23:51:01,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 23:51:01,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 23:51:01,331 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 23:51:01,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 11:51:00" (1/3) ... [2018-04-12 23:51:01,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c86bf1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 11:51:01, skipping insertion in model container [2018-04-12 23:51:01,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:51:00" (2/3) ... [2018-04-12 23:51:01,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c86bf1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 11:51:01, skipping insertion in model container [2018-04-12 23:51:01,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 11:51:01" (3/3) ... [2018-04-12 23:51:01,333 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0504_1_true-valid-memsafety.i [2018-04-12 23:51:01,339 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-12 23:51:01,343 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-04-12 23:51:01,365 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 23:51:01,366 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 23:51:01,366 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-12 23:51:01,366 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-12 23:51:01,366 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-12 23:51:01,366 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 23:51:01,366 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 23:51:01,366 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 23:51:01,366 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 23:51:01,367 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 23:51:01,376 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2018-04-12 23:51:01,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-04-12 23:51:01,384 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:51:01,384 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:51:01,384 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 23:51:01,387 INFO L82 PathProgramCache]: Analyzing trace with hash -2019747464, now seen corresponding path program 1 times [2018-04-12 23:51:01,420 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:51:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:51:01,443 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:51:01,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:01,464 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:51:01,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-12 23:51:01,465 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:51:01,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:01,466 INFO L182 omatonBuilderFactory]: Interpolants [108#true, 109#false] [2018-04-12 23:51:01,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:01,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-12 23:51:01,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-12 23:51:01,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-12 23:51:01,476 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 2 states. [2018-04-12 23:51:01,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:51:01,492 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2018-04-12 23:51:01,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-12 23:51:01,493 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-04-12 23:51:01,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:51:01,501 INFO L225 Difference]: With dead ends: 105 [2018-04-12 23:51:01,501 INFO L226 Difference]: Without dead ends: 102 [2018-04-12 23:51:01,502 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-12 23:51:01,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-04-12 23:51:01,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-04-12 23:51:01,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-12 23:51:01,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2018-04-12 23:51:01,531 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 10 [2018-04-12 23:51:01,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:51:01,531 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2018-04-12 23:51:01,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-12 23:51:01,531 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-04-12 23:51:01,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-12 23:51:01,532 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:51:01,532 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:51:01,532 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 23:51:01,532 INFO L82 PathProgramCache]: Analyzing trace with hash 328561019, now seen corresponding path program 1 times [2018-04-12 23:51:01,533 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:51:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:51:01,547 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:51:01,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-12 23:51:01,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:51:01,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 23:51:01,595 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:51:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:01,595 INFO L182 omatonBuilderFactory]: Interpolants [317#true, 318#false, 319#(= main_~c1~0 0)] [2018-04-12 23:51:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:01,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 23:51:01,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 23:51:01,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 23:51:01,597 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 3 states. [2018-04-12 23:51:01,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:51:01,619 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2018-04-12 23:51:01,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 23:51:01,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-04-12 23:51:01,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:51:01,620 INFO L225 Difference]: With dead ends: 111 [2018-04-12 23:51:01,620 INFO L226 Difference]: Without dead ends: 111 [2018-04-12 23:51:01,621 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 23:51:01,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-04-12 23:51:01,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2018-04-12 23:51:01,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-12 23:51:01,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2018-04-12 23:51:01,626 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 13 [2018-04-12 23:51:01,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:51:01,626 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2018-04-12 23:51:01,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 23:51:01,626 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2018-04-12 23:51:01,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-12 23:51:01,627 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:51:01,627 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:51:01,627 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 23:51:01,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1595456672, now seen corresponding path program 1 times [2018-04-12 23:51:01,627 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:51:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:51:01,634 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:51:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:01,647 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:51:01,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-12 23:51:01,647 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:51:01,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:01,647 INFO L182 omatonBuilderFactory]: Interpolants [539#true, 540#false, 541#(= |#valid| |old(#valid)|)] [2018-04-12 23:51:01,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:01,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 23:51:01,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 23:51:01,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 23:51:01,648 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 3 states. [2018-04-12 23:51:01,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:51:01,778 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2018-04-12 23:51:01,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 23:51:01,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-04-12 23:51:01,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:51:01,779 INFO L225 Difference]: With dead ends: 111 [2018-04-12 23:51:01,779 INFO L226 Difference]: Without dead ends: 107 [2018-04-12 23:51:01,780 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-12 23:51:01,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-12 23:51:01,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-04-12 23:51:01,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-04-12 23:51:01,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2018-04-12 23:51:01,788 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 14 [2018-04-12 23:51:01,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:51:01,788 INFO L459 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2018-04-12 23:51:01,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 23:51:01,788 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2018-04-12 23:51:01,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-12 23:51:01,788 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:51:01,788 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:51:01,788 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 23:51:01,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1594374816, now seen corresponding path program 1 times [2018-04-12 23:51:01,789 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:51:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:51:01,799 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:51:01,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:01,850 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:51:01,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 23:51:01,850 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:51:01,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:01,851 INFO L182 omatonBuilderFactory]: Interpolants [759#true, 760#false, 761#(= 1 (select |#valid| |main_#t~malloc3.base|)), 762#(= 1 (select |#valid| main_~x~0.base))] [2018-04-12 23:51:01,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:01,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 23:51:01,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 23:51:01,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 23:51:01,852 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand 4 states. [2018-04-12 23:51:02,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:51:02,004 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2018-04-12 23:51:02,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 23:51:02,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-12 23:51:02,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:51:02,006 INFO L225 Difference]: With dead ends: 133 [2018-04-12 23:51:02,006 INFO L226 Difference]: Without dead ends: 133 [2018-04-12 23:51:02,007 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 23:51:02,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-12 23:51:02,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 98. [2018-04-12 23:51:02,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-12 23:51:02,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2018-04-12 23:51:02,011 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 14 [2018-04-12 23:51:02,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:51:02,011 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2018-04-12 23:51:02,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 23:51:02,011 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2018-04-12 23:51:02,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-12 23:51:02,012 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:51:02,012 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:51:02,012 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 23:51:02,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1594374817, now seen corresponding path program 1 times [2018-04-12 23:51:02,012 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:51:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:51:02,022 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:51:02,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:02,056 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:51:02,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 23:51:02,057 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:51:02,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:02,057 INFO L182 omatonBuilderFactory]: Interpolants [997#true, 998#false, 999#(and (= 20 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 1000#(and (= main_~x~0.offset 0) (= 20 (select |#length| main_~x~0.base)))] [2018-04-12 23:51:02,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:02,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 23:51:02,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 23:51:02,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 23:51:02,058 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 4 states. [2018-04-12 23:51:02,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:51:02,176 INFO L93 Difference]: Finished difference Result 144 states and 159 transitions. [2018-04-12 23:51:02,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 23:51:02,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-12 23:51:02,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:51:02,178 INFO L225 Difference]: With dead ends: 144 [2018-04-12 23:51:02,178 INFO L226 Difference]: Without dead ends: 144 [2018-04-12 23:51:02,178 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 23:51:02,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-04-12 23:51:02,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 101. [2018-04-12 23:51:02,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-12 23:51:02,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2018-04-12 23:51:02,184 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 14 [2018-04-12 23:51:02,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:51:02,184 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2018-04-12 23:51:02,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 23:51:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2018-04-12 23:51:02,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-12 23:51:02,185 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:51:02,186 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] [2018-04-12 23:51:02,186 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 23:51:02,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1816054924, now seen corresponding path program 1 times [2018-04-12 23:51:02,188 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:51:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:51:02,204 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:51:02,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-12 23:51:02,248 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:51:02,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 23:51:02,248 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:51:02,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:02,248 INFO L182 omatonBuilderFactory]: Interpolants [1249#true, 1250#false, 1251#(and (= main_~first~0.offset 0) (= main_~first~0.base 0))] [2018-04-12 23:51:02,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:02,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 23:51:02,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 23:51:02,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 23:51:02,249 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 3 states. [2018-04-12 23:51:02,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:51:02,256 INFO L93 Difference]: Finished difference Result 147 states and 164 transitions. [2018-04-12 23:51:02,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 23:51:02,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-04-12 23:51:02,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:51:02,257 INFO L225 Difference]: With dead ends: 147 [2018-04-12 23:51:02,257 INFO L226 Difference]: Without dead ends: 147 [2018-04-12 23:51:02,257 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 23:51:02,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-12 23:51:02,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 129. [2018-04-12 23:51:02,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-12 23:51:02,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 156 transitions. [2018-04-12 23:51:02,261 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 156 transitions. Word has length 26 [2018-04-12 23:51:02,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:51:02,261 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 156 transitions. [2018-04-12 23:51:02,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 23:51:02,261 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 156 transitions. [2018-04-12 23:51:02,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-12 23:51:02,261 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:51:02,262 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] [2018-04-12 23:51:02,262 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 23:51:02,262 INFO L82 PathProgramCache]: Analyzing trace with hash -462361963, now seen corresponding path program 1 times [2018-04-12 23:51:02,262 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:51:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:51:02,284 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:51:02,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:02,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:51:02,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 23:51:02,369 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:51:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:02,370 INFO L182 omatonBuilderFactory]: Interpolants [1528#true, 1529#false, 1530#(and (= 20 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 1531#(and (= main_~x~0.offset 0) (= 20 (select |#length| main_~x~0.base))), 1532#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset 0) (= 20 (select |#length| main_~x~0.base))), 1533#(and (= main_~x~0.offset 0) (not (= main_~x~0.base |main_#t~malloc7.base|)) (= 20 (select |#length| main_~x~0.base)))] [2018-04-12 23:51:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:02,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 23:51:02,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 23:51:02,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-12 23:51:02,370 INFO L87 Difference]: Start difference. First operand 129 states and 156 transitions. Second operand 6 states. [2018-04-12 23:51:02,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:51:02,564 INFO L93 Difference]: Finished difference Result 242 states and 275 transitions. [2018-04-12 23:51:02,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 23:51:02,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-04-12 23:51:02,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:51:02,565 INFO L225 Difference]: With dead ends: 242 [2018-04-12 23:51:02,565 INFO L226 Difference]: Without dead ends: 242 [2018-04-12 23:51:02,565 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-04-12 23:51:02,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-12 23:51:02,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 118. [2018-04-12 23:51:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-12 23:51:02,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 138 transitions. [2018-04-12 23:51:02,569 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 138 transitions. Word has length 27 [2018-04-12 23:51:02,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:51:02,569 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 138 transitions. [2018-04-12 23:51:02,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 23:51:02,569 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2018-04-12 23:51:02,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 23:51:02,569 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:51:02,569 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] [2018-04-12 23:51:02,569 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 23:51:02,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1448318954, now seen corresponding path program 1 times [2018-04-12 23:51:02,570 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:51:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:51:02,581 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:51:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:02,605 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:51:02,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 23:51:02,605 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:51:02,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:02,606 INFO L182 omatonBuilderFactory]: Interpolants [1904#true, 1905#false, 1906#(= 1 (select |#valid| |main_#t~malloc7.base|)), 1907#(= 1 (select |#valid| main_~y~0.base))] [2018-04-12 23:51:02,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:02,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 23:51:02,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 23:51:02,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 23:51:02,607 INFO L87 Difference]: Start difference. First operand 118 states and 138 transitions. Second operand 4 states. [2018-04-12 23:51:02,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:51:02,700 INFO L93 Difference]: Finished difference Result 179 states and 204 transitions. [2018-04-12 23:51:02,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 23:51:02,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-04-12 23:51:02,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:51:02,702 INFO L225 Difference]: With dead ends: 179 [2018-04-12 23:51:02,702 INFO L226 Difference]: Without dead ends: 179 [2018-04-12 23:51:02,702 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 23:51:02,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-04-12 23:51:02,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 114. [2018-04-12 23:51:02,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-04-12 23:51:02,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2018-04-12 23:51:02,707 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 28 [2018-04-12 23:51:02,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:51:02,708 INFO L459 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2018-04-12 23:51:02,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 23:51:02,708 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2018-04-12 23:51:02,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 23:51:02,708 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:51:02,708 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] [2018-04-12 23:51:02,709 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 23:51:02,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1448318953, now seen corresponding path program 1 times [2018-04-12 23:51:02,710 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:51:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:51:02,725 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:51:02,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:02,766 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:51:02,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 23:51:02,766 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:51:02,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:02,766 INFO L182 omatonBuilderFactory]: Interpolants [2203#true, 2204#false, 2205#(and (= 0 |main_#t~malloc7.offset|) (= 12 (select |#length| |main_#t~malloc7.base|))), 2206#(and (= 12 (select |#length| main_~y~0.base)) (= main_~y~0.offset 0))] [2018-04-12 23:51:02,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:02,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 23:51:02,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 23:51:02,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 23:51:02,767 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand 4 states. [2018-04-12 23:51:02,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:51:02,811 INFO L93 Difference]: Finished difference Result 167 states and 188 transitions. [2018-04-12 23:51:02,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 23:51:02,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-04-12 23:51:02,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:51:02,811 INFO L225 Difference]: With dead ends: 167 [2018-04-12 23:51:02,812 INFO L226 Difference]: Without dead ends: 167 [2018-04-12 23:51:02,812 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 23:51:02,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-12 23:51:02,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 110. [2018-04-12 23:51:02,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-04-12 23:51:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2018-04-12 23:51:02,815 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 28 [2018-04-12 23:51:02,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:51:02,815 INFO L459 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2018-04-12 23:51:02,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 23:51:02,816 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2018-04-12 23:51:02,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-12 23:51:02,816 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:51:02,816 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-12 23:51:02,816 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 23:51:02,817 INFO L82 PathProgramCache]: Analyzing trace with hash 371541722, now seen corresponding path program 1 times [2018-04-12 23:51:02,817 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:51:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:51:02,830 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:51:02,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:02,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:51:02,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 23:51:02,889 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:51:02,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:02,890 INFO L182 omatonBuilderFactory]: Interpolants [2486#true, 2487#false, 2488#(= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)), 2489#(= 1 (select |#valid| |main_#t~mem8.base|)), 2490#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))), 2491#(= 1 (select |#valid| |main_#t~mem9.base|))] [2018-04-12 23:51:02,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:02,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 23:51:02,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 23:51:02,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 23:51:02,891 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand 6 states. [2018-04-12 23:51:02,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:51:02,996 INFO L93 Difference]: Finished difference Result 193 states and 215 transitions. [2018-04-12 23:51:02,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 23:51:02,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-12 23:51:02,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:51:02,997 INFO L225 Difference]: With dead ends: 193 [2018-04-12 23:51:02,997 INFO L226 Difference]: Without dead ends: 193 [2018-04-12 23:51:02,997 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-12 23:51:02,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-12 23:51:02,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 134. [2018-04-12 23:51:02,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-12 23:51:03,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 152 transitions. [2018-04-12 23:51:03,000 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 152 transitions. Word has length 31 [2018-04-12 23:51:03,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:51:03,000 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 152 transitions. [2018-04-12 23:51:03,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 23:51:03,000 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 152 transitions. [2018-04-12 23:51:03,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-12 23:51:03,001 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:51:03,001 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-12 23:51:03,001 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 23:51:03,001 INFO L82 PathProgramCache]: Analyzing trace with hash 371541723, now seen corresponding path program 1 times [2018-04-12 23:51:03,002 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:51:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:51:03,015 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:51:03,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:03,156 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:51:03,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-12 23:51:03,156 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:51:03,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:03,157 INFO L182 omatonBuilderFactory]: Interpolants [2832#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (<= 20 (select |#length| main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 2833#(and (<= 20 (select |#length| |main_#t~mem8.base|)) (= 0 |main_#t~mem8.offset|)), 2834#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset)) (<= 20 (select |#length| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)))), 2835#(and (<= 20 (select |#length| |main_#t~mem9.base|)) (= |main_#t~mem9.offset| 0)), 2825#true, 2826#false, 2827#(and (= 20 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 2828#(and (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 2829#(and (= (select |#length| main_~x~0.base) 20) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 2830#(and (= (select |#length| main_~x~0.base) 20) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 2831#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (<= 20 (select |#length| main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~malloc7.base|)))] [2018-04-12 23:51:03,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:03,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 23:51:03,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 23:51:03,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-04-12 23:51:03,157 INFO L87 Difference]: Start difference. First operand 134 states and 152 transitions. Second operand 11 states. [2018-04-12 23:51:03,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:51:03,505 INFO L93 Difference]: Finished difference Result 250 states and 275 transitions. [2018-04-12 23:51:03,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 23:51:03,505 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-04-12 23:51:03,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:51:03,506 INFO L225 Difference]: With dead ends: 250 [2018-04-12 23:51:03,506 INFO L226 Difference]: Without dead ends: 250 [2018-04-12 23:51:03,506 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-04-12 23:51:03,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-04-12 23:51:03,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 134. [2018-04-12 23:51:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-12 23:51:03,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 150 transitions. [2018-04-12 23:51:03,509 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 150 transitions. Word has length 31 [2018-04-12 23:51:03,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:51:03,510 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 150 transitions. [2018-04-12 23:51:03,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 23:51:03,510 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 150 transitions. [2018-04-12 23:51:03,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-12 23:51:03,510 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:51:03,511 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:51:03,511 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 23:51:03,511 INFO L82 PathProgramCache]: Analyzing trace with hash 141443004, now seen corresponding path program 1 times [2018-04-12 23:51:03,512 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:51:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:51:03,520 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:51:03,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:03,553 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:51:03,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 23:51:03,554 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:51:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:03,554 INFO L182 omatonBuilderFactory]: Interpolants [3241#true, 3242#false, 3243#(= 1 (select |#valid| main_~x~0.base)), 3244#(= 1 (select |#valid| main_~first~0.base))] [2018-04-12 23:51:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:03,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 23:51:03,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 23:51:03,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 23:51:03,555 INFO L87 Difference]: Start difference. First operand 134 states and 150 transitions. Second operand 4 states. [2018-04-12 23:51:03,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:51:03,623 INFO L93 Difference]: Finished difference Result 168 states and 184 transitions. [2018-04-12 23:51:03,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 23:51:03,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-04-12 23:51:03,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:51:03,624 INFO L225 Difference]: With dead ends: 168 [2018-04-12 23:51:03,624 INFO L226 Difference]: Without dead ends: 168 [2018-04-12 23:51:03,625 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 23:51:03,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-04-12 23:51:03,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 137. [2018-04-12 23:51:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-12 23:51:03,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 155 transitions. [2018-04-12 23:51:03,627 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 155 transitions. Word has length 32 [2018-04-12 23:51:03,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:51:03,627 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 155 transitions. [2018-04-12 23:51:03,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 23:51:03,627 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2018-04-12 23:51:03,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-12 23:51:03,627 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:51:03,628 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:51:03,628 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 23:51:03,628 INFO L82 PathProgramCache]: Analyzing trace with hash 141443005, now seen corresponding path program 1 times [2018-04-12 23:51:03,629 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:51:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:51:03,636 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:51:03,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:03,663 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:51:03,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 23:51:03,663 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:51:03,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:03,663 INFO L182 omatonBuilderFactory]: Interpolants [3553#true, 3554#false, 3555#(and (= 20 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 3556#(and (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 3557#(and (= main_~first~0.offset 0) (= 20 (select |#length| main_~first~0.base)))] [2018-04-12 23:51:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:03,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 23:51:03,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 23:51:03,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 23:51:03,664 INFO L87 Difference]: Start difference. First operand 137 states and 155 transitions. Second operand 5 states. [2018-04-12 23:51:03,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:51:03,809 INFO L93 Difference]: Finished difference Result 220 states and 250 transitions. [2018-04-12 23:51:03,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 23:51:03,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-04-12 23:51:03,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:51:03,811 INFO L225 Difference]: With dead ends: 220 [2018-04-12 23:51:03,811 INFO L226 Difference]: Without dead ends: 220 [2018-04-12 23:51:03,811 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-12 23:51:03,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-04-12 23:51:03,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 166. [2018-04-12 23:51:03,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-12 23:51:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 193 transitions. [2018-04-12 23:51:03,816 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 193 transitions. Word has length 32 [2018-04-12 23:51:03,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:51:03,817 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 193 transitions. [2018-04-12 23:51:03,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 23:51:03,817 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 193 transitions. [2018-04-12 23:51:03,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-12 23:51:03,817 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:51:03,818 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-12 23:51:03,818 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 23:51:03,818 INFO L82 PathProgramCache]: Analyzing trace with hash 89765503, now seen corresponding path program 1 times [2018-04-12 23:51:03,819 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:51:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:51:03,830 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:51:03,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:03,872 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:51:03,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-04-12 23:51:03,872 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:51:03,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:03,872 INFO L182 omatonBuilderFactory]: Interpolants [3952#(= main_~c1~0 0), 3953#(<= 1 main_~c1~0), 3950#true, 3951#false] [2018-04-12 23:51:03,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:03,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 23:51:03,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 23:51:03,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 23:51:03,873 INFO L87 Difference]: Start difference. First operand 166 states and 193 transitions. Second operand 4 states. [2018-04-12 23:51:03,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:51:03,884 INFO L93 Difference]: Finished difference Result 166 states and 191 transitions. [2018-04-12 23:51:03,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 23:51:03,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-04-12 23:51:03,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:51:03,885 INFO L225 Difference]: With dead ends: 166 [2018-04-12 23:51:03,885 INFO L226 Difference]: Without dead ends: 166 [2018-04-12 23:51:03,885 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-12 23:51:03,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-04-12 23:51:03,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-04-12 23:51:03,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-12 23:51:03,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 191 transitions. [2018-04-12 23:51:03,887 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 191 transitions. Word has length 33 [2018-04-12 23:51:03,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:51:03,887 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 191 transitions. [2018-04-12 23:51:03,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 23:51:03,887 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 191 transitions. [2018-04-12 23:51:03,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-12 23:51:03,888 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:51:03,888 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-12 23:51:03,888 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 23:51:03,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1512223586, now seen corresponding path program 1 times [2018-04-12 23:51:03,888 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:51:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:51:03,894 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:51:03,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:03,937 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:51:03,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 23:51:03,937 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:51:03,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:03,937 INFO L182 omatonBuilderFactory]: Interpolants [4288#(and (= 20 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 4289#(and (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 4290#(and (= 20 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)), 4291#(and (= 20 (select |#length| main_~x~1.base)) (= main_~x~1.offset 0)), 4286#true, 4287#false] [2018-04-12 23:51:03,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:03,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 23:51:03,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 23:51:03,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 23:51:03,938 INFO L87 Difference]: Start difference. First operand 166 states and 191 transitions. Second operand 6 states. [2018-04-12 23:51:04,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:51:04,120 INFO L93 Difference]: Finished difference Result 244 states and 274 transitions. [2018-04-12 23:51:04,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 23:51:04,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-04-12 23:51:04,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:51:04,121 INFO L225 Difference]: With dead ends: 244 [2018-04-12 23:51:04,122 INFO L226 Difference]: Without dead ends: 244 [2018-04-12 23:51:04,122 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-04-12 23:51:04,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-04-12 23:51:04,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 179. [2018-04-12 23:51:04,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-12 23:51:04,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 213 transitions. [2018-04-12 23:51:04,126 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 213 transitions. Word has length 34 [2018-04-12 23:51:04,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:51:04,127 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 213 transitions. [2018-04-12 23:51:04,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 23:51:04,127 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 213 transitions. [2018-04-12 23:51:04,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-12 23:51:04,128 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:51:04,128 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-12 23:51:04,128 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 23:51:04,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1512223587, now seen corresponding path program 1 times [2018-04-12 23:51:04,129 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:51:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:51:04,141 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:51:04,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-12 23:51:04,162 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:51:04,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 23:51:04,162 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:51:04,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:04,163 INFO L182 omatonBuilderFactory]: Interpolants [4725#true, 4726#false, 4727#(= main_~first~0.base main_~x~1.base), 4728#(= 1 (select |#valid| main_~x~1.base))] [2018-04-12 23:51:04,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-12 23:51:04,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 23:51:04,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 23:51:04,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 23:51:04,163 INFO L87 Difference]: Start difference. First operand 179 states and 213 transitions. Second operand 4 states. [2018-04-12 23:51:04,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:51:04,222 INFO L93 Difference]: Finished difference Result 207 states and 250 transitions. [2018-04-12 23:51:04,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 23:51:04,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-04-12 23:51:04,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:51:04,223 INFO L225 Difference]: With dead ends: 207 [2018-04-12 23:51:04,224 INFO L226 Difference]: Without dead ends: 207 [2018-04-12 23:51:04,224 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 23:51:04,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-04-12 23:51:04,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 193. [2018-04-12 23:51:04,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-12 23:51:04,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 239 transitions. [2018-04-12 23:51:04,228 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 239 transitions. Word has length 34 [2018-04-12 23:51:04,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:51:04,228 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 239 transitions. [2018-04-12 23:51:04,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 23:51:04,229 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 239 transitions. [2018-04-12 23:51:04,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-12 23:51:04,229 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:51:04,229 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:51:04,229 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 23:51:04,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1490401502, now seen corresponding path program 1 times [2018-04-12 23:51:04,230 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:51:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:51:04,239 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:51:04,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:04,288 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:51:04,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 23:51:04,288 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:51:04,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:04,288 INFO L182 omatonBuilderFactory]: Interpolants [5136#(and (= main_~x~1.offset |main_#t~mem12.offset|) (= main_~x~1.base |main_#t~mem12.base|)), 5137#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base)), 5131#true, 5132#false, 5133#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 5134#(and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))), 5135#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset)))] [2018-04-12 23:51:04,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:04,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 23:51:04,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 23:51:04,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-12 23:51:04,289 INFO L87 Difference]: Start difference. First operand 193 states and 239 transitions. Second operand 7 states. [2018-04-12 23:51:04,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:51:04,417 INFO L93 Difference]: Finished difference Result 271 states and 331 transitions. [2018-04-12 23:51:04,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-12 23:51:04,418 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-04-12 23:51:04,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:51:04,418 INFO L225 Difference]: With dead ends: 271 [2018-04-12 23:51:04,418 INFO L226 Difference]: Without dead ends: 271 [2018-04-12 23:51:04,419 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-04-12 23:51:04,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-04-12 23:51:04,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 205. [2018-04-12 23:51:04,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-12 23:51:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 253 transitions. [2018-04-12 23:51:04,421 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 253 transitions. Word has length 38 [2018-04-12 23:51:04,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:51:04,422 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 253 transitions. [2018-04-12 23:51:04,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 23:51:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 253 transitions. [2018-04-12 23:51:04,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-12 23:51:04,422 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:51:04,422 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, 1, 1] [2018-04-12 23:51:04,422 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 23:51:04,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1754004315, now seen corresponding path program 1 times [2018-04-12 23:51:04,423 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:51:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:51:04,430 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:51:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:04,454 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:51:04,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-12 23:51:04,454 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:51:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:04,454 INFO L182 omatonBuilderFactory]: Interpolants [5627#true, 5628#false, 5629#(= main_~c1~0 0), 5630#(<= main_~c1~0 1), 5631#(<= main_~c1~0 0)] [2018-04-12 23:51:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:04,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 23:51:04,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 23:51:04,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-12 23:51:04,455 INFO L87 Difference]: Start difference. First operand 205 states and 253 transitions. Second operand 5 states. [2018-04-12 23:51:04,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:51:04,481 INFO L93 Difference]: Finished difference Result 265 states and 323 transitions. [2018-04-12 23:51:04,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 23:51:04,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-12 23:51:04,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:51:04,482 INFO L225 Difference]: With dead ends: 265 [2018-04-12 23:51:04,482 INFO L226 Difference]: Without dead ends: 265 [2018-04-12 23:51:04,482 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-12 23:51:04,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-04-12 23:51:04,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 250. [2018-04-12 23:51:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-12 23:51:04,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 321 transitions. [2018-04-12 23:51:04,485 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 321 transitions. Word has length 43 [2018-04-12 23:51:04,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:51:04,485 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 321 transitions. [2018-04-12 23:51:04,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 23:51:04,485 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 321 transitions. [2018-04-12 23:51:04,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-12 23:51:04,486 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:51:04,486 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] [2018-04-12 23:51:04,486 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 23:51:04,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1460441408, now seen corresponding path program 1 times [2018-04-12 23:51:04,487 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:51:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:51:04,498 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:51:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:04,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:51:04,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-12 23:51:04,541 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:51:04,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:04,541 INFO L182 omatonBuilderFactory]: Interpolants [6147#true, 6148#false, 6149#(= |#valid| |old(#valid)|), 6150#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0)), 6151#(= (store |#valid| main_~x~0.base 0) |old(#valid)|), 6152#(= (store |#valid| main_~first~0.base 0) |old(#valid)|), 6153#(= |old(#valid)| (store |#valid| main_~x~1.base 0))] [2018-04-12 23:51:04,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:04,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 23:51:04,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 23:51:04,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-12 23:51:04,542 INFO L87 Difference]: Start difference. First operand 250 states and 321 transitions. Second operand 7 states. [2018-04-12 23:51:04,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:51:04,719 INFO L93 Difference]: Finished difference Result 257 states and 327 transitions. [2018-04-12 23:51:04,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 23:51:04,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-04-12 23:51:04,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:51:04,720 INFO L225 Difference]: With dead ends: 257 [2018-04-12 23:51:04,720 INFO L226 Difference]: Without dead ends: 242 [2018-04-12 23:51:04,720 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-04-12 23:51:04,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-12 23:51:04,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-04-12 23:51:04,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-04-12 23:51:04,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 311 transitions. [2018-04-12 23:51:04,724 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 311 transitions. Word has length 44 [2018-04-12 23:51:04,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:51:04,725 INFO L459 AbstractCegarLoop]: Abstraction has 241 states and 311 transitions. [2018-04-12 23:51:04,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 23:51:04,725 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 311 transitions. [2018-04-12 23:51:04,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-12 23:51:04,725 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:51:04,725 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:51:04,725 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 23:51:04,726 INFO L82 PathProgramCache]: Analyzing trace with hash 259479251, now seen corresponding path program 1 times [2018-04-12 23:51:04,726 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:51:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:51:04,737 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:51:04,793 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:04,793 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:51:04,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-12 23:51:04,793 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:51:04,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:04,793 INFO L182 omatonBuilderFactory]: Interpolants [6662#true, 6663#false, 6664#(= 1 (select |#valid| main_~x~0.base)), 6665#(= 1 (select |#valid| main_~last~0.base)), 6666#(or (= main_~last~0.base |main_#t~malloc3.base|) (= 1 (select |#valid| main_~last~0.base))), 6667#(or (= 1 (select |#valid| main_~last~0.base)) (= main_~x~0.base main_~last~0.base)), 6668#(and (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~last~0.base)))] [2018-04-12 23:51:04,794 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:04,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 23:51:04,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 23:51:04,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-12 23:51:04,794 INFO L87 Difference]: Start difference. First operand 241 states and 311 transitions. Second operand 7 states. [2018-04-12 23:51:04,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:51:04,905 INFO L93 Difference]: Finished difference Result 273 states and 345 transitions. [2018-04-12 23:51:04,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 23:51:04,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-04-12 23:51:04,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:51:04,906 INFO L225 Difference]: With dead ends: 273 [2018-04-12 23:51:04,907 INFO L226 Difference]: Without dead ends: 273 [2018-04-12 23:51:04,907 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-12 23:51:04,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-04-12 23:51:04,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 240. [2018-04-12 23:51:04,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-04-12 23:51:04,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 309 transitions. [2018-04-12 23:51:04,911 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 309 transitions. Word has length 45 [2018-04-12 23:51:04,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:51:04,911 INFO L459 AbstractCegarLoop]: Abstraction has 240 states and 309 transitions. [2018-04-12 23:51:04,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 23:51:04,911 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 309 transitions. [2018-04-12 23:51:04,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-12 23:51:04,912 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:51:04,912 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:51:04,912 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 23:51:04,912 INFO L82 PathProgramCache]: Analyzing trace with hash 259479252, now seen corresponding path program 1 times [2018-04-12 23:51:04,913 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:51:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:51:04,922 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:51:04,964 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:04,964 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:51:04,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-04-12 23:51:04,964 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:51:04,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:04,965 INFO L182 omatonBuilderFactory]: Interpolants [7184#(and (= 20 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 7185#(and (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 7186#(and (<= 20 (select |#length| main_~last~0.base)) (= main_~last~0.offset 0)), 7182#true, 7183#false] [2018-04-12 23:51:04,965 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 23:51:04,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 23:51:04,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 23:51:04,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 23:51:04,965 INFO L87 Difference]: Start difference. First operand 240 states and 309 transitions. Second operand 5 states. [2018-04-12 23:51:05,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:51:05,086 INFO L93 Difference]: Finished difference Result 310 states and 393 transitions. [2018-04-12 23:51:05,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 23:51:05,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-04-12 23:51:05,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:51:05,088 INFO L225 Difference]: With dead ends: 310 [2018-04-12 23:51:05,088 INFO L226 Difference]: Without dead ends: 310 [2018-04-12 23:51:05,088 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-12 23:51:05,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-04-12 23:51:05,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 263. [2018-04-12 23:51:05,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-04-12 23:51:05,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 337 transitions. [2018-04-12 23:51:05,093 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 337 transitions. Word has length 45 [2018-04-12 23:51:05,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:51:05,093 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 337 transitions. [2018-04-12 23:51:05,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 23:51:05,094 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 337 transitions. [2018-04-12 23:51:05,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-12 23:51:05,094 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:51:05,094 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:51:05,094 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr40EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr39AssertViolationMEMORY_FREE]=== [2018-04-12 23:51:05,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1869032365, now seen corresponding path program 1 times [2018-04-12 23:51:05,095 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:51:05,103 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-04-12 23:51:05,103 INFO L293 seRefinementStrategy]: Strategy FixedRefinementStrategy was unsuccessful and could not determine trace feasibility. [2018-04-12 23:51:05,103 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-12 23:51:05,115 WARN L200 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-04-12 23:51:05,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.04 11:51:05 BoogieIcfgContainer [2018-04-12 23:51:05,116 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-12 23:51:05,116 INFO L168 Benchmark]: Toolchain (without parser) took 4544.36 ms. Allocated memory was 395.8 MB in the beginning and 676.9 MB in the end (delta: 281.0 MB). Free memory was 334.2 MB in the beginning and 501.9 MB in the end (delta: -167.7 MB). Peak memory consumption was 113.3 MB. Max. memory is 5.3 GB. [2018-04-12 23:51:05,118 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 395.8 MB. Free memory is still 357.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 23:51:05,118 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.11 ms. Allocated memory is still 395.8 MB. Free memory was 334.2 MB in the beginning and 307.8 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. [2018-04-12 23:51:05,118 INFO L168 Benchmark]: Boogie Preprocessor took 42.79 ms. Allocated memory is still 395.8 MB. Free memory was 307.8 MB in the beginning and 305.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-12 23:51:05,119 INFO L168 Benchmark]: RCFGBuilder took 465.13 ms. Allocated memory was 395.8 MB in the beginning and 594.0 MB in the end (delta: 198.2 MB). Free memory was 305.1 MB in the beginning and 517.5 MB in the end (delta: -212.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 5.3 GB. [2018-04-12 23:51:05,119 INFO L168 Benchmark]: TraceAbstraction took 3786.74 ms. Allocated memory was 594.0 MB in the beginning and 676.9 MB in the end (delta: 82.8 MB). Free memory was 517.5 MB in the beginning and 501.9 MB in the end (delta: 15.6 MB). Peak memory consumption was 98.4 MB. Max. memory is 5.3 GB. [2018-04-12 23:51:05,121 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.09 ms. Allocated memory is still 395.8 MB. Free memory is still 357.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 247.11 ms. Allocated memory is still 395.8 MB. Free memory was 334.2 MB in the beginning and 307.8 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.79 ms. Allocated memory is still 395.8 MB. Free memory was 307.8 MB in the beginning and 305.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 465.13 ms. Allocated memory was 395.8 MB in the beginning and 594.0 MB in the end (delta: 198.2 MB). Free memory was 305.1 MB in the beginning and 517.5 MB in the end (delta: -212.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3786.74 ms. Allocated memory was 594.0 MB in the beginning and 676.9 MB in the end (delta: 82.8 MB). Free memory was 517.5 MB in the beginning and 501.9 MB in the end (delta: 15.6 MB). Peak memory consumption was 98.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 652]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND TRUE c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND TRUE c2 < 3 && __VERIFIER_nondet_int() [L647] c2++ [L647] c2++ [L648] EXPR, FCALL malloc(sizeof(struct T)) [L648] y = malloc(sizeof(struct T)) [L649] COND FALSE !(!y) [L651] EXPR, FCALL x->head.next [L651] FCALL y->next = x->head.next [L652] EXPR, FCALL y->next [L652] FCALL y->next->prev = y [L653] FCALL y->prev = &x->head [L654] FCALL y->data = c2*c1 [L655] FCALL x->head.next = y [L656] y = ((void *)0) [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND TRUE c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND TRUE c2 < 3 && __VERIFIER_nondet_int() [L647] c2++ [L647] c2++ [L648] EXPR, FCALL malloc(sizeof(struct T)) [L648] y = malloc(sizeof(struct T)) [L649] COND FALSE !(!y) [L651] EXPR, FCALL x->head.next [L651] FCALL y->next = x->head.next [L652] EXPR, FCALL y->next [L652] FCALL y->next->prev = y - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 105 locations, 41 error locations. UNKNOWN Result, 3.7s OverallTime, 22 OverallIterations, 2 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1770 SDtfs, 2836 SDslu, 3080 SDs, 0 SdLazy, 2277 SolverSat, 140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=263occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 37/75 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 847 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 616 NumberOfCodeBlocks, 616 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 595 ConstructedInterpolants, 0 QuantifiedInterpolants, 95990 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 16 PerfectInterpolantSequences, 37/75 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-12_23-51-05-129.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-12_23-51-05-129.csv Received shutdown request...