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/forester-heap/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 01:17:32,907 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 01:17:32,908 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 01:17:32,920 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 01:17:32,921 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 01:17:32,921 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 01:17:32,922 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 01:17:32,923 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 01:17:32,924 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 01:17:32,925 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 01:17:32,926 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 01:17:32,926 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 01:17:32,927 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 01:17:32,928 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 01:17:32,929 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 01:17:32,930 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 01:17:32,932 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 01:17:32,933 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 01:17:32,934 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 01:17:32,935 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 01:17:32,937 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 01:17:32,937 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 01:17:32,937 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 01:17:32,938 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 01:17:32,939 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 01:17:32,940 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 01:17:32,940 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 01:17:32,941 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 01:17:32,941 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 01:17:32,941 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 01:17:32,942 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 01:17:32,942 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-13 01:17:32,952 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 01:17:32,952 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 01:17:32,953 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 01:17:32,954 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 01:17:32,954 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 01:17:32,954 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 01:17:32,954 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 01:17:32,954 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 01:17:32,955 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 01:17:32,955 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 01:17:32,955 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 01:17:32,955 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 01:17:32,955 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 01:17:32,955 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 01:17:32,956 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 01:17:32,956 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 01:17:32,956 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 01:17:32,956 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 01:17:32,956 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 01:17:32,956 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 01:17:32,956 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 01:17:32,957 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-13 01:17:32,987 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 01:17:33,001 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 01:17:33,004 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 01:17:33,006 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 01:17:33,006 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 01:17:33,007 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,356 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG3fda0c0d3 [2018-04-13 01:17:33,489 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 01:17:33,489 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 01:17:33,489 INFO L168 CDTParser]: Scanning dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,496 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 01:17:33,496 INFO L215 ultiparseSymbolTable]: [2018-04-13 01:17:33,497 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 01:17:33,497 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,497 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 01:17:33,497 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__register_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,497 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsword_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,497 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,497 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ssize_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,497 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_once_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,497 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__off_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,497 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____nlink_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,497 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_attr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,497 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int8_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,497 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__timer_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,497 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____sig_atomic_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__wchar_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____socklen_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fd_mask in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____useconds_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_condattr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsfilcnt64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ldiv_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ino_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____time_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____timer_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_mutexattr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____key_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint8_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____daddr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__loff_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int8_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,498 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsfilcnt_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,499 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,499 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsblkcnt64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,499 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____rlim_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,499 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__quad_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,499 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,499 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int16_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,499 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fsid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,499 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__mode_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,499 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_cond_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,499 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_short in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,499 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____clock_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,499 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_spinlock_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,500 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__div_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,500 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__size_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,500 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____clockid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,500 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__suseconds_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,500 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____loff_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,500 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__uid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,500 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fd_set in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,500 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____mode_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,500 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,500 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__blksize_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,501 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__clock_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,501 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint32_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,501 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____intptr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,501 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,501 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_long in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,501 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int16_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,501 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____ino_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,501 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_short in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,501 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__gid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,501 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__SLL in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,501 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____sigset_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,502 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__caddr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,502 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int32_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,502 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_barrierattr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,502 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__blkcnt_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,502 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__sigset_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,502 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ulong in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,502 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_long in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,502 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____caddr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,502 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_key_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,502 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_char in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,502 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____dev_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,503 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsblkcnt_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,503 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int16_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,503 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__lldiv_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,503 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint16_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,503 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____id_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,503 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____quad_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,503 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__daddr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,503 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____qaddr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,503 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____gid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,503 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____blksize_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,503 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____syscall_ulong_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,504 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_quad_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,504 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_barrier_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,504 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fsblkcnt_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,504 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____pid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,504 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_quad_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,504 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____off64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,504 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____suseconds_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,504 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ushort in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,504 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_char in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,504 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____rlim64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,504 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,504 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____blkcnt_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,504 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fd_mask in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,504 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_mutex_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,504 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int32_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____syscall_slong_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__time_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_int in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____pthread_slist_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int8_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__idtype_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__key_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__clockid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____ssize_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_rwlock_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__uint in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__nlink_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int32_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__id_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____off_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__dev_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fsfilcnt_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_rwlockattr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____blkcnt64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,505 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,506 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____ino64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:33,518 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG3fda0c0d3 [2018-04-13 01:17:33,522 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 01:17:33,524 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 01:17:33,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 01:17:33,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 01:17:33,529 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 01:17:33,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 01:17:33" (1/1) ... [2018-04-13 01:17:33,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@399d4f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:17:33, skipping insertion in model container [2018-04-13 01:17:33,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 01:17:33" (1/1) ... [2018-04-13 01:17:33,545 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 01:17:33,573 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 01:17:33,717 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 01:17:33,755 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 01:17:33,763 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-13 01:17:33,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:17:33 WrapperNode [2018-04-13 01:17:33,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 01:17:33,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 01:17:33,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 01:17:33,801 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 01:17:33,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:17:33" (1/1) ... [2018-04-13 01:17:33,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:17:33" (1/1) ... [2018-04-13 01:17:33,826 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:17:33" (1/1) ... [2018-04-13 01:17:33,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:17:33" (1/1) ... [2018-04-13 01:17:33,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:17:33" (1/1) ... [2018-04-13 01:17:33,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:17:33" (1/1) ... [2018-04-13 01:17:33,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:17:33" (1/1) ... [2018-04-13 01:17:33,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 01:17:33,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 01:17:33,844 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 01:17:33,844 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 01:17:33,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:17:33" (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-13 01:17:33,923 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 01:17:33,923 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 01:17:33,923 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 01:17:33,923 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-13 01:17:33,923 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-13 01:17:33,923 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-13 01:17:33,924 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-13 01:17:33,924 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-13 01:17:33,924 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-13 01:17:33,924 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-13 01:17:33,924 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-13 01:17:33,924 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-13 01:17:33,924 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-13 01:17:33,924 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-13 01:17:33,924 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-13 01:17:33,924 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-13 01:17:33,924 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-13 01:17:33,924 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-13 01:17:33,925 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-13 01:17:33,925 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-13 01:17:33,925 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-13 01:17:33,925 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-13 01:17:33,925 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-13 01:17:33,925 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-13 01:17:33,925 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-13 01:17:33,925 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-13 01:17:33,925 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-13 01:17:33,926 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-13 01:17:33,926 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-13 01:17:33,926 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-13 01:17:33,926 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-13 01:17:33,926 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-13 01:17:33,926 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-13 01:17:33,926 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-13 01:17:33,926 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-13 01:17:33,926 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-13 01:17:33,926 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-13 01:17:33,927 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-13 01:17:33,927 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-13 01:17:33,927 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-13 01:17:33,927 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-13 01:17:33,927 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-13 01:17:33,927 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-13 01:17:33,927 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-13 01:17:33,927 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-13 01:17:33,927 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-13 01:17:33,927 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-13 01:17:33,927 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-13 01:17:33,928 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-13 01:17:33,928 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-13 01:17:33,928 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-13 01:17:33,928 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-13 01:17:33,928 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-13 01:17:33,928 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 01:17:33,928 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-13 01:17:33,928 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-13 01:17:33,928 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 01:17:33,928 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-13 01:17:33,928 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-13 01:17:33,928 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-13 01:17:33,929 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-13 01:17:33,929 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-13 01:17:33,929 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-13 01:17:33,929 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-13 01:17:33,929 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-13 01:17:33,929 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-13 01:17:33,929 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-13 01:17:33,929 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-13 01:17:33,929 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-13 01:17:33,929 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-13 01:17:33,929 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-13 01:17:33,929 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-13 01:17:33,929 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-13 01:17:33,929 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-13 01:17:33,930 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-13 01:17:33,930 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-13 01:17:33,930 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-13 01:17:33,930 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-13 01:17:33,930 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-13 01:17:33,930 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-13 01:17:33,930 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-13 01:17:33,930 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-13 01:17:33,930 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-13 01:17:33,930 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-13 01:17:33,930 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-13 01:17:33,930 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-13 01:17:33,930 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-13 01:17:33,930 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-13 01:17:33,930 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-13 01:17:33,930 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-13 01:17:33,930 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-13 01:17:33,930 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-13 01:17:33,931 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-13 01:17:33,931 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-13 01:17:33,931 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-13 01:17:33,931 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-13 01:17:33,931 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-13 01:17:33,931 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-13 01:17:33,931 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-13 01:17:33,931 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-13 01:17:33,931 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-13 01:17:33,931 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-13 01:17:33,931 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-13 01:17:33,931 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-13 01:17:33,931 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-13 01:17:33,932 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-13 01:17:33,932 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 01:17:33,932 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-13 01:17:33,932 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 01:17:33,932 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 01:17:33,932 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-13 01:17:33,932 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 01:17:33,932 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-13 01:17:33,932 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 01:17:33,932 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 01:17:33,932 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 01:17:33,932 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 01:17:33,932 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 01:17:34,320 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 01:17:34,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 01:17:34 BoogieIcfgContainer [2018-04-13 01:17:34,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 01:17:34,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 01:17:34,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 01:17:34,323 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 01:17:34,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 01:17:33" (1/3) ... [2018-04-13 01:17:34,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2192cdd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 01:17:34, skipping insertion in model container [2018-04-13 01:17:34,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:17:33" (2/3) ... [2018-04-13 01:17:34,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2192cdd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 01:17:34, skipping insertion in model container [2018-04-13 01:17:34,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 01:17:34" (3/3) ... [2018-04-13 01:17:34,325 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-13 01:17:34,332 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-13 01:17:34,341 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 57 error locations. [2018-04-13 01:17:34,372 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 01:17:34,373 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 01:17:34,373 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 01:17:34,373 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-13 01:17:34,373 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-13 01:17:34,373 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 01:17:34,373 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 01:17:34,373 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 01:17:34,373 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 01:17:34,374 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 01:17:34,382 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2018-04-13 01:17:34,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-13 01:17:34,388 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:34,388 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:17:34,388 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:34,391 INFO L82 PathProgramCache]: Analyzing trace with hash -401927193, now seen corresponding path program 1 times [2018-04-13 01:17:34,424 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:34,454 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:34,508 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-13 01:17:34,510 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:17:34,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 01:17:34,511 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:34,512 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-13 01:17:34,512 INFO L182 omatonBuilderFactory]: Interpolants [138#true, 139#false, 140#(= 1 (select |#valid| |main_#t~malloc0.base|)), 141#(= 1 (select |#valid| main_~head~0.base))] [2018-04-13 01:17:34,512 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-13 01:17:34,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 01:17:34,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 01:17:34,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 01:17:34,528 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 4 states. [2018-04-13 01:17:34,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:34,755 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions. [2018-04-13 01:17:34,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 01:17:34,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-13 01:17:34,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:34,772 INFO L225 Difference]: With dead ends: 179 [2018-04-13 01:17:34,773 INFO L226 Difference]: Without dead ends: 170 [2018-04-13 01:17:34,774 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-13 01:17:34,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-04-13 01:17:34,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 126. [2018-04-13 01:17:34,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-13 01:17:34,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 133 transitions. [2018-04-13 01:17:34,805 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 133 transitions. Word has length 8 [2018-04-13 01:17:34,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:34,806 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 133 transitions. [2018-04-13 01:17:34,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 01:17:34,806 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2018-04-13 01:17:34,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-13 01:17:34,806 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:34,806 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:17:34,806 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:34,806 INFO L82 PathProgramCache]: Analyzing trace with hash -401927192, now seen corresponding path program 1 times [2018-04-13 01:17:34,807 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:34,816 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:34,841 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-13 01:17:34,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:17:34,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 01:17:34,841 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:34,841 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-13 01:17:34,842 INFO L182 omatonBuilderFactory]: Interpolants [449#true, 450#false, 451#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 452#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0))] [2018-04-13 01:17:34,842 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-13 01:17:34,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 01:17:34,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 01:17:34,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 01:17:34,843 INFO L87 Difference]: Start difference. First operand 126 states and 133 transitions. Second operand 4 states. [2018-04-13 01:17:34,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:34,961 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-04-13 01:17:34,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 01:17:34,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-13 01:17:34,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:34,964 INFO L225 Difference]: With dead ends: 153 [2018-04-13 01:17:34,964 INFO L226 Difference]: Without dead ends: 153 [2018-04-13 01:17:34,965 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-13 01:17:34,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-13 01:17:34,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 123. [2018-04-13 01:17:34,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-13 01:17:34,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2018-04-13 01:17:34,972 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 8 [2018-04-13 01:17:34,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:34,972 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2018-04-13 01:17:34,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 01:17:34,972 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2018-04-13 01:17:34,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-13 01:17:34,973 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:34,973 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:17:34,973 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:34,973 INFO L82 PathProgramCache]: Analyzing trace with hash -166598540, now seen corresponding path program 1 times [2018-04-13 01:17:34,975 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:34,993 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:35,032 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-13 01:17:35,032 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:17:35,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 01:17:35,032 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:35,033 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-13 01:17:35,033 INFO L182 omatonBuilderFactory]: Interpolants [731#true, 732#false, 733#(= 1 (select |#valid| main_~head~0.base)), 734#(= 1 (select |#valid| main_~x~0.base))] [2018-04-13 01:17:35,033 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-13 01:17:35,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 01:17:35,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 01:17:35,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 01:17:35,034 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 4 states. [2018-04-13 01:17:35,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:35,180 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2018-04-13 01:17:35,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 01:17:35,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-13 01:17:35,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:35,181 INFO L225 Difference]: With dead ends: 126 [2018-04-13 01:17:35,182 INFO L226 Difference]: Without dead ends: 126 [2018-04-13 01:17:35,182 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-13 01:17:35,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-13 01:17:35,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 118. [2018-04-13 01:17:35,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-13 01:17:35,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2018-04-13 01:17:35,188 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 16 [2018-04-13 01:17:35,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:35,188 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2018-04-13 01:17:35,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 01:17:35,188 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2018-04-13 01:17:35,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-13 01:17:35,189 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:35,189 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:17:35,189 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:35,189 INFO L82 PathProgramCache]: Analyzing trace with hash -166598539, now seen corresponding path program 1 times [2018-04-13 01:17:35,190 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:35,204 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:35,244 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-13 01:17:35,244 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:17:35,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 01:17:35,245 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:35,245 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-13 01:17:35,245 INFO L182 omatonBuilderFactory]: Interpolants [981#true, 982#false, 983#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 984#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base))), 985#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))] [2018-04-13 01:17:35,245 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-13 01:17:35,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 01:17:35,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 01:17:35,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 01:17:35,246 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand 5 states. [2018-04-13 01:17:35,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:35,432 INFO L93 Difference]: Finished difference Result 198 states and 217 transitions. [2018-04-13 01:17:35,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 01:17:35,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-13 01:17:35,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:35,433 INFO L225 Difference]: With dead ends: 198 [2018-04-13 01:17:35,433 INFO L226 Difference]: Without dead ends: 198 [2018-04-13 01:17:35,433 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-13 01:17:35,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-04-13 01:17:35,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 164. [2018-04-13 01:17:35,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-13 01:17:35,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 194 transitions. [2018-04-13 01:17:35,442 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 194 transitions. Word has length 16 [2018-04-13 01:17:35,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:35,442 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 194 transitions. [2018-04-13 01:17:35,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 01:17:35,442 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 194 transitions. [2018-04-13 01:17:35,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-13 01:17:35,443 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:35,443 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:17:35,443 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:35,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1187407017, now seen corresponding path program 1 times [2018-04-13 01:17:35,445 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:35,459 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:35,482 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-13 01:17:35,482 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:17:35,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 01:17:35,482 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:35,482 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-13 01:17:35,483 INFO L182 omatonBuilderFactory]: Interpolants [1352#true, 1353#false, 1354#(= 1 (select |#valid| |main_#t~malloc2.base|)), 1355#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 1356#(= 1 (select |#valid| |main_#t~mem3.base|))] [2018-04-13 01:17:35,483 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-13 01:17:35,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 01:17:35,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 01:17:35,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 01:17:35,483 INFO L87 Difference]: Start difference. First operand 164 states and 194 transitions. Second operand 5 states. [2018-04-13 01:17:35,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:35,650 INFO L93 Difference]: Finished difference Result 279 states and 331 transitions. [2018-04-13 01:17:35,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 01:17:35,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-13 01:17:35,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:35,651 INFO L225 Difference]: With dead ends: 279 [2018-04-13 01:17:35,651 INFO L226 Difference]: Without dead ends: 279 [2018-04-13 01:17:35,652 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-13 01:17:35,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-04-13 01:17:35,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 163. [2018-04-13 01:17:35,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-04-13 01:17:35,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 192 transitions. [2018-04-13 01:17:35,659 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 192 transitions. Word has length 18 [2018-04-13 01:17:35,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:35,659 INFO L459 AbstractCegarLoop]: Abstraction has 163 states and 192 transitions. [2018-04-13 01:17:35,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 01:17:35,659 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 192 transitions. [2018-04-13 01:17:35,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-13 01:17:35,660 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:35,660 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:17:35,660 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:35,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1187407016, now seen corresponding path program 1 times [2018-04-13 01:17:35,661 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:35,671 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:35,708 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-13 01:17:35,708 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:17:35,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 01:17:35,709 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:35,709 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-13 01:17:35,709 INFO L182 omatonBuilderFactory]: Interpolants [1803#true, 1804#false, 1805#(and (= 12 (select |#length| |main_#t~malloc2.base|)) (= 0 |main_#t~malloc2.offset|)), 1806#(and (= 12 (select |#length| (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))), 1807#(and (= |main_#t~mem3.offset| 0) (= 12 (select |#length| |main_#t~mem3.base|)))] [2018-04-13 01:17:35,709 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-13 01:17:35,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 01:17:35,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 01:17:35,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 01:17:35,709 INFO L87 Difference]: Start difference. First operand 163 states and 192 transitions. Second operand 5 states. [2018-04-13 01:17:35,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:35,880 INFO L93 Difference]: Finished difference Result 286 states and 340 transitions. [2018-04-13 01:17:35,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 01:17:35,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-13 01:17:35,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:35,882 INFO L225 Difference]: With dead ends: 286 [2018-04-13 01:17:35,882 INFO L226 Difference]: Without dead ends: 286 [2018-04-13 01:17:35,882 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-13 01:17:35,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-04-13 01:17:35,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 162. [2018-04-13 01:17:35,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-04-13 01:17:35,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 190 transitions. [2018-04-13 01:17:35,888 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 190 transitions. Word has length 18 [2018-04-13 01:17:35,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:35,888 INFO L459 AbstractCegarLoop]: Abstraction has 162 states and 190 transitions. [2018-04-13 01:17:35,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 01:17:35,888 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 190 transitions. [2018-04-13 01:17:35,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-13 01:17:35,889 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:35,889 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:17:35,889 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:35,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1810792676, now seen corresponding path program 1 times [2018-04-13 01:17:35,891 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:35,898 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:35,914 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-13 01:17:35,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:17:35,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 01:17:35,915 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:35,915 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-13 01:17:35,915 INFO L182 omatonBuilderFactory]: Interpolants [2262#true, 2263#false, 2264#(= 1 (select |#valid| |main_#t~malloc6.base|)), 2265#(= 1 (select |#valid| main_~x~0.base))] [2018-04-13 01:17:35,915 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-13 01:17:35,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 01:17:35,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 01:17:35,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 01:17:35,916 INFO L87 Difference]: Start difference. First operand 162 states and 190 transitions. Second operand 4 states. [2018-04-13 01:17:36,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:36,010 INFO L93 Difference]: Finished difference Result 179 states and 198 transitions. [2018-04-13 01:17:36,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 01:17:36,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-04-13 01:17:36,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:36,011 INFO L225 Difference]: With dead ends: 179 [2018-04-13 01:17:36,011 INFO L226 Difference]: Without dead ends: 179 [2018-04-13 01:17:36,012 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-13 01:17:36,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-04-13 01:17:36,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 161. [2018-04-13 01:17:36,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-13 01:17:36,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 189 transitions. [2018-04-13 01:17:36,015 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 189 transitions. Word has length 19 [2018-04-13 01:17:36,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:36,015 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 189 transitions. [2018-04-13 01:17:36,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 01:17:36,015 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 189 transitions. [2018-04-13 01:17:36,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-13 01:17:36,015 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:36,015 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:17:36,015 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:36,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1810792677, now seen corresponding path program 1 times [2018-04-13 01:17:36,016 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:36,024 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:36,045 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-13 01:17:36,045 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:17:36,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 01:17:36,046 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:36,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:17:36,046 INFO L182 omatonBuilderFactory]: Interpolants [2608#true, 2609#false, 2610#(and (= 0 |main_#t~malloc6.offset|) (= 12 (select |#length| |main_#t~malloc6.base|))), 2611#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))] [2018-04-13 01:17:36,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:17:36,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 01:17:36,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 01:17:36,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 01:17:36,046 INFO L87 Difference]: Start difference. First operand 161 states and 189 transitions. Second operand 4 states. [2018-04-13 01:17:36,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:36,129 INFO L93 Difference]: Finished difference Result 180 states and 201 transitions. [2018-04-13 01:17:36,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 01:17:36,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-04-13 01:17:36,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:36,130 INFO L225 Difference]: With dead ends: 180 [2018-04-13 01:17:36,130 INFO L226 Difference]: Without dead ends: 180 [2018-04-13 01:17:36,130 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-13 01:17:36,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-04-13 01:17:36,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 158. [2018-04-13 01:17:36,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-13 01:17:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2018-04-13 01:17:36,134 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 19 [2018-04-13 01:17:36,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:36,134 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2018-04-13 01:17:36,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 01:17:36,134 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2018-04-13 01:17:36,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-13 01:17:36,135 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:36,135 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:17:36,135 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:36,135 INFO L82 PathProgramCache]: Analyzing trace with hash 29390169, now seen corresponding path program 1 times [2018-04-13 01:17:36,136 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:36,146 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:36,245 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-13 01:17:36,245 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:17:36,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 01:17:36,245 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:36,246 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-13 01:17:36,246 INFO L182 omatonBuilderFactory]: Interpolants [2960#(= 1 (select |#valid| |main_#t~mem4.base|)), 2952#true, 2953#false, 2954#(= 1 (select |#valid| main_~head~0.base)), 2955#(= (select |#valid| main_~x~0.base) 1), 2956#(and (= 1 (select |#valid| |main_#t~malloc2.base|)) (not (= main_~x~0.base |main_#t~malloc2.base|))), 2957#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 2958#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem3.base|))), 2959#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))] [2018-04-13 01:17:36,246 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-13 01:17:36,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 01:17:36,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 01:17:36,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-13 01:17:36,247 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand 9 states. [2018-04-13 01:17:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:36,511 INFO L93 Difference]: Finished difference Result 164 states and 188 transitions. [2018-04-13 01:17:36,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 01:17:36,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-04-13 01:17:36,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:36,512 INFO L225 Difference]: With dead ends: 164 [2018-04-13 01:17:36,513 INFO L226 Difference]: Without dead ends: 164 [2018-04-13 01:17:36,513 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-04-13 01:17:36,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-13 01:17:36,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 157. [2018-04-13 01:17:36,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-04-13 01:17:36,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 185 transitions. [2018-04-13 01:17:36,516 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 185 transitions. Word has length 22 [2018-04-13 01:17:36,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:36,516 INFO L459 AbstractCegarLoop]: Abstraction has 157 states and 185 transitions. [2018-04-13 01:17:36,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 01:17:36,516 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 185 transitions. [2018-04-13 01:17:36,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-13 01:17:36,517 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:36,517 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:17:36,517 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:36,517 INFO L82 PathProgramCache]: Analyzing trace with hash 29390170, now seen corresponding path program 1 times [2018-04-13 01:17:36,518 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:36,527 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:36,600 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-13 01:17:36,600 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:17:36,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-13 01:17:36,600 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:36,600 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-13 01:17:36,601 INFO L182 omatonBuilderFactory]: Interpolants [3296#(= 1 (select |#valid| main_~head~0.base)), 3297#(= (select |#valid| main_~x~0.base) 1), 3298#(and (= 12 (select |#length| |main_#t~malloc2.base|)) (= 0 |main_#t~malloc2.offset|) (not (= main_~x~0.base |main_#t~malloc2.base|))), 3299#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 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))), 3300#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem3.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 3301#(and (= 12 (select |#length| (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))), 3302#(and (= 12 (select |#length| |main_#t~mem4.base|)) (= 0 |main_#t~mem4.offset|)), 3303#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0)), 3294#true, 3295#false] [2018-04-13 01:17:36,601 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-13 01:17:36,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 01:17:36,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 01:17:36,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-13 01:17:36,601 INFO L87 Difference]: Start difference. First operand 157 states and 185 transitions. Second operand 10 states. [2018-04-13 01:17:37,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:37,114 INFO L93 Difference]: Finished difference Result 164 states and 189 transitions. [2018-04-13 01:17:37,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 01:17:37,114 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-04-13 01:17:37,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:37,115 INFO L225 Difference]: With dead ends: 164 [2018-04-13 01:17:37,115 INFO L226 Difference]: Without dead ends: 164 [2018-04-13 01:17:37,115 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-04-13 01:17:37,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-13 01:17:37,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 143. [2018-04-13 01:17:37,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-13 01:17:37,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 170 transitions. [2018-04-13 01:17:37,118 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 170 transitions. Word has length 22 [2018-04-13 01:17:37,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:37,118 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 170 transitions. [2018-04-13 01:17:37,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 01:17:37,118 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 170 transitions. [2018-04-13 01:17:37,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-13 01:17:37,119 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:37,119 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:17:37,119 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:37,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1340356530, now seen corresponding path program 1 times [2018-04-13 01:17:37,120 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:37,128 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:37,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:17:37,164 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:17:37,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 01:17:37,164 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:37,164 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-13 01:17:37,164 INFO L182 omatonBuilderFactory]: Interpolants [3633#true, 3634#false, 3635#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 3636#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 3637#(and (= 0 |main_#t~mem7.base|) (= |main_#t~mem7.offset| 0))] [2018-04-13 01:17:37,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:17:37,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 01:17:37,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 01:17:37,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 01:17:37,165 INFO L87 Difference]: Start difference. First operand 143 states and 170 transitions. Second operand 5 states. [2018-04-13 01:17:37,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:37,271 INFO L93 Difference]: Finished difference Result 161 states and 190 transitions. [2018-04-13 01:17:37,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 01:17:37,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-04-13 01:17:37,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:37,272 INFO L225 Difference]: With dead ends: 161 [2018-04-13 01:17:37,272 INFO L226 Difference]: Without dead ends: 161 [2018-04-13 01:17:37,272 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-13 01:17:37,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-13 01:17:37,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 151. [2018-04-13 01:17:37,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-04-13 01:17:37,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 180 transitions. [2018-04-13 01:17:37,274 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 180 transitions. Word has length 24 [2018-04-13 01:17:37,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:37,274 INFO L459 AbstractCegarLoop]: Abstraction has 151 states and 180 transitions. [2018-04-13 01:17:37,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 01:17:37,274 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 180 transitions. [2018-04-13 01:17:37,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-13 01:17:37,275 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:37,275 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] [2018-04-13 01:17:37,275 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:37,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1381455388, now seen corresponding path program 1 times [2018-04-13 01:17:37,276 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:37,283 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:37,314 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-13 01:17:37,314 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:17:37,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 01:17:37,314 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:37,314 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-13 01:17:37,314 INFO L182 omatonBuilderFactory]: Interpolants [3954#true, 3955#false, 3956#(and (= 0 |main_#t~malloc6.offset|) (= 12 (select |#length| |main_#t~malloc6.base|))), 3957#(and (= 12 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 3958#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))] [2018-04-13 01:17:37,314 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-13 01:17:37,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 01:17:37,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 01:17:37,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 01:17:37,315 INFO L87 Difference]: Start difference. First operand 151 states and 180 transitions. Second operand 5 states. [2018-04-13 01:17:37,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:37,469 INFO L93 Difference]: Finished difference Result 187 states and 206 transitions. [2018-04-13 01:17:37,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 01:17:37,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-13 01:17:37,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:37,470 INFO L225 Difference]: With dead ends: 187 [2018-04-13 01:17:37,470 INFO L226 Difference]: Without dead ends: 187 [2018-04-13 01:17:37,470 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-13 01:17:37,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-04-13 01:17:37,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 129. [2018-04-13 01:17:37,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-13 01:17:37,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 145 transitions. [2018-04-13 01:17:37,473 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 145 transitions. Word has length 25 [2018-04-13 01:17:37,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:37,473 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 145 transitions. [2018-04-13 01:17:37,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 01:17:37,473 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 145 transitions. [2018-04-13 01:17:37,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-13 01:17:37,474 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:37,474 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-13 01:17:37,474 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:37,474 INFO L82 PathProgramCache]: Analyzing trace with hash 667065395, now seen corresponding path program 1 times [2018-04-13 01:17:37,475 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:37,486 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:37,521 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-13 01:17:37,521 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:17:37,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 01:17:37,521 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:37,521 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-13 01:17:37,522 INFO L182 omatonBuilderFactory]: Interpolants [4281#true, 4282#false, 4283#(and (= |main_#t~mem7.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 4284#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 4285#(and (= 0 |main_#t~mem10.base|) (= 0 |main_#t~mem10.offset|)), 4286#(and (= main_~y~0.offset 0) (= main_~y~0.base 0))] [2018-04-13 01:17:37,522 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-13 01:17:37,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 01:17:37,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 01:17:37,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 01:17:37,523 INFO L87 Difference]: Start difference. First operand 129 states and 145 transitions. Second operand 6 states. [2018-04-13 01:17:37,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:37,706 INFO L93 Difference]: Finished difference Result 199 states and 219 transitions. [2018-04-13 01:17:37,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 01:17:37,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-04-13 01:17:37,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:37,707 INFO L225 Difference]: With dead ends: 199 [2018-04-13 01:17:37,707 INFO L226 Difference]: Without dead ends: 199 [2018-04-13 01:17:37,707 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-13 01:17:37,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-04-13 01:17:37,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 142. [2018-04-13 01:17:37,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-13 01:17:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 162 transitions. [2018-04-13 01:17:37,711 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 162 transitions. Word has length 27 [2018-04-13 01:17:37,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:37,711 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 162 transitions. [2018-04-13 01:17:37,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 01:17:37,711 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 162 transitions. [2018-04-13 01:17:37,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-13 01:17:37,711 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:37,712 INFO L355 BasicCegarLoop]: trace histogram [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-13 01:17:37,712 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:37,712 INFO L82 PathProgramCache]: Analyzing trace with hash -2018605973, now seen corresponding path program 1 times [2018-04-13 01:17:37,713 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:37,722 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:37,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:17:37,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:17:37,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-13 01:17:37,785 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:37,785 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-13 01:17:37,786 INFO L182 omatonBuilderFactory]: Interpolants [4640#(= 1 (select |#valid| main_~x~0.base)), 4632#true, 4633#false, 4634#(= 1 (select |#valid| main_~head~0.base)), 4635#(or (= main_~head~0.base |main_#t~malloc6.base|) (= 1 (select |#valid| main_~head~0.base))), 4636#(or (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 4637#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 4638#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 4639#(= 1 (select |#valid| |main_#t~mem14.base|))] [2018-04-13 01:17:37,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:17:37,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 01:17:37,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 01:17:37,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-13 01:17:37,788 INFO L87 Difference]: Start difference. First operand 142 states and 162 transitions. Second operand 9 states. [2018-04-13 01:17:37,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:37,959 INFO L93 Difference]: Finished difference Result 186 states and 208 transitions. [2018-04-13 01:17:37,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 01:17:37,959 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-04-13 01:17:37,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:37,961 INFO L225 Difference]: With dead ends: 186 [2018-04-13 01:17:37,961 INFO L226 Difference]: Without dead ends: 186 [2018-04-13 01:17:37,962 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-04-13 01:17:37,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-04-13 01:17:37,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 148. [2018-04-13 01:17:37,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-13 01:17:37,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 170 transitions. [2018-04-13 01:17:37,965 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 170 transitions. Word has length 30 [2018-04-13 01:17:37,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:37,965 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 170 transitions. [2018-04-13 01:17:37,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 01:17:37,966 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 170 transitions. [2018-04-13 01:17:37,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-13 01:17:37,966 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:37,966 INFO L355 BasicCegarLoop]: trace histogram [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-13 01:17:37,966 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:37,967 INFO L82 PathProgramCache]: Analyzing trace with hash -2018605972, now seen corresponding path program 1 times [2018-04-13 01:17:37,968 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:37,976 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:38,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:17:38,072 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:17:38,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-13 01:17:38,072 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:38,072 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-13 01:17:38,072 INFO L182 omatonBuilderFactory]: Interpolants [4992#(and (= 12 (select |#length| (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))), 4993#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4994#(and (= 0 |main_#t~mem14.offset|) (= 12 (select |#length| |main_#t~mem14.base|))), 4995#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0)), 4987#true, 4988#false, 4989#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 4990#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base))), 4991#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~head~0.base)))] [2018-04-13 01:17:38,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:17:38,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 01:17:38,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 01:17:38,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-04-13 01:17:38,073 INFO L87 Difference]: Start difference. First operand 148 states and 170 transitions. Second operand 9 states. [2018-04-13 01:17:38,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:38,372 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2018-04-13 01:17:38,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 01:17:38,373 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-04-13 01:17:38,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:38,373 INFO L225 Difference]: With dead ends: 221 [2018-04-13 01:17:38,373 INFO L226 Difference]: Without dead ends: 221 [2018-04-13 01:17:38,374 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-04-13 01:17:38,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-13 01:17:38,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 146. [2018-04-13 01:17:38,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-13 01:17:38,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 167 transitions. [2018-04-13 01:17:38,377 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 167 transitions. Word has length 30 [2018-04-13 01:17:38,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:38,377 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 167 transitions. [2018-04-13 01:17:38,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 01:17:38,377 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 167 transitions. [2018-04-13 01:17:38,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-13 01:17:38,378 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:38,378 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-13 01:17:38,378 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:38,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1797163218, now seen corresponding path program 1 times [2018-04-13 01:17:38,379 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:38,386 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:38,435 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-13 01:17:38,435 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:17:38,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 01:17:38,435 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:38,436 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-13 01:17:38,436 INFO L182 omatonBuilderFactory]: Interpolants [5381#true, 5382#false, 5383#(= 1 (select |#valid| main_~head~0.base)), 5384#(or (= main_~head~0.base |main_#t~malloc6.base|) (= 1 (select |#valid| main_~head~0.base))), 5385#(or (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 5386#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 5387#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 5388#(= 1 (select |#valid| |main_#t~mem15.base|)), 5389#(= 1 (select |#valid| main_~x~0.base))] [2018-04-13 01:17:38,436 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-13 01:17:38,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 01:17:38,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 01:17:38,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-13 01:17:38,436 INFO L87 Difference]: Start difference. First operand 146 states and 167 transitions. Second operand 9 states. [2018-04-13 01:17:38,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:38,595 INFO L93 Difference]: Finished difference Result 192 states and 216 transitions. [2018-04-13 01:17:38,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 01:17:38,595 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-04-13 01:17:38,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:38,596 INFO L225 Difference]: With dead ends: 192 [2018-04-13 01:17:38,596 INFO L226 Difference]: Without dead ends: 192 [2018-04-13 01:17:38,596 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-04-13 01:17:38,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-04-13 01:17:38,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 151. [2018-04-13 01:17:38,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-04-13 01:17:38,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 174 transitions. [2018-04-13 01:17:38,599 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 174 transitions. Word has length 31 [2018-04-13 01:17:38,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:38,600 INFO L459 AbstractCegarLoop]: Abstraction has 151 states and 174 transitions. [2018-04-13 01:17:38,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 01:17:38,600 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 174 transitions. [2018-04-13 01:17:38,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-13 01:17:38,600 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:38,600 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-13 01:17:38,600 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:38,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1797163219, now seen corresponding path program 1 times [2018-04-13 01:17:38,601 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:38,608 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:38,698 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-13 01:17:38,698 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:17:38,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 01:17:38,698 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:38,698 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-13 01:17:38,699 INFO L182 omatonBuilderFactory]: Interpolants [5745#true, 5746#false, 5747#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 5748#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base))), 5749#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~head~0.base))), 5750#(and (= 12 (select |#length| (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))), 5751#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5752#(and (= 12 (select |#length| |main_#t~mem15.base|)) (= 0 |main_#t~mem15.offset|)), 5753#(and (= 12 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset))] [2018-04-13 01:17:38,699 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-13 01:17:38,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 01:17:38,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 01:17:38,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-04-13 01:17:38,699 INFO L87 Difference]: Start difference. First operand 151 states and 174 transitions. Second operand 9 states. [2018-04-13 01:17:38,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:38,993 INFO L93 Difference]: Finished difference Result 226 states and 248 transitions. [2018-04-13 01:17:38,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 01:17:38,993 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-04-13 01:17:38,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:38,993 INFO L225 Difference]: With dead ends: 226 [2018-04-13 01:17:38,994 INFO L226 Difference]: Without dead ends: 226 [2018-04-13 01:17:38,994 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-04-13 01:17:38,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-04-13 01:17:38,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 153. [2018-04-13 01:17:38,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-13 01:17:38,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 175 transitions. [2018-04-13 01:17:38,996 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 175 transitions. Word has length 31 [2018-04-13 01:17:38,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:38,996 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 175 transitions. [2018-04-13 01:17:38,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 01:17:38,996 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 175 transitions. [2018-04-13 01:17:38,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-13 01:17:38,996 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:38,996 INFO L355 BasicCegarLoop]: trace histogram [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-13 01:17:38,996 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:38,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1604260488, now seen corresponding path program 1 times [2018-04-13 01:17:38,997 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:39,002 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:39,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:17:39,095 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:17:39,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-13 01:17:39,095 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:39,095 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-13 01:17:39,095 INFO L182 omatonBuilderFactory]: Interpolants [6151#true, 6152#false, 6153#(= 0 |main_#t~malloc0.offset|), 6154#(= main_~head~0.offset 0), 6155#(and (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 6156#(and (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 6157#(and (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))) (= main_~head~0.offset 0)), 6158#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))), 6159#(= 1 |main_#t~mem13|)] [2018-04-13 01:17:39,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:17:39,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 01:17:39,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 01:17:39,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-04-13 01:17:39,096 INFO L87 Difference]: Start difference. First operand 153 states and 175 transitions. Second operand 9 states. [2018-04-13 01:17:39,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:39,314 INFO L93 Difference]: Finished difference Result 240 states and 263 transitions. [2018-04-13 01:17:39,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 01:17:39,315 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-04-13 01:17:39,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:39,315 INFO L225 Difference]: With dead ends: 240 [2018-04-13 01:17:39,316 INFO L226 Difference]: Without dead ends: 240 [2018-04-13 01:17:39,316 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-04-13 01:17:39,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-04-13 01:17:39,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 160. [2018-04-13 01:17:39,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-13 01:17:39,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 184 transitions. [2018-04-13 01:17:39,320 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 184 transitions. Word has length 34 [2018-04-13 01:17:39,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:39,320 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 184 transitions. [2018-04-13 01:17:39,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 01:17:39,320 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 184 transitions. [2018-04-13 01:17:39,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-13 01:17:39,320 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:39,321 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:17:39,321 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:39,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1756971365, now seen corresponding path program 1 times [2018-04-13 01:17:39,322 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:39,330 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:39,407 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-13 01:17:39,407 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:17:39,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-13 01:17:39,407 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:39,408 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-13 01:17:39,408 INFO L182 omatonBuilderFactory]: Interpolants [6576#true, 6577#false, 6578#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 6579#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem7.base|) (= main_~x~0.offset main_~head~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) |main_#t~mem7.offset|) (= main_~x~0.base main_~head~0.base)), 6580#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 6581#(and (= 0 |main_#t~mem10.base|) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~mem10.offset|)), 6582#(and (= 0 main_~y~0.base) (= main_~x~0.offset main_~head~0.offset) (= 0 main_~y~0.offset) (= main_~x~0.base main_~head~0.base)), 6583#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6584#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 6585#(and (= 0 |main_#t~mem15.offset|) (= 0 |main_#t~mem15.base|)), 6586#(and (= 0 main_~x~0.base) (= 0 main_~x~0.offset))] [2018-04-13 01:17:39,408 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-13 01:17:39,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 01:17:39,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 01:17:39,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-13 01:17:39,408 INFO L87 Difference]: Start difference. First operand 160 states and 184 transitions. Second operand 11 states. [2018-04-13 01:17:39,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:39,713 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2018-04-13 01:17:39,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 01:17:39,714 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-04-13 01:17:39,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:39,715 INFO L225 Difference]: With dead ends: 216 [2018-04-13 01:17:39,715 INFO L226 Difference]: Without dead ends: 216 [2018-04-13 01:17:39,715 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2018-04-13 01:17:39,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-04-13 01:17:39,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 168. [2018-04-13 01:17:39,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-13 01:17:39,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 192 transitions. [2018-04-13 01:17:39,718 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 192 transitions. Word has length 35 [2018-04-13 01:17:39,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:39,718 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 192 transitions. [2018-04-13 01:17:39,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 01:17:39,719 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 192 transitions. [2018-04-13 01:17:39,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-13 01:17:39,719 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:39,719 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:17:39,719 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:39,720 INFO L82 PathProgramCache]: Analyzing trace with hash 854380635, now seen corresponding path program 1 times [2018-04-13 01:17:39,721 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:39,728 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:39,756 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-13 01:17:39,757 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:17:39,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 01:17:39,757 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:39,757 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-13 01:17:39,757 INFO L182 omatonBuilderFactory]: Interpolants [6985#true, 6986#false, 6987#(not (= 0 |main_#t~malloc6.base|)), 6988#(not (= 0 main_~x~0.base)), 6989#(not (= 0 main_~head~0.base))] [2018-04-13 01:17:39,757 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-13 01:17:39,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 01:17:39,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 01:17:39,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 01:17:39,758 INFO L87 Difference]: Start difference. First operand 168 states and 192 transitions. Second operand 5 states. [2018-04-13 01:17:39,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:39,845 INFO L93 Difference]: Finished difference Result 219 states and 246 transitions. [2018-04-13 01:17:39,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 01:17:39,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-04-13 01:17:39,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:39,846 INFO L225 Difference]: With dead ends: 219 [2018-04-13 01:17:39,846 INFO L226 Difference]: Without dead ends: 219 [2018-04-13 01:17:39,846 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-13 01:17:39,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-04-13 01:17:39,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 189. [2018-04-13 01:17:39,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-13 01:17:39,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 223 transitions. [2018-04-13 01:17:39,849 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 223 transitions. Word has length 35 [2018-04-13 01:17:39,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:39,850 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 223 transitions. [2018-04-13 01:17:39,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 01:17:39,850 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 223 transitions. [2018-04-13 01:17:39,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-13 01:17:39,850 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:39,850 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:17:39,850 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:39,851 INFO L82 PathProgramCache]: Analyzing trace with hash 290717411, now seen corresponding path program 2 times [2018-04-13 01:17:39,851 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:39,860 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:39,963 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-13 01:17:39,964 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:17:39,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-13 01:17:39,964 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:39,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-13 01:17:39,964 INFO L182 omatonBuilderFactory]: Interpolants [7408#(and (= 0 |main_#t~malloc6.offset|) (= main_~head~0.offset 0)), 7409#(and (= main_~head~0.offset 0) (= 0 main_~x~0.offset)), 7410#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.offset 0) (= 0 main_~x~0.offset)), 7411#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ 0 8))) (= 0 main_~x~0.offset)), 7412#(and (= 0 main_~head~0.offset) (= 1 (select (select |#memory_int| main_~head~0.base) (+ 0 8)))), 7413#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~x~0.offset 0) (= |main_#t~mem13| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))), 7404#true, 7405#false, 7406#(= 0 |main_#t~malloc0.offset|), 7407#(= main_~head~0.offset 0)] [2018-04-13 01:17:39,964 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-13 01:17:39,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 01:17:39,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 01:17:39,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-04-13 01:17:39,965 INFO L87 Difference]: Start difference. First operand 189 states and 223 transitions. Second operand 10 states. [2018-04-13 01:17:40,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:40,194 INFO L93 Difference]: Finished difference Result 204 states and 224 transitions. [2018-04-13 01:17:40,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 01:17:40,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-04-13 01:17:40,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:40,195 INFO L225 Difference]: With dead ends: 204 [2018-04-13 01:17:40,195 INFO L226 Difference]: Without dead ends: 204 [2018-04-13 01:17:40,195 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2018-04-13 01:17:40,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-13 01:17:40,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 175. [2018-04-13 01:17:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-04-13 01:17:40,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 202 transitions. [2018-04-13 01:17:40,197 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 202 transitions. Word has length 35 [2018-04-13 01:17:40,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:40,197 INFO L459 AbstractCegarLoop]: Abstraction has 175 states and 202 transitions. [2018-04-13 01:17:40,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 01:17:40,197 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 202 transitions. [2018-04-13 01:17:40,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-13 01:17:40,197 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:40,198 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] [2018-04-13 01:17:40,198 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:40,198 INFO L82 PathProgramCache]: Analyzing trace with hash 287564991, now seen corresponding path program 1 times [2018-04-13 01:17:40,198 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:40,207 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:40,403 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:17:40,403 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:17:40,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 01:17:40,403 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:40,404 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-13 01:17:40,404 INFO L182 omatonBuilderFactory]: Interpolants [7813#true, 7814#false, 7815#(= 0 |main_#t~malloc0.offset|), 7816#(= 0 main_~head~0.offset), 7817#(and (= 0 main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base))), 7818#(and (= 0 main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 7819#(and (= main_~x~0.offset main_~head~0.offset) (= |main_#t~malloc2.offset| main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~malloc2.base|))), 7820#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~head~0.offset) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 7821#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~mem3.base|)) (= main_~x~0.base main_~head~0.base)), 7822#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 7823#(and (= |main_#t~mem4.offset| main_~head~0.offset) (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 7824#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))), 7825#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base main_~head~0.base))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))), 7826#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 7827#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 7828#(or (and (= |main_#t~mem7.offset| 0) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 7829#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 7830#(= 1 (select |#valid| |main_#t~mem9.base|)), 7831#(= 1 (select |#valid| main_~x~0.base))] [2018-04-13 01:17:40,404 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:17:40,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 01:17:40,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 01:17:40,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-04-13 01:17:40,405 INFO L87 Difference]: Start difference. First operand 175 states and 202 transitions. Second operand 19 states. [2018-04-13 01:17:41,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:41,394 INFO L93 Difference]: Finished difference Result 260 states and 287 transitions. [2018-04-13 01:17:41,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-13 01:17:41,394 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-04-13 01:17:41,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:41,395 INFO L225 Difference]: With dead ends: 260 [2018-04-13 01:17:41,395 INFO L226 Difference]: Without dead ends: 260 [2018-04-13 01:17:41,395 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=508, Invalid=1748, Unknown=0, NotChecked=0, Total=2256 [2018-04-13 01:17:41,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-04-13 01:17:41,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 197. [2018-04-13 01:17:41,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-13 01:17:41,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 229 transitions. [2018-04-13 01:17:41,397 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 229 transitions. Word has length 36 [2018-04-13 01:17:41,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:41,397 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 229 transitions. [2018-04-13 01:17:41,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 01:17:41,398 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 229 transitions. [2018-04-13 01:17:41,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-13 01:17:41,398 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:41,398 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] [2018-04-13 01:17:41,398 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:41,398 INFO L82 PathProgramCache]: Analyzing trace with hash 287564992, now seen corresponding path program 1 times [2018-04-13 01:17:41,399 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:41,408 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:41,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:17:41,584 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:17:41,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 01:17:41,584 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:41,584 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-13 01:17:41,584 INFO L182 omatonBuilderFactory]: Interpolants [8352#(and (= 0 main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 8353#(and (= 0 |main_#t~malloc2.offset|) (= main_~x~0.offset main_~head~0.offset) (= |main_#t~malloc2.offset| main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~malloc2.base|))), 8354#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~head~0.offset) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 8355#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~mem3.base|)) (= main_~x~0.base main_~head~0.base)), 8356#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 8357#(and (= |main_#t~mem4.offset| main_~head~0.offset) (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8358#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))), 8359#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))), 8360#(or (and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 8361#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (<= 12 (select |#length| (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)))), 8362#(or (and (= |main_#t~mem7.offset| 0) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (<= 12 (select |#length| (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)))), 8363#(and (<= 12 (select |#length| (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))), 8364#(and (= 0 |main_#t~mem9.offset|) (<= 12 (select |#length| |main_#t~mem9.base|))), 8365#(and (<= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0)), 8347#true, 8348#false, 8349#(= 0 |main_#t~malloc0.offset|), 8350#(= 0 main_~head~0.offset), 8351#(and (= 0 main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)))] [2018-04-13 01:17:41,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:17:41,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 01:17:41,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 01:17:41,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-04-13 01:17:41,585 INFO L87 Difference]: Start difference. First operand 197 states and 229 transitions. Second operand 19 states. [2018-04-13 01:17:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:42,562 INFO L93 Difference]: Finished difference Result 279 states and 309 transitions. [2018-04-13 01:17:42,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 01:17:42,562 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-04-13 01:17:42,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:42,563 INFO L225 Difference]: With dead ends: 279 [2018-04-13 01:17:42,563 INFO L226 Difference]: Without dead ends: 279 [2018-04-13 01:17:42,563 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=359, Invalid=1201, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 01:17:42,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-04-13 01:17:42,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 214. [2018-04-13 01:17:42,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-04-13 01:17:42,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 250 transitions. [2018-04-13 01:17:42,565 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 250 transitions. Word has length 36 [2018-04-13 01:17:42,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:42,566 INFO L459 AbstractCegarLoop]: Abstraction has 214 states and 250 transitions. [2018-04-13 01:17:42,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 01:17:42,566 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 250 transitions. [2018-04-13 01:17:42,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-13 01:17:42,566 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:42,566 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:17:42,566 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:42,567 INFO L82 PathProgramCache]: Analyzing trace with hash -585558576, now seen corresponding path program 1 times [2018-04-13 01:17:42,567 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:42,575 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:42,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:17:42,673 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:17:42,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 01:17:42,674 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:42,674 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-13 01:17:42,674 INFO L182 omatonBuilderFactory]: Interpolants [8912#(and (= 0 main_~x~0.base) (= 0 main_~x~0.offset)), 8901#true, 8902#false, 8903#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8904#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8905#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8906#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 8907#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 8908#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 8909#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem15.base|) |main_#t~mem15.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) |main_#t~mem15.offset|))), 8910#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 8911#(and (= 0 |main_#t~mem17.base|) (= 0 |main_#t~mem17.offset|))] [2018-04-13 01:17:42,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:17:42,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 01:17:42,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 01:17:42,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-04-13 01:17:42,674 INFO L87 Difference]: Start difference. First operand 214 states and 250 transitions. Second operand 12 states. [2018-04-13 01:17:43,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:43,040 INFO L93 Difference]: Finished difference Result 252 states and 289 transitions. [2018-04-13 01:17:43,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 01:17:43,041 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-04-13 01:17:43,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:43,041 INFO L225 Difference]: With dead ends: 252 [2018-04-13 01:17:43,041 INFO L226 Difference]: Without dead ends: 252 [2018-04-13 01:17:43,041 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2018-04-13 01:17:43,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-04-13 01:17:43,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 234. [2018-04-13 01:17:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-13 01:17:43,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 271 transitions. [2018-04-13 01:17:43,044 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 271 transitions. Word has length 37 [2018-04-13 01:17:43,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:43,044 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 271 transitions. [2018-04-13 01:17:43,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 01:17:43,044 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 271 transitions. [2018-04-13 01:17:43,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-13 01:17:43,044 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:43,044 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:17:43,044 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:43,044 INFO L82 PathProgramCache]: Analyzing trace with hash -58521746, now seen corresponding path program 1 times [2018-04-13 01:17:43,045 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:43,049 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:43,067 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-13 01:17:43,067 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 01:17:43,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 01:17:43,067 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:43,068 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-13 01:17:43,068 INFO L182 omatonBuilderFactory]: Interpolants [9424#(not (= 0 main_~head~0.base)), 9425#(not (= 0 main_~x~0.base)), 9421#true, 9422#false, 9423#(not (= 0 |main_#t~malloc0.base|))] [2018-04-13 01:17:43,068 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-13 01:17:43,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 01:17:43,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 01:17:43,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 01:17:43,069 INFO L87 Difference]: Start difference. First operand 234 states and 271 transitions. Second operand 5 states. [2018-04-13 01:17:43,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:43,159 INFO L93 Difference]: Finished difference Result 255 states and 284 transitions. [2018-04-13 01:17:43,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 01:17:43,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-04-13 01:17:43,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:43,160 INFO L225 Difference]: With dead ends: 255 [2018-04-13 01:17:43,160 INFO L226 Difference]: Without dead ends: 255 [2018-04-13 01:17:43,160 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-13 01:17:43,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-04-13 01:17:43,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 223. [2018-04-13 01:17:43,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-04-13 01:17:43,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 255 transitions. [2018-04-13 01:17:43,164 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 255 transitions. Word has length 39 [2018-04-13 01:17:43,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:43,164 INFO L459 AbstractCegarLoop]: Abstraction has 223 states and 255 transitions. [2018-04-13 01:17:43,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 01:17:43,164 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 255 transitions. [2018-04-13 01:17:43,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-13 01:17:43,164 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:43,165 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:17:43,165 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:43,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1377853024, now seen corresponding path program 1 times [2018-04-13 01:17:43,166 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:43,176 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:43,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:17:43,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:17:43,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 01:17:43,309 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:43,310 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-13 01:17:43,310 INFO L182 omatonBuilderFactory]: Interpolants [9920#(= 1 (select |#valid| main_~y~0.base)), 9908#true, 9909#false, 9910#(= 1 (select |#valid| main_~head~0.base)), 9911#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 9912#(and (= 1 (select |#valid| |main_#t~malloc2.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~malloc2.base|))), 9913#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 9914#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~mem3.base|)) (= main_~x~0.base main_~head~0.base)), 9915#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem4.base|))), 9916#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 9917#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 9918#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 9919#(= 1 (select |#valid| |main_#t~mem10.base|))] [2018-04-13 01:17:43,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:17:43,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 01:17:43,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 01:17:43,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-04-13 01:17:43,310 INFO L87 Difference]: Start difference. First operand 223 states and 255 transitions. Second operand 13 states. [2018-04-13 01:17:43,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:43,907 INFO L93 Difference]: Finished difference Result 369 states and 407 transitions. [2018-04-13 01:17:43,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 01:17:43,907 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-04-13 01:17:43,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:43,908 INFO L225 Difference]: With dead ends: 369 [2018-04-13 01:17:43,908 INFO L226 Difference]: Without dead ends: 369 [2018-04-13 01:17:43,908 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2018-04-13 01:17:43,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-04-13 01:17:43,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 230. [2018-04-13 01:17:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-13 01:17:43,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 263 transitions. [2018-04-13 01:17:43,911 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 263 transitions. Word has length 40 [2018-04-13 01:17:43,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:43,911 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 263 transitions. [2018-04-13 01:17:43,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 01:17:43,911 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 263 transitions. [2018-04-13 01:17:43,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-13 01:17:43,912 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:43,912 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:17:43,912 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:43,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1377853023, now seen corresponding path program 1 times [2018-04-13 01:17:43,912 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:43,920 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:44,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:17:44,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:17:44,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 01:17:44,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:44,205 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-13 01:17:44,205 INFO L182 omatonBuilderFactory]: Interpolants [10560#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~mem3.base|)) (= main_~x~0.base main_~head~0.base)), 10561#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 10562#(and (= |main_#t~mem4.offset| main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem4.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10563#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))), 10564#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))), 10565#(or (and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 10566#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 10567#(or (and (= |main_#t~mem7.offset| 0) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 10568#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 10569#(and (= (select |#valid| |main_#t~mem10.base|) 1) (<= 12 (select |#length| |main_#t~mem10.base|)) (= 0 |main_#t~mem10.offset|)), 10570#(and (= main_~y~0.offset 0) (= (select |#valid| main_~y~0.base) 1) (<= 12 (select |#length| main_~y~0.base))), 10571#(and (= main_~y~0.offset 0) (<= 12 (select |#length| main_~y~0.base))), 10552#true, 10553#false, 10554#(= 0 |main_#t~malloc0.offset|), 10555#(= 0 main_~head~0.offset), 10556#(and (= 0 main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base))), 10557#(and (= 0 main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 10558#(and (= 0 |main_#t~malloc2.offset|) (= main_~x~0.offset main_~head~0.offset) (= |main_#t~malloc2.offset| main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~malloc2.base|))), 10559#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~head~0.offset) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base))] [2018-04-13 01:17:44,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:17:44,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 01:17:44,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 01:17:44,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-04-13 01:17:44,205 INFO L87 Difference]: Start difference. First operand 230 states and 263 transitions. Second operand 20 states. [2018-04-13 01:17:45,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:45,311 INFO L93 Difference]: Finished difference Result 326 states and 361 transitions. [2018-04-13 01:17:45,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-13 01:17:45,311 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-04-13 01:17:45,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:45,312 INFO L225 Difference]: With dead ends: 326 [2018-04-13 01:17:45,312 INFO L226 Difference]: Without dead ends: 326 [2018-04-13 01:17:45,312 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=420, Invalid=1472, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 01:17:45,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-04-13 01:17:45,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 233. [2018-04-13 01:17:45,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-13 01:17:45,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 265 transitions. [2018-04-13 01:17:45,315 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 265 transitions. Word has length 40 [2018-04-13 01:17:45,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:45,315 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 265 transitions. [2018-04-13 01:17:45,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 01:17:45,315 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 265 transitions. [2018-04-13 01:17:45,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-13 01:17:45,316 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:45,316 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:17:45,316 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:45,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1591944237, now seen corresponding path program 1 times [2018-04-13 01:17:45,316 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:45,320 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:45,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:17:45,370 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:17:45,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-13 01:17:45,370 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:45,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-13 01:17:45,370 INFO L182 omatonBuilderFactory]: Interpolants [11184#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 11185#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 11186#(and (= 0 |main_#t~mem18.base|) (= 0 |main_#t~mem18.offset|)), 11187#(and (= 0 main_~x~0.base) (= 0 main_~x~0.offset)), 11179#true, 11180#false, 11181#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 11182#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem15.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem15.base|)), 11183#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~x~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base))] [2018-04-13 01:17:45,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:17:45,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 01:17:45,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 01:17:45,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-04-13 01:17:45,371 INFO L87 Difference]: Start difference. First operand 233 states and 265 transitions. Second operand 9 states. [2018-04-13 01:17:45,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:45,585 INFO L93 Difference]: Finished difference Result 268 states and 297 transitions. [2018-04-13 01:17:45,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 01:17:45,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-04-13 01:17:45,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:45,586 INFO L225 Difference]: With dead ends: 268 [2018-04-13 01:17:45,586 INFO L226 Difference]: Without dead ends: 268 [2018-04-13 01:17:45,586 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-04-13 01:17:45,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-04-13 01:17:45,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 248. [2018-04-13 01:17:45,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-13 01:17:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 281 transitions. [2018-04-13 01:17:45,589 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 281 transitions. Word has length 41 [2018-04-13 01:17:45,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:45,589 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 281 transitions. [2018-04-13 01:17:45,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 01:17:45,589 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 281 transitions. [2018-04-13 01:17:45,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-13 01:17:45,589 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:45,589 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:17:45,589 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:45,589 INFO L82 PathProgramCache]: Analyzing trace with hash -2105632456, now seen corresponding path program 1 times [2018-04-13 01:17:45,590 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:45,594 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:17:45,629 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:17:45,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-13 01:17:45,629 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:45,630 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-13 01:17:45,630 INFO L182 omatonBuilderFactory]: Interpolants [11713#true, 11714#false, 11715#(not (= 0 |main_#t~malloc0.base|)), 11716#(not (= 0 main_~head~0.base)), 11717#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 11718#(not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 11719#(not (= 0 |main_#t~mem18.base|)), 11720#(not (= 0 main_~x~0.base))] [2018-04-13 01:17:45,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:17:45,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 01:17:45,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 01:17:45,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-13 01:17:45,631 INFO L87 Difference]: Start difference. First operand 248 states and 281 transitions. Second operand 8 states. [2018-04-13 01:17:45,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:45,857 INFO L93 Difference]: Finished difference Result 296 states and 326 transitions. [2018-04-13 01:17:45,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 01:17:45,858 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-04-13 01:17:45,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:45,859 INFO L225 Difference]: With dead ends: 296 [2018-04-13 01:17:45,859 INFO L226 Difference]: Without dead ends: 286 [2018-04-13 01:17:45,859 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-04-13 01:17:45,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-04-13 01:17:45,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 264. [2018-04-13 01:17:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-04-13 01:17:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 299 transitions. [2018-04-13 01:17:45,863 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 299 transitions. Word has length 42 [2018-04-13 01:17:45,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:45,863 INFO L459 AbstractCegarLoop]: Abstraction has 264 states and 299 transitions. [2018-04-13 01:17:45,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 01:17:45,864 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 299 transitions. [2018-04-13 01:17:45,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-13 01:17:45,864 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:45,864 INFO L355 BasicCegarLoop]: trace histogram [3, 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] [2018-04-13 01:17:45,864 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:45,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1176462409, now seen corresponding path program 2 times [2018-04-13 01:17:45,865 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 01:17:45,874 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 01:17:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:17:46,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 01:17:46,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 01:17:46,129 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 01:17:46,130 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-13 01:17:46,130 INFO L182 omatonBuilderFactory]: Interpolants [12295#true, 12296#false, 12297#(= 0 |main_#t~malloc0.offset|), 12298#(= 0 main_~head~0.offset), 12299#(and (= 0 main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base))), 12300#(and (= 0 main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 12301#(and (= main_~x~0.offset main_~head~0.offset) (= |main_#t~malloc2.offset| main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~malloc2.base|))), 12302#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~head~0.offset) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 12303#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~mem3.base|)) (= main_~x~0.base main_~head~0.base)), 12304#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 12305#(and (= |main_#t~mem4.offset| main_~head~0.offset) (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem4.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12306#(or (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)) (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)))), 12307#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 12308#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 12309#(or (and (= |main_#t~mem7.offset| 0) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 12310#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 12311#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem9.base|) |main_#t~mem9.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem9.base|) |main_#t~mem9.offset|))), 12312#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 12313#(and (= |main_#t~mem7.offset| 0) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))] [2018-04-13 01:17:46,130 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 01:17:46,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 01:17:46,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 01:17:46,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2018-04-13 01:17:46,130 INFO L87 Difference]: Start difference. First operand 264 states and 299 transitions. Second operand 19 states. [2018-04-13 01:17:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 01:17:46,864 INFO L93 Difference]: Finished difference Result 279 states and 303 transitions. [2018-04-13 01:17:46,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 01:17:46,864 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2018-04-13 01:17:46,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 01:17:46,865 INFO L225 Difference]: With dead ends: 279 [2018-04-13 01:17:46,865 INFO L226 Difference]: Without dead ends: 279 [2018-04-13 01:17:46,865 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=281, Invalid=1051, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 01:17:46,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-04-13 01:17:46,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 254. [2018-04-13 01:17:46,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-04-13 01:17:46,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 284 transitions. [2018-04-13 01:17:46,868 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 284 transitions. Word has length 42 [2018-04-13 01:17:46,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 01:17:46,868 INFO L459 AbstractCegarLoop]: Abstraction has 254 states and 284 transitions. [2018-04-13 01:17:46,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 01:17:46,868 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 284 transitions. [2018-04-13 01:17:46,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-13 01:17:46,869 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 01:17:46,869 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 01:17:46,869 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 01:17:46,869 INFO L82 PathProgramCache]: Analyzing trace with hash -92088635, now seen corresponding path program 1 times [2018-04-13 01:17:46,870 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 01:17:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-13 01:17:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-13 01:17:46,907 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-13 01:17:46,921 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-04-13 01:17:46,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 01:17:46 BoogieIcfgContainer [2018-04-13 01:17:46,935 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 01:17:46,936 INFO L168 Benchmark]: Toolchain (without parser) took 13412.95 ms. Allocated memory was 407.9 MB in the beginning and 850.9 MB in the end (delta: 443.0 MB). Free memory was 343.6 MB in the beginning and 525.0 MB in the end (delta: -181.4 MB). Peak memory consumption was 261.6 MB. Max. memory is 5.3 GB. [2018-04-13 01:17:46,937 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 407.9 MB. Free memory is still 370.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 01:17:46,937 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.23 ms. Allocated memory is still 407.9 MB. Free memory was 343.6 MB in the beginning and 315.7 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. [2018-04-13 01:17:46,937 INFO L168 Benchmark]: Boogie Preprocessor took 42.97 ms. Allocated memory is still 407.9 MB. Free memory was 315.7 MB in the beginning and 313.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-13 01:17:46,938 INFO L168 Benchmark]: RCFGBuilder took 476.03 ms. Allocated memory was 407.9 MB in the beginning and 617.1 MB in the end (delta: 209.2 MB). Free memory was 313.1 MB in the beginning and 536.2 MB in the end (delta: -223.1 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-13 01:17:46,938 INFO L168 Benchmark]: TraceAbstraction took 12614.43 ms. Allocated memory was 617.1 MB in the beginning and 850.9 MB in the end (delta: 233.8 MB). Free memory was 536.2 MB in the beginning and 525.0 MB in the end (delta: 11.2 MB). Peak memory consumption was 245.0 MB. Max. memory is 5.3 GB. [2018-04-13 01:17:46,940 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.17 ms. Allocated memory is still 407.9 MB. Free memory is still 370.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 276.23 ms. Allocated memory is still 407.9 MB. Free memory was 343.6 MB in the beginning and 315.7 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.97 ms. Allocated memory is still 407.9 MB. Free memory was 315.7 MB in the beginning and 313.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 476.03 ms. Allocated memory was 407.9 MB in the beginning and 617.1 MB in the end (delta: 209.2 MB). Free memory was 313.1 MB in the beginning and 536.2 MB in the end (delta: -223.1 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 12614.43 ms. Allocated memory was 617.1 MB in the beginning and 850.9 MB in the end (delta: 233.8 MB). Free memory was 536.2 MB in the beginning and 525.0 MB in the end (delta: 11.2 MB). Peak memory consumption was 245.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 986]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L989] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={14:0}] [L989] SLL* head = malloc(sizeof(SLL)); VAL [head={14:0}, malloc(sizeof(SLL))={14:0}] [L990] FCALL head->next = ((void*)0) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}] [L991] FCALL head->prev = ((void*)0) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}] [L992] FCALL head->data = 0 VAL [head={14:0}, malloc(sizeof(SLL))={14:0}] [L994] SLL* x = head; VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, x={14:0}] [L997] COND FALSE !(__VERIFIER_nondet_int()) [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1018] x = head VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, x={14:0}] [L1019] EXPR, FCALL x->next VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, x={14:0}, x->next={0:0}] [L1019] COND FALSE !(x->next != ((void*)0)) [L1026] EXPR, FCALL x->next VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, x={14:0}, x->next={0:0}] [L1026] SLL* y = x->next; [L1027] EXPR, FCALL malloc(sizeof(SLL)) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={14:0}, y={0:0}] [L1027] FCALL x->next = malloc(sizeof(SLL)) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={14:0}, y={0:0}] [L1028] FCALL x->data = 1 VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={14:0}, y={0:0}] [L1029] FCALL x->next = y VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={14:0}, y={0:0}] [L1030] COND FALSE !(y != ((void*)0)) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={14:0}, y={0:0}] [L1038] x = head VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={14:0}, y={0:0}] [L1041] EXPR, FCALL x->data VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={14:0}, x->data=1, y={0:0}] [L1041] COND FALSE !(x->data != 1) [L1047] EXPR, FCALL x->next VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={14:0}, x->next={0:0}, y={0:0}] [L1047] x = x->next [L1048] COND FALSE !(\read(*x)) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1056] x = head VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={14:0}, y={0:0}] [L1057] COND TRUE x != ((void*)0) [L1059] head = x VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={14:0}, y={0:0}] [L1060] EXPR, FCALL x->next VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={14:0}, x->next={0:0}, y={0:0}] [L1060] x = x->next [L1061] free(head) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1061] free(head) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1061] FCALL free(head) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1057] COND FALSE !(x != ((void*)0)) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1064] return 0; VAL [\result=0, head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 135 locations, 57 error locations. UNSAFE Result, 12.5s OverallTime, 31 OverallIterations, 3 TraceHistogramMax, 9.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2419 SDtfs, 8382 SDslu, 7624 SDs, 0 SdLazy, 12257 SolverSat, 1423 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 517 GetRequests, 67 SyntacticMatches, 19 SemanticMatches, 431 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1936 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=264occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 25/54 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 1440 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 902 NumberOfCodeBlocks, 902 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 826 ConstructedInterpolants, 0 QuantifiedInterpolants, 224713 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 20 PerfectInterpolantSequences, 25/54 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_01-17-46-947.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_01-17-46-947.csv Received shutdown request...