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/memsafety-ext/tree_of_cslls_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 13:22:26,354 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 13:22:26,356 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 13:22:26,369 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 13:22:26,369 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 13:22:26,370 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 13:22:26,371 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 13:22:26,373 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 13:22:26,374 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 13:22:26,375 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 13:22:26,376 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 13:22:26,376 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 13:22:26,377 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 13:22:26,378 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 13:22:26,379 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 13:22:26,380 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 13:22:26,382 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 13:22:26,383 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 13:22:26,384 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 13:22:26,385 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 13:22:26,387 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 13:22:26,387 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 13:22:26,387 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 13:22:26,388 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 13:22:26,389 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 13:22:26,390 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 13:22:26,390 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 13:22:26,391 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 13:22:26,391 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 13:22:26,392 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 13:22:26,392 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 13:22:26,392 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-11 13:22:26,412 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 13:22:26,412 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 13:22:26,413 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 13:22:26,414 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 13:22:26,414 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 13:22:26,414 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 13:22:26,414 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 13:22:26,414 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 13:22:26,415 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 13:22:26,415 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 13:22:26,415 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 13:22:26,415 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 13:22:26,415 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 13:22:26,415 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 13:22:26,416 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 13:22:26,416 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 13:22:26,416 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 13:22:26,416 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 13:22:26,416 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 13:22:26,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 13:22:26,417 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 13:22:26,417 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-11 13:22:26,448 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 13:22:26,461 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 13:22:26,464 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 13:22:26,466 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 13:22:26,466 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 13:22:26,467 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,747 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1b087e1e5 [2018-04-11 13:22:26,921 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 13:22:26,921 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 13:22:26,922 INFO L168 CDTParser]: Scanning tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,929 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 13:22:26,929 INFO L215 ultiparseSymbolTable]: [2018-04-11 13:22:26,929 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 13:22:26,929 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,929 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 13:22:26,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fsfilcnt64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ino_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__int32_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_int64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__TreeNode in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__gid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__off_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__fsfilcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____blkcnt64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ldiv_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____int8_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____ssize_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__timer_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____socklen_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__register_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____nlink_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_mutex_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__key_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____rlim_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fsblkcnt64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____swblk_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____int32_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____time_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__int8_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____suseconds_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__fsblkcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____timer_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_int in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____rlim64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fsfilcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_mutexattr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____uint32_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__wchar_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_condattr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__fd_set in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____clockid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_attr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____caddr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__quad_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____dev_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__mode_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__lldiv_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__uid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__int16_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__suseconds_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____sigset_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____u_short in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__size_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_int16_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ulong in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_cond_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_once_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____intptr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__div_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____u_long in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__blksize_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_spinlock_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_short in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__caddr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____mode_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____ino_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__clock_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__daddr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fsid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____int16_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_rwlockattr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_long in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_char in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_barrier_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____off_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__blkcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ListNode in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____pthread_list_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_barrierattr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____loff_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__int64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____WAIT_STATUS in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_int32_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__fsid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ushort in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_quad_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____u_quad_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____clock_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____u_char in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____uint8_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____blksize_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____gid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____off64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____quad_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____pid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____uint16_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____qaddr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____daddr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__loff_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__id_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__uint in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_int8_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_rwlock_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____u_int in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____useconds_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__dev_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__nlink_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fd_mask in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____id_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____key_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____int64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__time_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__clockid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_key_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,938 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fsblkcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,938 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____sig_atomic_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,938 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__fd_mask in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,938 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____uint64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,938 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____blkcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,938 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____uid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,938 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ssize_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,938 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____ino64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,938 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__sigset_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:26,950 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1b087e1e5 [2018-04-11 13:22:26,953 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 13:22:26,954 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 13:22:26,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 13:22:26,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 13:22:26,958 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 13:22:26,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 01:22:26" (1/1) ... [2018-04-11 13:22:26,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@783d9c7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:22:26, skipping insertion in model container [2018-04-11 13:22:26,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 01:22:26" (1/1) ... [2018-04-11 13:22:26,971 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 13:22:26,994 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 13:22:27,140 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 13:22:27,183 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 13:22:27,188 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 110 non ball SCCs. Number of states in SCCs 110. [2018-04-11 13:22:27,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:22:27 WrapperNode [2018-04-11 13:22:27,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 13:22:27,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 13:22:27,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 13:22:27,229 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 13:22:27,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:22:27" (1/1) ... [2018-04-11 13:22:27,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:22:27" (1/1) ... [2018-04-11 13:22:27,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:22:27" (1/1) ... [2018-04-11 13:22:27,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:22:27" (1/1) ... [2018-04-11 13:22:27,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:22:27" (1/1) ... [2018-04-11 13:22:27,267 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:22:27" (1/1) ... [2018-04-11 13:22:27,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:22:27" (1/1) ... [2018-04-11 13:22:27,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 13:22:27,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 13:22:27,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 13:22:27,274 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 13:22:27,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:22:27" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 13:22:27,375 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 13:22:27,375 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 13:22:27,376 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 13:22:27,376 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 13:22:27,376 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 13:22:27,376 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 13:22:27,376 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 13:22:27,376 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 13:22:27,376 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 13:22:27,376 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 13:22:27,376 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 13:22:27,376 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 13:22:27,376 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 13:22:27,376 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 13:22:27,376 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 13:22:27,376 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 13:22:27,377 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 13:22:27,377 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 13:22:27,377 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 13:22:27,377 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 13:22:27,377 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 13:22:27,377 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 13:22:27,377 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 13:22:27,377 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 13:22:27,377 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 13:22:27,378 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 13:22:27,378 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 13:22:27,378 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 13:22:27,378 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 13:22:27,378 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 13:22:27,378 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 13:22:27,378 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 13:22:27,378 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 13:22:27,378 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 13:22:27,379 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 13:22:27,379 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 13:22:27,379 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 13:22:27,379 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 13:22:27,379 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 13:22:27,379 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 13:22:27,379 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 13:22:27,379 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 13:22:27,379 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 13:22:27,380 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 13:22:27,380 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 13:22:27,380 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 13:22:27,380 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 13:22:27,380 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 13:22:27,380 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 13:22:27,380 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 13:22:27,380 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 13:22:27,380 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 13:22:27,381 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 13:22:27,381 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 13:22:27,381 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 13:22:27,381 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 13:22:27,381 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 13:22:27,381 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 13:22:27,381 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 13:22:27,381 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 13:22:27,381 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 13:22:27,381 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 13:22:27,382 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 13:22:27,382 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 13:22:27,382 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 13:22:27,382 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 13:22:27,382 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 13:22:27,382 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 13:22:27,382 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 13:22:27,382 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 13:22:27,382 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 13:22:27,382 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 13:22:27,383 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 13:22:27,383 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 13:22:27,383 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 13:22:27,383 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 13:22:27,383 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 13:22:27,383 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 13:22:27,383 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 13:22:27,383 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 13:22:27,383 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 13:22:27,383 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 13:22:27,384 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 13:22:27,384 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 13:22:27,384 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 13:22:27,384 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 13:22:27,384 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 13:22:27,384 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 13:22:27,384 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 13:22:27,384 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 13:22:27,384 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 13:22:27,384 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 13:22:27,385 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 13:22:27,385 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 13:22:27,385 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 13:22:27,385 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 13:22:27,385 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 13:22:27,385 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 13:22:27,385 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 13:22:27,385 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 13:22:27,385 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 13:22:27,385 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 13:22:27,386 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 13:22:27,386 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 13:22:27,386 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 13:22:27,386 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 13:22:27,386 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 13:22:27,386 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 13:22:27,386 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 13:22:27,386 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 13:22:27,386 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 13:22:27,386 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 13:22:27,386 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 13:22:27,927 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 13:22:27,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 01:22:27 BoogieIcfgContainer [2018-04-11 13:22:27,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 13:22:27,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 13:22:27,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 13:22:27,930 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 13:22:27,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 01:22:26" (1/3) ... [2018-04-11 13:22:27,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19746632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 01:22:27, skipping insertion in model container [2018-04-11 13:22:27,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 01:22:27" (2/3) ... [2018-04-11 13:22:27,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19746632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 01:22:27, skipping insertion in model container [2018-04-11 13:22:27,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 01:22:27" (3/3) ... [2018-04-11 13:22:27,932 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_of_cslls_true-valid-memsafety.i [2018-04-11 13:22:27,938 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-11 13:22:27,943 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 101 error locations. [2018-04-11 13:22:27,966 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 13:22:27,966 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 13:22:27,967 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 13:22:27,967 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-11 13:22:27,967 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-11 13:22:27,967 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 13:22:27,967 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 13:22:27,967 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 13:22:27,967 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 13:22:27,967 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 13:22:27,980 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states. [2018-04-11 13:22:27,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 13:22:27,987 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:27,987 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:27,987 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:27,990 INFO L82 PathProgramCache]: Analyzing trace with hash 268960233, now seen corresponding path program 1 times [2018-04-11 13:22:28,024 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:28,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:28,104 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:28,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:22:28,105 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:28,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:28,106 INFO L182 omatonBuilderFactory]: Interpolants [229#true, 230#false, 231#(= 1 (select |#valid| |main_#t~malloc0.base|)), 232#(= 1 (select |#valid| main_~tree~0.base))] [2018-04-11 13:22:28,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:28,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:22:28,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:22:28,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:22:28,123 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 4 states. [2018-04-11 13:22:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:28,468 INFO L93 Difference]: Finished difference Result 339 states and 363 transitions. [2018-04-11 13:22:28,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 13:22:28,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 13:22:28,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:28,481 INFO L225 Difference]: With dead ends: 339 [2018-04-11 13:22:28,481 INFO L226 Difference]: Without dead ends: 335 [2018-04-11 13:22:28,482 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:22:28,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-04-11 13:22:28,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 214. [2018-04-11 13:22:28,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-04-11 13:22:28,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 230 transitions. [2018-04-11 13:22:28,519 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 230 transitions. Word has length 8 [2018-04-11 13:22:28,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:28,519 INFO L459 AbstractCegarLoop]: Abstraction has 214 states and 230 transitions. [2018-04-11 13:22:28,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:22:28,520 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 230 transitions. [2018-04-11 13:22:28,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 13:22:28,520 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:28,520 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:28,520 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:28,521 INFO L82 PathProgramCache]: Analyzing trace with hash 268960234, now seen corresponding path program 1 times [2018-04-11 13:22:28,521 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:28,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:28,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:28,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:28,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:22:28,574 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:28,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:28,575 INFO L182 omatonBuilderFactory]: Interpolants [788#true, 789#false, 790#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 791#(and (= main_~tree~0.offset 0) (= 12 (select |#length| main_~tree~0.base)))] [2018-04-11 13:22:28,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:28,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:22:28,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:22:28,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:22:28,576 INFO L87 Difference]: Start difference. First operand 214 states and 230 transitions. Second operand 4 states. [2018-04-11 13:22:28,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:28,720 INFO L93 Difference]: Finished difference Result 212 states and 228 transitions. [2018-04-11 13:22:28,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 13:22:28,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 13:22:28,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:28,721 INFO L225 Difference]: With dead ends: 212 [2018-04-11 13:22:28,721 INFO L226 Difference]: Without dead ends: 212 [2018-04-11 13:22:28,721 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:22:28,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-11 13:22:28,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-04-11 13:22:28,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-04-11 13:22:28,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 228 transitions. [2018-04-11 13:22:28,728 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 228 transitions. Word has length 8 [2018-04-11 13:22:28,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:28,728 INFO L459 AbstractCegarLoop]: Abstraction has 212 states and 228 transitions. [2018-04-11 13:22:28,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:22:28,728 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 228 transitions. [2018-04-11 13:22:28,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-11 13:22:28,729 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:28,729 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:28,729 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:28,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1814695774, now seen corresponding path program 1 times [2018-04-11 13:22:28,729 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:28,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:28,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:28,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 13:22:28,789 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:28,789 INFO L182 omatonBuilderFactory]: Interpolants [1218#true, 1219#false, 1220#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 1221#(and (= main_~tree~0.offset 0) (= 12 (select |#length| main_~tree~0.base))), 1222#(and (= main_~tree~0.offset 0) (= 12 (select |#length| main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1))] [2018-04-11 13:22:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:28,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:22:28,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:22:28,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:22:28,790 INFO L87 Difference]: Start difference. First operand 212 states and 228 transitions. Second operand 5 states. [2018-04-11 13:22:29,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:29,132 INFO L93 Difference]: Finished difference Result 371 states and 399 transitions. [2018-04-11 13:22:29,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 13:22:29,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-04-11 13:22:29,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:29,134 INFO L225 Difference]: With dead ends: 371 [2018-04-11 13:22:29,134 INFO L226 Difference]: Without dead ends: 371 [2018-04-11 13:22:29,135 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:22:29,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-04-11 13:22:29,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 205. [2018-04-11 13:22:29,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-11 13:22:29,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 221 transitions. [2018-04-11 13:22:29,143 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 221 transitions. Word has length 11 [2018-04-11 13:22:29,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:29,144 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 221 transitions. [2018-04-11 13:22:29,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:22:29,144 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 221 transitions. [2018-04-11 13:22:29,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 13:22:29,144 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:29,144 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:29,147 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:29,147 INFO L82 PathProgramCache]: Analyzing trace with hash -848494062, now seen corresponding path program 1 times [2018-04-11 13:22:29,148 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:29,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:29,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:29,201 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:29,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 13:22:29,201 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:29,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:29,202 INFO L182 omatonBuilderFactory]: Interpolants [1803#true, 1804#false, 1805#(= 1 (select |#valid| |main_#t~malloc1.base|)), 1806#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 1807#(= 1 (select |#valid| |main_#t~mem2.base|))] [2018-04-11 13:22:29,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:29,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:22:29,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:22:29,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:22:29,202 INFO L87 Difference]: Start difference. First operand 205 states and 221 transitions. Second operand 5 states. [2018-04-11 13:22:29,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:29,433 INFO L93 Difference]: Finished difference Result 284 states and 306 transitions. [2018-04-11 13:22:29,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 13:22:29,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-11 13:22:29,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:29,434 INFO L225 Difference]: With dead ends: 284 [2018-04-11 13:22:29,434 INFO L226 Difference]: Without dead ends: 284 [2018-04-11 13:22:29,434 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-11 13:22:29,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-04-11 13:22:29,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 204. [2018-04-11 13:22:29,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-04-11 13:22:29,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 220 transitions. [2018-04-11 13:22:29,437 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 220 transitions. Word has length 14 [2018-04-11 13:22:29,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:29,438 INFO L459 AbstractCegarLoop]: Abstraction has 204 states and 220 transitions. [2018-04-11 13:22:29,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:22:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 220 transitions. [2018-04-11 13:22:29,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 13:22:29,438 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:29,438 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:29,438 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:29,438 INFO L82 PathProgramCache]: Analyzing trace with hash -848494061, now seen corresponding path program 1 times [2018-04-11 13:22:29,439 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:29,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:29,494 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:29,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 13:22:29,494 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:29,494 INFO L182 omatonBuilderFactory]: Interpolants [2304#(and (= 4 (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 2305#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 2306#(and (= |main_#t~mem2.offset| 0) (= 4 (select |#length| |main_#t~mem2.base|))), 2302#true, 2303#false] [2018-04-11 13:22:29,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:29,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:22:29,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:22:29,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:22:29,495 INFO L87 Difference]: Start difference. First operand 204 states and 220 transitions. Second operand 5 states. [2018-04-11 13:22:29,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:29,715 INFO L93 Difference]: Finished difference Result 327 states and 357 transitions. [2018-04-11 13:22:29,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 13:22:29,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-11 13:22:29,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:29,716 INFO L225 Difference]: With dead ends: 327 [2018-04-11 13:22:29,716 INFO L226 Difference]: Without dead ends: 327 [2018-04-11 13:22:29,717 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-11 13:22:29,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-04-11 13:22:29,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 203. [2018-04-11 13:22:29,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-11 13:22:29,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 219 transitions. [2018-04-11 13:22:29,722 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 219 transitions. Word has length 14 [2018-04-11 13:22:29,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:29,722 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 219 transitions. [2018-04-11 13:22:29,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:22:29,722 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 219 transitions. [2018-04-11 13:22:29,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 13:22:29,723 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:29,723 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:29,723 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:29,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1899641121, now seen corresponding path program 1 times [2018-04-11 13:22:29,724 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:29,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:29,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:29,818 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:29,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 13:22:29,818 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:29,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:29,819 INFO L182 omatonBuilderFactory]: Interpolants [2848#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 2849#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 2850#(= 1 (select |#valid| |main_#t~mem6.base|)), 2843#true, 2844#false, 2845#(= (select |#valid| main_~tree~0.base) 1), 2846#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 1 (select |#valid| |main_#t~malloc1.base|))), 2847#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))] [2018-04-11 13:22:29,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:29,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 13:22:29,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 13:22:29,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:22:29,820 INFO L87 Difference]: Start difference. First operand 203 states and 219 transitions. Second operand 8 states. [2018-04-11 13:22:30,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:30,290 INFO L93 Difference]: Finished difference Result 379 states and 415 transitions. [2018-04-11 13:22:30,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 13:22:30,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-04-11 13:22:30,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:30,292 INFO L225 Difference]: With dead ends: 379 [2018-04-11 13:22:30,292 INFO L226 Difference]: Without dead ends: 379 [2018-04-11 13:22:30,292 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-11 13:22:30,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-04-11 13:22:30,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 210. [2018-04-11 13:22:30,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-11 13:22:30,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 228 transitions. [2018-04-11 13:22:30,297 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 228 transitions. Word has length 22 [2018-04-11 13:22:30,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:30,298 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 228 transitions. [2018-04-11 13:22:30,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 13:22:30,298 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 228 transitions. [2018-04-11 13:22:30,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 13:22:30,298 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:30,298 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:30,298 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:30,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1899641120, now seen corresponding path program 1 times [2018-04-11 13:22:30,299 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:30,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:30,419 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:30,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 13:22:30,419 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:30,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:30,419 INFO L182 omatonBuilderFactory]: Interpolants [3456#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 3457#(and (= |main_#t~mem6.offset| 0) (= 4 (select |#length| |main_#t~mem6.base|))), 3450#true, 3451#false, 3452#(= (select |#valid| main_~tree~0.base) 1), 3453#(and (= 4 (select |#length| |main_#t~malloc1.base|)) (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 3454#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 3455#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))] [2018-04-11 13:22:30,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:30,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 13:22:30,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 13:22:30,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:22:30,420 INFO L87 Difference]: Start difference. First operand 210 states and 228 transitions. Second operand 8 states. [2018-04-11 13:22:30,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:30,906 INFO L93 Difference]: Finished difference Result 575 states and 631 transitions. [2018-04-11 13:22:30,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 13:22:30,906 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-04-11 13:22:30,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:30,908 INFO L225 Difference]: With dead ends: 575 [2018-04-11 13:22:30,908 INFO L226 Difference]: Without dead ends: 575 [2018-04-11 13:22:30,908 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-11 13:22:30,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-04-11 13:22:30,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 210. [2018-04-11 13:22:30,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-11 13:22:30,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 227 transitions. [2018-04-11 13:22:30,911 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 227 transitions. Word has length 22 [2018-04-11 13:22:30,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:30,911 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 227 transitions. [2018-04-11 13:22:30,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 13:22:30,912 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 227 transitions. [2018-04-11 13:22:30,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 13:22:30,912 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:30,912 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:30,912 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:30,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1206347211, now seen corresponding path program 1 times [2018-04-11 13:22:30,915 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:30,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:30,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:30,942 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:30,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:22:30,942 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:30,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:30,943 INFO L182 omatonBuilderFactory]: Interpolants [4256#(= 1 (select |#valid| main_~tmp~0.base)), 4253#true, 4254#false, 4255#(= 1 (select |#valid| main_~tree~0.base))] [2018-04-11 13:22:30,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:30,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:22:30,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:22:30,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:22:30,943 INFO L87 Difference]: Start difference. First operand 210 states and 227 transitions. Second operand 4 states. [2018-04-11 13:22:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:31,064 INFO L93 Difference]: Finished difference Result 283 states and 307 transitions. [2018-04-11 13:22:31,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:22:31,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-04-11 13:22:31,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:31,066 INFO L225 Difference]: With dead ends: 283 [2018-04-11 13:22:31,066 INFO L226 Difference]: Without dead ends: 283 [2018-04-11 13:22:31,066 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:22:31,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-04-11 13:22:31,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 203. [2018-04-11 13:22:31,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-11 13:22:31,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 224 transitions. [2018-04-11 13:22:31,071 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 224 transitions. Word has length 23 [2018-04-11 13:22:31,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:31,071 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 224 transitions. [2018-04-11 13:22:31,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:22:31,071 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 224 transitions. [2018-04-11 13:22:31,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 13:22:31,072 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:31,072 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:31,072 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:31,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1206347212, now seen corresponding path program 1 times [2018-04-11 13:22:31,073 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:31,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:31,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:31,129 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:31,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 13:22:31,129 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:31,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:31,129 INFO L182 omatonBuilderFactory]: Interpolants [4745#true, 4746#false, 4747#(= 0 |main_#t~malloc0.offset|), 4748#(= 0 main_~tree~0.offset), 4749#(and (= 0 main_~tree~0.offset) (<= (+ main_~tree~0.offset 12) (select |#length| main_~tree~0.base))), 4750#(and (<= 12 (select |#length| main_~tmp~0.base)) (= main_~tmp~0.offset 0))] [2018-04-11 13:22:31,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:31,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 13:22:31,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 13:22:31,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 13:22:31,129 INFO L87 Difference]: Start difference. First operand 203 states and 224 transitions. Second operand 6 states. [2018-04-11 13:22:31,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:31,380 INFO L93 Difference]: Finished difference Result 488 states and 542 transitions. [2018-04-11 13:22:31,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 13:22:31,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-04-11 13:22:31,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:31,382 INFO L225 Difference]: With dead ends: 488 [2018-04-11 13:22:31,382 INFO L226 Difference]: Without dead ends: 488 [2018-04-11 13:22:31,382 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:22:31,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-04-11 13:22:31,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 366. [2018-04-11 13:22:31,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-04-11 13:22:31,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 491 transitions. [2018-04-11 13:22:31,390 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 491 transitions. Word has length 23 [2018-04-11 13:22:31,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:31,391 INFO L459 AbstractCegarLoop]: Abstraction has 366 states and 491 transitions. [2018-04-11 13:22:31,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 13:22:31,391 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 491 transitions. [2018-04-11 13:22:31,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 13:22:31,392 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:31,392 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:31,392 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:31,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1240667406, now seen corresponding path program 1 times [2018-04-11 13:22:31,393 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:31,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:31,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:31,421 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:31,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:22:31,422 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:31,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:31,422 INFO L182 omatonBuilderFactory]: Interpolants [5616#(= 1 (select |#valid| main_~tmpList~0.base)), 5613#true, 5614#false, 5615#(= 1 (select |#valid| |main_#t~malloc5.base|))] [2018-04-11 13:22:31,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:31,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:22:31,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:22:31,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:22:31,423 INFO L87 Difference]: Start difference. First operand 366 states and 491 transitions. Second operand 4 states. [2018-04-11 13:22:31,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:31,681 INFO L93 Difference]: Finished difference Result 906 states and 1231 transitions. [2018-04-11 13:22:31,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:22:31,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-04-11 13:22:31,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:31,684 INFO L225 Difference]: With dead ends: 906 [2018-04-11 13:22:31,684 INFO L226 Difference]: Without dead ends: 906 [2018-04-11 13:22:31,684 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-11 13:22:31,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2018-04-11 13:22:31,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 364. [2018-04-11 13:22:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-04-11 13:22:31,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 486 transitions. [2018-04-11 13:22:31,697 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 486 transitions. Word has length 23 [2018-04-11 13:22:31,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:31,698 INFO L459 AbstractCegarLoop]: Abstraction has 364 states and 486 transitions. [2018-04-11 13:22:31,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:22:31,698 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 486 transitions. [2018-04-11 13:22:31,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 13:22:31,698 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:31,698 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:31,699 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:31,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1240667407, now seen corresponding path program 1 times [2018-04-11 13:22:31,700 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:31,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:31,741 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:31,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:22:31,741 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:31,742 INFO L182 omatonBuilderFactory]: Interpolants [6890#true, 6891#false, 6892#(and (= 0 |main_#t~malloc5.offset|) (= 4 (select |#length| |main_#t~malloc5.base|))), 6893#(and (= main_~tmpList~0.offset 0) (= 4 (select |#length| main_~tmpList~0.base)))] [2018-04-11 13:22:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:31,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:22:31,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:22:31,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:22:31,743 INFO L87 Difference]: Start difference. First operand 364 states and 486 transitions. Second operand 4 states. [2018-04-11 13:22:31,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:31,973 INFO L93 Difference]: Finished difference Result 750 states and 1035 transitions. [2018-04-11 13:22:31,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 13:22:31,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-04-11 13:22:31,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:31,976 INFO L225 Difference]: With dead ends: 750 [2018-04-11 13:22:31,976 INFO L226 Difference]: Without dead ends: 750 [2018-04-11 13:22:31,976 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-11 13:22:31,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-04-11 13:22:31,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 363. [2018-04-11 13:22:31,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-04-11 13:22:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 485 transitions. [2018-04-11 13:22:31,983 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 485 transitions. Word has length 23 [2018-04-11 13:22:31,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:31,984 INFO L459 AbstractCegarLoop]: Abstraction has 363 states and 485 transitions. [2018-04-11 13:22:31,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:22:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 485 transitions. [2018-04-11 13:22:31,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 13:22:31,984 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:31,984 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-11 13:22:31,984 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:31,985 INFO L82 PathProgramCache]: Analyzing trace with hash -339091572, now seen corresponding path program 1 times [2018-04-11 13:22:31,985 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:31,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:32,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:32,018 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:32,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 13:22:32,018 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:32,019 INFO L182 omatonBuilderFactory]: Interpolants [8010#true, 8011#false, 8012#(not (= 0 |main_#t~malloc0.base|)), 8013#(not (= 0 main_~tree~0.base))] [2018-04-11 13:22:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:32,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:22:32,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:22:32,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:22:32,019 INFO L87 Difference]: Start difference. First operand 363 states and 485 transitions. Second operand 4 states. [2018-04-11 13:22:32,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:32,040 INFO L93 Difference]: Finished difference Result 439 states and 565 transitions. [2018-04-11 13:22:32,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 13:22:32,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-04-11 13:22:32,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:32,042 INFO L225 Difference]: With dead ends: 439 [2018-04-11 13:22:32,042 INFO L226 Difference]: Without dead ends: 439 [2018-04-11 13:22:32,042 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-11 13:22:32,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-04-11 13:22:32,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 408. [2018-04-11 13:22:32,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-04-11 13:22:32,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 565 transitions. [2018-04-11 13:22:32,049 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 565 transitions. Word has length 25 [2018-04-11 13:22:32,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:32,050 INFO L459 AbstractCegarLoop]: Abstraction has 408 states and 565 transitions. [2018-04-11 13:22:32,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:22:32,050 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 565 transitions. [2018-04-11 13:22:32,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 13:22:32,051 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:32,051 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:32,051 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:32,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1765841307, now seen corresponding path program 1 times [2018-04-11 13:22:32,052 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:32,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:32,121 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:32,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 13:22:32,121 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:32,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:32,122 INFO L182 omatonBuilderFactory]: Interpolants [8864#false, 8865#(= (select |#valid| main_~tree~0.base) 1), 8866#(not (= main_~tree~0.base |main_#t~malloc5.base|)), 8867#(not (= main_~tree~0.base main_~tmpList~0.base)), 8868#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 8869#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 8870#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 8871#(= 1 (select |#valid| |main_#t~mem8.base|)), 8863#true] [2018-04-11 13:22:32,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:32,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 13:22:32,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 13:22:32,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:22:32,123 INFO L87 Difference]: Start difference. First operand 408 states and 565 transitions. Second operand 9 states. [2018-04-11 13:22:32,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:32,797 INFO L93 Difference]: Finished difference Result 1333 states and 1860 transitions. [2018-04-11 13:22:32,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 13:22:32,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-04-11 13:22:32,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:32,802 INFO L225 Difference]: With dead ends: 1333 [2018-04-11 13:22:32,802 INFO L226 Difference]: Without dead ends: 1333 [2018-04-11 13:22:32,802 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:22:32,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2018-04-11 13:22:32,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 407. [2018-04-11 13:22:32,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-04-11 13:22:32,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 564 transitions. [2018-04-11 13:22:32,814 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 564 transitions. Word has length 26 [2018-04-11 13:22:32,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:32,814 INFO L459 AbstractCegarLoop]: Abstraction has 407 states and 564 transitions. [2018-04-11 13:22:32,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 13:22:32,814 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 564 transitions. [2018-04-11 13:22:32,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 13:22:32,815 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:32,815 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:32,815 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:32,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1765841306, now seen corresponding path program 1 times [2018-04-11 13:22:32,817 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:32,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:32,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:32,909 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:32,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 13:22:32,910 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:32,910 INFO L182 omatonBuilderFactory]: Interpolants [10630#true, 10631#false, 10632#(= (select |#valid| main_~tree~0.base) 1), 10633#(not (= main_~tree~0.base |main_#t~malloc5.base|)), 10634#(not (= main_~tree~0.base main_~tmpList~0.base)), 10635#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 10636#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base))), 10637#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 10638#(and (<= 0 |main_#t~mem8.offset|) (<= (+ |main_#t~mem8.offset| 4) (select |#length| |main_#t~mem8.base|)))] [2018-04-11 13:22:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:32,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 13:22:32,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 13:22:32,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:22:32,911 INFO L87 Difference]: Start difference. First operand 407 states and 564 transitions. Second operand 9 states. [2018-04-11 13:22:33,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:33,541 INFO L93 Difference]: Finished difference Result 1332 states and 1859 transitions. [2018-04-11 13:22:33,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 13:22:33,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-04-11 13:22:33,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:33,545 INFO L225 Difference]: With dead ends: 1332 [2018-04-11 13:22:33,545 INFO L226 Difference]: Without dead ends: 1332 [2018-04-11 13:22:33,545 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:22:33,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2018-04-11 13:22:33,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 406. [2018-04-11 13:22:33,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-04-11 13:22:33,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 563 transitions. [2018-04-11 13:22:33,553 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 563 transitions. Word has length 26 [2018-04-11 13:22:33,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:33,553 INFO L459 AbstractCegarLoop]: Abstraction has 406 states and 563 transitions. [2018-04-11 13:22:33,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 13:22:33,553 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 563 transitions. [2018-04-11 13:22:33,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 13:22:33,554 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:33,554 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:33,554 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:33,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1476109501, now seen corresponding path program 1 times [2018-04-11 13:22:33,555 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:33,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:33,609 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:33,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:22:33,609 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:33,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:33,625 INFO L182 omatonBuilderFactory]: Interpolants [12395#true, 12396#false, 12397#|main_#t~short35|] [2018-04-11 13:22:33,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:33,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 13:22:33,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 13:22:33,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:22:33,625 INFO L87 Difference]: Start difference. First operand 406 states and 563 transitions. Second operand 3 states. [2018-04-11 13:22:33,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:33,633 INFO L93 Difference]: Finished difference Result 410 states and 567 transitions. [2018-04-11 13:22:33,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 13:22:33,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-04-11 13:22:33,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:33,635 INFO L225 Difference]: With dead ends: 410 [2018-04-11 13:22:33,635 INFO L226 Difference]: Without dead ends: 410 [2018-04-11 13:22:33,636 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:22:33,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-04-11 13:22:33,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2018-04-11 13:22:33,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-04-11 13:22:33,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 567 transitions. [2018-04-11 13:22:33,645 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 567 transitions. Word has length 30 [2018-04-11 13:22:33,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:33,645 INFO L459 AbstractCegarLoop]: Abstraction has 410 states and 567 transitions. [2018-04-11 13:22:33,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 13:22:33,645 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 567 transitions. [2018-04-11 13:22:33,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 13:22:33,646 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:33,646 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] [2018-04-11 13:22:33,646 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:33,646 INFO L82 PathProgramCache]: Analyzing trace with hash -664022590, now seen corresponding path program 1 times [2018-04-11 13:22:33,647 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:33,654 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:33,700 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-11 13:22:33,701 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:33,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:22:33,701 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:33,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:33,701 INFO L182 omatonBuilderFactory]: Interpolants [13218#true, 13219#false, 13220#(not |main_#t~short12|)] [2018-04-11 13:22:33,701 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-11 13:22:33,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 13:22:33,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 13:22:33,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:22:33,702 INFO L87 Difference]: Start difference. First operand 410 states and 567 transitions. Second operand 3 states. [2018-04-11 13:22:33,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:33,734 INFO L93 Difference]: Finished difference Result 413 states and 570 transitions. [2018-04-11 13:22:33,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 13:22:33,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-04-11 13:22:33,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:33,735 INFO L225 Difference]: With dead ends: 413 [2018-04-11 13:22:33,735 INFO L226 Difference]: Without dead ends: 413 [2018-04-11 13:22:33,736 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:22:33,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-04-11 13:22:33,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2018-04-11 13:22:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-04-11 13:22:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 570 transitions. [2018-04-11 13:22:33,742 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 570 transitions. Word has length 31 [2018-04-11 13:22:33,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:33,742 INFO L459 AbstractCegarLoop]: Abstraction has 413 states and 570 transitions. [2018-04-11 13:22:33,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 13:22:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 570 transitions. [2018-04-11 13:22:33,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 13:22:33,743 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:33,743 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:33,743 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:33,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1251934904, now seen corresponding path program 1 times [2018-04-11 13:22:33,744 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:33,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:33,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:33,769 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:33,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:22:33,769 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:33,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:33,770 INFO L182 omatonBuilderFactory]: Interpolants [14048#false, 14049#(and (= main_~pred~0.base 0) (= main_~pred~0.offset 0)), 14047#true] [2018-04-11 13:22:33,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:33,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 13:22:33,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 13:22:33,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:22:33,770 INFO L87 Difference]: Start difference. First operand 413 states and 570 transitions. Second operand 3 states. [2018-04-11 13:22:33,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:33,784 INFO L93 Difference]: Finished difference Result 456 states and 601 transitions. [2018-04-11 13:22:33,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 13:22:33,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-04-11 13:22:33,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:33,786 INFO L225 Difference]: With dead ends: 456 [2018-04-11 13:22:33,786 INFO L226 Difference]: Without dead ends: 456 [2018-04-11 13:22:33,786 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:22:33,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-04-11 13:22:33,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 401. [2018-04-11 13:22:33,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-04-11 13:22:33,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 547 transitions. [2018-04-11 13:22:33,792 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 547 transitions. Word has length 32 [2018-04-11 13:22:33,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:33,792 INFO L459 AbstractCegarLoop]: Abstraction has 401 states and 547 transitions. [2018-04-11 13:22:33,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 13:22:33,792 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 547 transitions. [2018-04-11 13:22:33,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 13:22:33,793 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:33,793 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] [2018-04-11 13:22:33,793 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:33,793 INFO L82 PathProgramCache]: Analyzing trace with hash -403555681, now seen corresponding path program 1 times [2018-04-11 13:22:33,794 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:33,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:33,907 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-11 13:22:33,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:33,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 13:22:33,908 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:33,908 INFO L182 omatonBuilderFactory]: Interpolants [14912#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 14913#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 14914#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 14915#(and (= |main_#t~mem10.offset| 0) (= 0 |main_#t~mem10.base|)), 14916#(not |main_#t~short12|), 14907#true, 14908#false, 14909#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= (select |#valid| main_~tree~0.base) 1)), 14910#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~malloc1.base|))), 14911#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))] [2018-04-11 13:22:33,908 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-11 13:22:33,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 13:22:33,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 13:22:33,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:22:33,909 INFO L87 Difference]: Start difference. First operand 401 states and 547 transitions. Second operand 10 states. [2018-04-11 13:22:34,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:34,335 INFO L93 Difference]: Finished difference Result 637 states and 808 transitions. [2018-04-11 13:22:34,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 13:22:34,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-04-11 13:22:34,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:34,336 INFO L225 Difference]: With dead ends: 637 [2018-04-11 13:22:34,336 INFO L226 Difference]: Without dead ends: 637 [2018-04-11 13:22:34,336 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2018-04-11 13:22:34,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-04-11 13:22:34,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 418. [2018-04-11 13:22:34,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-04-11 13:22:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 569 transitions. [2018-04-11 13:22:34,340 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 569 transitions. Word has length 33 [2018-04-11 13:22:34,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:34,341 INFO L459 AbstractCegarLoop]: Abstraction has 418 states and 569 transitions. [2018-04-11 13:22:34,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 13:22:34,341 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 569 transitions. [2018-04-11 13:22:34,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 13:22:34,341 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:34,341 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-11 13:22:34,341 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:34,341 INFO L82 PathProgramCache]: Analyzing trace with hash 932853160, now seen corresponding path program 1 times [2018-04-11 13:22:34,342 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:34,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:34,589 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-11 13:22:34,589 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:22:34,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 13:22:34,590 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:34,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:34,590 INFO L182 omatonBuilderFactory]: Interpolants [15986#true, 15987#false, 15988#(= (select |#valid| 0) 0), 15989#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= (select |#valid| 0) 0) (= (select |#valid| main_~tree~0.base) 1)), 15990#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~malloc1.base|))), 15991#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 15992#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 15993#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 1 (select |#valid| 0)))), 15994#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 1 (select |#valid| 0)))), 15995#(and (= |main_#t~mem33.base| 0) (or (= |main_#t~mem33.offset| 0) (= 1 (select |#valid| 0))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) |main_#t~mem33.base|)), 15996#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= 1 (select |#valid| 0))) (not |main_#t~short35|)), 15997#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= 1 (select |#valid| 0))), 15998#(and (= 0 |main_#t~mem37.base|) (= 1 (select |#valid| 0))), 15999#(and (= 0 main_~tmp~0.base) (= 1 (select |#valid| 0)))] [2018-04-11 13:22:34,590 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-11 13:22:34,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 13:22:34,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 13:22:34,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:22:34,591 INFO L87 Difference]: Start difference. First operand 418 states and 569 transitions. Second operand 14 states. [2018-04-11 13:22:35,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:35,417 INFO L93 Difference]: Finished difference Result 635 states and 804 transitions. [2018-04-11 13:22:35,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 13:22:35,417 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-04-11 13:22:35,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:35,418 INFO L225 Difference]: With dead ends: 635 [2018-04-11 13:22:35,419 INFO L226 Difference]: Without dead ends: 635 [2018-04-11 13:22:35,419 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=576, Unknown=0, NotChecked=0, Total=756 [2018-04-11 13:22:35,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-04-11 13:22:35,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 467. [2018-04-11 13:22:35,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-04-11 13:22:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 648 transitions. [2018-04-11 13:22:35,423 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 648 transitions. Word has length 34 [2018-04-11 13:22:35,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:35,423 INFO L459 AbstractCegarLoop]: Abstraction has 467 states and 648 transitions. [2018-04-11 13:22:35,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 13:22:35,423 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 648 transitions. [2018-04-11 13:22:35,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 13:22:35,423 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:35,423 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:35,423 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:35,424 INFO L82 PathProgramCache]: Analyzing trace with hash -536384940, now seen corresponding path program 1 times [2018-04-11 13:22:35,424 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:35,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:35,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:22:35,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 13:22:35,535 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:35,535 INFO L182 omatonBuilderFactory]: Interpolants [17130#true, 17131#false, 17132#(= (select |#valid| main_~tree~0.base) 1), 17133#(not (= main_~tree~0.base |main_#t~malloc1.base|)), 17134#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 17135#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 17136#(and (not (= main_~tree~0.base |main_#t~malloc5.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 17137#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 17138#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 17139#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 17140#(and (not (= main_~tree~0.base |main_#t~mem8.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 17141#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 17142#(= 1 (select |#valid| |main_#t~mem6.base|))] [2018-04-11 13:22:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:35,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 13:22:35,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 13:22:35,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-04-11 13:22:35,536 INFO L87 Difference]: Start difference. First operand 467 states and 648 transitions. Second operand 13 states. [2018-04-11 13:22:35,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:35,985 INFO L93 Difference]: Finished difference Result 787 states and 1021 transitions. [2018-04-11 13:22:35,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 13:22:35,985 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-04-11 13:22:35,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:35,987 INFO L225 Difference]: With dead ends: 787 [2018-04-11 13:22:35,987 INFO L226 Difference]: Without dead ends: 787 [2018-04-11 13:22:35,987 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:22:35,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2018-04-11 13:22:35,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 466. [2018-04-11 13:22:35,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-04-11 13:22:35,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 647 transitions. [2018-04-11 13:22:35,991 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 647 transitions. Word has length 34 [2018-04-11 13:22:35,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:35,991 INFO L459 AbstractCegarLoop]: Abstraction has 466 states and 647 transitions. [2018-04-11 13:22:35,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 13:22:35,991 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 647 transitions. [2018-04-11 13:22:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 13:22:35,992 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:35,992 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:35,992 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:35,992 INFO L82 PathProgramCache]: Analyzing trace with hash -536384939, now seen corresponding path program 1 times [2018-04-11 13:22:35,992 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:36,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:36,142 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:22:36,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 13:22:36,142 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:36,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:36,142 INFO L182 omatonBuilderFactory]: Interpolants [18414#true, 18415#false, 18416#(= (select |#valid| main_~tree~0.base) 1), 18417#(and (= 4 (select |#length| |main_#t~malloc1.base|)) (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 18418#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 18419#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| main_~tree~0.base) 1)), 18420#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 18421#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc5.base|)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 18422#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 18423#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| |main_#t~mem6.base|)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 18424#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~mem8.base|)) (not (= main_~tree~0.base main_~tmpList~0.base))), 18425#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 18426#(and (= |main_#t~mem6.offset| 0) (= 4 (select |#length| |main_#t~mem6.base|)))] [2018-04-11 13:22:36,142 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:36,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 13:22:36,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 13:22:36,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-04-11 13:22:36,143 INFO L87 Difference]: Start difference. First operand 466 states and 647 transitions. Second operand 13 states. [2018-04-11 13:22:36,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:36,899 INFO L93 Difference]: Finished difference Result 879 states and 1156 transitions. [2018-04-11 13:22:36,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 13:22:36,900 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-04-11 13:22:36,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:36,901 INFO L225 Difference]: With dead ends: 879 [2018-04-11 13:22:36,901 INFO L226 Difference]: Without dead ends: 879 [2018-04-11 13:22:36,901 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:22:36,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-04-11 13:22:36,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 461. [2018-04-11 13:22:36,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-04-11 13:22:36,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 642 transitions. [2018-04-11 13:22:36,905 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 642 transitions. Word has length 34 [2018-04-11 13:22:36,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:36,905 INFO L459 AbstractCegarLoop]: Abstraction has 461 states and 642 transitions. [2018-04-11 13:22:36,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 13:22:36,905 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 642 transitions. [2018-04-11 13:22:36,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 13:22:36,906 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:36,906 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:36,906 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:36,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1086725402, now seen corresponding path program 1 times [2018-04-11 13:22:36,906 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:36,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:37,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:37,004 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:37,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 13:22:37,004 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:37,004 INFO L182 omatonBuilderFactory]: Interpolants [19792#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 main_~tree~0.offset)), 19793#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 19794#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset)), 19795#(and (= 0 main_~tree~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 19796#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 19797#(= 1 (select |#valid| |main_#t~mem40.base|)), 19787#true, 19788#false, 19789#(= 0 |main_#t~malloc0.offset|), 19790#(= 0 main_~tree~0.offset), 19791#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1))] [2018-04-11 13:22:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:37,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 13:22:37,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 13:22:37,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-11 13:22:37,005 INFO L87 Difference]: Start difference. First operand 461 states and 642 transitions. Second operand 11 states. [2018-04-11 13:22:37,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:37,467 INFO L93 Difference]: Finished difference Result 708 states and 921 transitions. [2018-04-11 13:22:37,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 13:22:37,467 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-04-11 13:22:37,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:37,468 INFO L225 Difference]: With dead ends: 708 [2018-04-11 13:22:37,468 INFO L226 Difference]: Without dead ends: 708 [2018-04-11 13:22:37,468 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2018-04-11 13:22:37,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-04-11 13:22:37,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 471. [2018-04-11 13:22:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-04-11 13:22:37,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 654 transitions. [2018-04-11 13:22:37,474 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 654 transitions. Word has length 35 [2018-04-11 13:22:37,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:37,475 INFO L459 AbstractCegarLoop]: Abstraction has 471 states and 654 transitions. [2018-04-11 13:22:37,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 13:22:37,475 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 654 transitions. [2018-04-11 13:22:37,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 13:22:37,475 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:37,475 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:37,475 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:37,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1086725401, now seen corresponding path program 1 times [2018-04-11 13:22:37,476 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:37,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:37,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:37,635 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:37,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 13:22:37,635 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:37,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:37,636 INFO L182 omatonBuilderFactory]: Interpolants [21008#false, 21009#(= 0 |main_#t~malloc0.offset|), 21010#(= 0 main_~tree~0.offset), 21011#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 21012#(and (= 4 (select |#length| |main_#t~malloc1.base|)) (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|) (= 0 main_~tree~0.offset)), 21013#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 21014#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 21015#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 21016#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmp~0.offset 0)), 21017#(and (= |main_#t~mem40.offset| 0) (= 4 (select |#length| |main_#t~mem40.base|))), 21007#true] [2018-04-11 13:22:37,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:37,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 13:22:37,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 13:22:37,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-04-11 13:22:37,636 INFO L87 Difference]: Start difference. First operand 471 states and 654 transitions. Second operand 11 states. [2018-04-11 13:22:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:38,228 INFO L93 Difference]: Finished difference Result 905 states and 1184 transitions. [2018-04-11 13:22:38,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 13:22:38,228 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-04-11 13:22:38,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:38,230 INFO L225 Difference]: With dead ends: 905 [2018-04-11 13:22:38,230 INFO L226 Difference]: Without dead ends: 905 [2018-04-11 13:22:38,230 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2018-04-11 13:22:38,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-04-11 13:22:38,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 471. [2018-04-11 13:22:38,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-04-11 13:22:38,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 653 transitions. [2018-04-11 13:22:38,234 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 653 transitions. Word has length 35 [2018-04-11 13:22:38,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:38,234 INFO L459 AbstractCegarLoop]: Abstraction has 471 states and 653 transitions. [2018-04-11 13:22:38,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 13:22:38,234 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 653 transitions. [2018-04-11 13:22:38,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 13:22:38,235 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:38,235 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:38,235 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:38,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1464376684, now seen corresponding path program 1 times [2018-04-11 13:22:38,235 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:38,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:38,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:38,259 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:38,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:22:38,259 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:38,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:38,259 INFO L182 omatonBuilderFactory]: Interpolants [22412#true, 22413#false, 22414#(= 1 (select |#valid| |main_#t~malloc19.base|)), 22415#(= 1 (select |#valid| main_~newNode~0.base))] [2018-04-11 13:22:38,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:38,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:22:38,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:22:38,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:22:38,260 INFO L87 Difference]: Start difference. First operand 471 states and 653 transitions. Second operand 4 states. [2018-04-11 13:22:38,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:38,423 INFO L93 Difference]: Finished difference Result 1198 states and 1675 transitions. [2018-04-11 13:22:38,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:22:38,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-04-11 13:22:38,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:38,425 INFO L225 Difference]: With dead ends: 1198 [2018-04-11 13:22:38,425 INFO L226 Difference]: Without dead ends: 1198 [2018-04-11 13:22:38,425 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-11 13:22:38,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2018-04-11 13:22:38,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 468. [2018-04-11 13:22:38,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-04-11 13:22:38,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 651 transitions. [2018-04-11 13:22:38,431 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 651 transitions. Word has length 35 [2018-04-11 13:22:38,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:38,431 INFO L459 AbstractCegarLoop]: Abstraction has 468 states and 651 transitions. [2018-04-11 13:22:38,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:22:38,431 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 651 transitions. [2018-04-11 13:22:38,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 13:22:38,431 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:38,431 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:38,431 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:38,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1464376685, now seen corresponding path program 1 times [2018-04-11 13:22:38,432 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:38,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:38,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:38,463 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:38,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:22:38,463 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:38,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:38,463 INFO L182 omatonBuilderFactory]: Interpolants [24085#true, 24086#false, 24087#(and (= 0 |main_#t~malloc19.offset|) (= 12 (select |#length| |main_#t~malloc19.base|))), 24088#(and (= main_~newNode~0.offset 0) (= 12 (select |#length| main_~newNode~0.base)))] [2018-04-11 13:22:38,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:38,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:22:38,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:22:38,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:22:38,464 INFO L87 Difference]: Start difference. First operand 468 states and 651 transitions. Second operand 4 states. [2018-04-11 13:22:38,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:38,555 INFO L93 Difference]: Finished difference Result 470 states and 652 transitions. [2018-04-11 13:22:38,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 13:22:38,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-04-11 13:22:38,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:38,556 INFO L225 Difference]: With dead ends: 470 [2018-04-11 13:22:38,556 INFO L226 Difference]: Without dead ends: 470 [2018-04-11 13:22:38,556 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:22:38,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-04-11 13:22:38,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 469. [2018-04-11 13:22:38,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-04-11 13:22:38,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 651 transitions. [2018-04-11 13:22:38,559 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 651 transitions. Word has length 35 [2018-04-11 13:22:38,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:38,559 INFO L459 AbstractCegarLoop]: Abstraction has 469 states and 651 transitions. [2018-04-11 13:22:38,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:22:38,559 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 651 transitions. [2018-04-11 13:22:38,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 13:22:38,559 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:38,559 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] [2018-04-11 13:22:38,560 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:38,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1293426211, now seen corresponding path program 1 times [2018-04-11 13:22:38,560 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:38,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:38,607 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-11 13:22:38,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:38,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 13:22:38,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:38,608 INFO L182 omatonBuilderFactory]: Interpolants [25030#true, 25031#false, 25032#(and (= |main_#t~mem33.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= |main_#t~mem33.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset))), 25033#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))) |main_#t~short35|), 25034#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 25035#(and (= |main_#t~mem36.offset| 0) (= |main_#t~mem36.base| 0))] [2018-04-11 13:22:38,608 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-11 13:22:38,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 13:22:38,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 13:22:38,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 13:22:38,608 INFO L87 Difference]: Start difference. First operand 469 states and 651 transitions. Second operand 6 states. [2018-04-11 13:22:38,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:38,728 INFO L93 Difference]: Finished difference Result 581 states and 813 transitions. [2018-04-11 13:22:38,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 13:22:38,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-04-11 13:22:38,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:38,729 INFO L225 Difference]: With dead ends: 581 [2018-04-11 13:22:38,729 INFO L226 Difference]: Without dead ends: 581 [2018-04-11 13:22:38,730 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:22:38,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2018-04-11 13:22:38,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 478. [2018-04-11 13:22:38,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-04-11 13:22:38,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 663 transitions. [2018-04-11 13:22:38,735 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 663 transitions. Word has length 36 [2018-04-11 13:22:38,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:38,735 INFO L459 AbstractCegarLoop]: Abstraction has 478 states and 663 transitions. [2018-04-11 13:22:38,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 13:22:38,735 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 663 transitions. [2018-04-11 13:22:38,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 13:22:38,735 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:38,736 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] [2018-04-11 13:22:38,736 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:38,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1299151849, now seen corresponding path program 1 times [2018-04-11 13:22:38,736 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:38,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:38,949 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-11 13:22:38,949 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:38,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-11 13:22:38,949 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:38,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:38,950 INFO L182 omatonBuilderFactory]: Interpolants [26112#(and (= 0 |main_#t~mem34.base|) (= |main_#t~mem34.offset| 0) (= main_~tmp~0.offset 0)), 26113#(and (= main_~tmp~0.offset 0) (not |main_#t~short35|)), 26101#true, 26102#false, 26103#(= 0 |main_#t~malloc0.offset|), 26104#(= 0 main_~tree~0.offset), 26105#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 26106#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 26107#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 main_~tree~0.offset)), 26108#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 26109#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset)), 26110#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset)), 26111#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= main_~tmp~0.offset 0))] [2018-04-11 13:22:38,950 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-11 13:22:38,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 13:22:38,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 13:22:38,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-04-11 13:22:38,950 INFO L87 Difference]: Start difference. First operand 478 states and 663 transitions. Second operand 13 states. [2018-04-11 13:22:39,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:39,475 INFO L93 Difference]: Finished difference Result 608 states and 812 transitions. [2018-04-11 13:22:39,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 13:22:39,475 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-04-11 13:22:39,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:39,476 INFO L225 Difference]: With dead ends: 608 [2018-04-11 13:22:39,476 INFO L226 Difference]: Without dead ends: 608 [2018-04-11 13:22:39,476 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:22:39,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-04-11 13:22:39,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 432. [2018-04-11 13:22:39,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-04-11 13:22:39,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 586 transitions. [2018-04-11 13:22:39,479 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 586 transitions. Word has length 36 [2018-04-11 13:22:39,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:39,480 INFO L459 AbstractCegarLoop]: Abstraction has 432 states and 586 transitions. [2018-04-11 13:22:39,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 13:22:39,480 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 586 transitions. [2018-04-11 13:22:39,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 13:22:39,480 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:39,480 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:39,480 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:39,480 INFO L82 PathProgramCache]: Analyzing trace with hash 827290309, now seen corresponding path program 1 times [2018-04-11 13:22:39,481 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:39,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:39,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:39,602 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:39,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 13:22:39,603 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:39,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:39,603 INFO L182 omatonBuilderFactory]: Interpolants [27184#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset)), 27185#(= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))), 27186#(= 0 |main_#t~mem47.offset|), 27176#true, 27177#false, 27178#(= 0 |main_#t~malloc0.offset|), 27179#(= 0 main_~tree~0.offset), 27180#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 27181#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|) (= 0 main_~tree~0.offset)), 27182#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 27183#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 0 main_~tree~0.offset))] [2018-04-11 13:22:39,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:39,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 13:22:39,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 13:22:39,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-04-11 13:22:39,604 INFO L87 Difference]: Start difference. First operand 432 states and 586 transitions. Second operand 11 states. [2018-04-11 13:22:40,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:40,022 INFO L93 Difference]: Finished difference Result 644 states and 817 transitions. [2018-04-11 13:22:40,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 13:22:40,022 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-04-11 13:22:40,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:40,023 INFO L225 Difference]: With dead ends: 644 [2018-04-11 13:22:40,023 INFO L226 Difference]: Without dead ends: 644 [2018-04-11 13:22:40,023 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:22:40,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2018-04-11 13:22:40,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 435. [2018-04-11 13:22:40,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-04-11 13:22:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 590 transitions. [2018-04-11 13:22:40,026 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 590 transitions. Word has length 38 [2018-04-11 13:22:40,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:40,027 INFO L459 AbstractCegarLoop]: Abstraction has 435 states and 590 transitions. [2018-04-11 13:22:40,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 13:22:40,027 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 590 transitions. [2018-04-11 13:22:40,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 13:22:40,027 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:40,027 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:40,027 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:40,027 INFO L82 PathProgramCache]: Analyzing trace with hash 827291432, now seen corresponding path program 1 times [2018-04-11 13:22:40,028 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:40,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:40,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-11 13:22:40,045 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:40,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 13:22:40,045 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:40,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-11 13:22:40,046 INFO L182 omatonBuilderFactory]: Interpolants [28292#true, 28293#false, 28294#(= |main_#t~mem40.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))), 28295#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 28296#(= 1 (select |#valid| |main_#t~mem43.base|))] [2018-04-11 13:22:40,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:40,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:22:40,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:22:40,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:22:40,046 INFO L87 Difference]: Start difference. First operand 435 states and 590 transitions. Second operand 5 states. [2018-04-11 13:22:40,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:40,175 INFO L93 Difference]: Finished difference Result 434 states and 586 transitions. [2018-04-11 13:22:40,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 13:22:40,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-04-11 13:22:40,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:40,177 INFO L225 Difference]: With dead ends: 434 [2018-04-11 13:22:40,177 INFO L226 Difference]: Without dead ends: 434 [2018-04-11 13:22:40,177 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:22:40,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-04-11 13:22:40,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-04-11 13:22:40,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-04-11 13:22:40,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 586 transitions. [2018-04-11 13:22:40,180 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 586 transitions. Word has length 38 [2018-04-11 13:22:40,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:40,180 INFO L459 AbstractCegarLoop]: Abstraction has 434 states and 586 transitions. [2018-04-11 13:22:40,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:22:40,180 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 586 transitions. [2018-04-11 13:22:40,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 13:22:40,180 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:40,180 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:40,180 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:40,181 INFO L82 PathProgramCache]: Analyzing trace with hash 827291433, now seen corresponding path program 1 times [2018-04-11 13:22:40,181 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:40,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:40,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:40,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:40,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 13:22:40,216 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:40,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:40,216 INFO L182 omatonBuilderFactory]: Interpolants [29169#true, 29170#false, 29171#(and (= |main_#t~mem40.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem40.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 29172#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 29173#(and (<= (+ |main_#t~mem43.offset| 4) (select |#length| |main_#t~mem43.base|)) (<= 0 |main_#t~mem43.offset|))] [2018-04-11 13:22:40,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:40,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:22:40,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:22:40,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:22:40,216 INFO L87 Difference]: Start difference. First operand 434 states and 586 transitions. Second operand 5 states. [2018-04-11 13:22:40,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:40,367 INFO L93 Difference]: Finished difference Result 433 states and 582 transitions. [2018-04-11 13:22:40,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 13:22:40,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-04-11 13:22:40,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:40,368 INFO L225 Difference]: With dead ends: 433 [2018-04-11 13:22:40,368 INFO L226 Difference]: Without dead ends: 433 [2018-04-11 13:22:40,369 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:22:40,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-04-11 13:22:40,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2018-04-11 13:22:40,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-04-11 13:22:40,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 582 transitions. [2018-04-11 13:22:40,371 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 582 transitions. Word has length 38 [2018-04-11 13:22:40,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:40,371 INFO L459 AbstractCegarLoop]: Abstraction has 433 states and 582 transitions. [2018-04-11 13:22:40,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:22:40,371 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 582 transitions. [2018-04-11 13:22:40,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 13:22:40,372 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:40,372 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:40,372 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:40,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1263089809, now seen corresponding path program 1 times [2018-04-11 13:22:40,372 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:40,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:40,430 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:40,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 13:22:40,431 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:40,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:40,431 INFO L182 omatonBuilderFactory]: Interpolants [30048#(and (= main_~newNode~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (= (select |#length| main_~newNode~0.base) 12)), 30049#(and (<= 12 (select |#length| main_~newNode~0.base)) (= main_~newNode~0.offset 0)), 30044#true, 30045#false, 30046#(and (= 0 |main_#t~malloc19.offset|) (= 12 (select |#length| |main_#t~malloc19.base|))), 30047#(and (= main_~newNode~0.offset 0) (= 12 (select |#length| main_~newNode~0.base)))] [2018-04-11 13:22:40,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:40,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 13:22:40,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 13:22:40,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-11 13:22:40,432 INFO L87 Difference]: Start difference. First operand 433 states and 582 transitions. Second operand 6 states. [2018-04-11 13:22:40,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:40,667 INFO L93 Difference]: Finished difference Result 915 states and 1262 transitions. [2018-04-11 13:22:40,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 13:22:40,668 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-04-11 13:22:40,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:40,670 INFO L225 Difference]: With dead ends: 915 [2018-04-11 13:22:40,671 INFO L226 Difference]: Without dead ends: 915 [2018-04-11 13:22:40,671 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:22:40,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-04-11 13:22:40,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 437. [2018-04-11 13:22:40,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-04-11 13:22:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 586 transitions. [2018-04-11 13:22:40,678 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 586 transitions. Word has length 38 [2018-04-11 13:22:40,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:40,678 INFO L459 AbstractCegarLoop]: Abstraction has 437 states and 586 transitions. [2018-04-11 13:22:40,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 13:22:40,678 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 586 transitions. [2018-04-11 13:22:40,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 13:22:40,678 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:40,678 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-11 13:22:40,678 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:40,679 INFO L82 PathProgramCache]: Analyzing trace with hash -123803838, now seen corresponding path program 1 times [2018-04-11 13:22:40,679 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:40,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:40,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:40,712 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:40,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 13:22:40,712 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:40,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:40,713 INFO L182 omatonBuilderFactory]: Interpolants [31408#(= |main_#t~mem40.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))), 31409#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 31410#(= 1 (select |#valid| |main_#t~mem47.base|)), 31406#true, 31407#false] [2018-04-11 13:22:40,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:40,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:22:40,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:22:40,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:22:40,713 INFO L87 Difference]: Start difference. First operand 437 states and 586 transitions. Second operand 5 states. [2018-04-11 13:22:40,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:40,867 INFO L93 Difference]: Finished difference Result 436 states and 582 transitions. [2018-04-11 13:22:40,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 13:22:40,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-04-11 13:22:40,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:40,868 INFO L225 Difference]: With dead ends: 436 [2018-04-11 13:22:40,868 INFO L226 Difference]: Without dead ends: 436 [2018-04-11 13:22:40,868 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:22:40,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-04-11 13:22:40,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2018-04-11 13:22:40,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-04-11 13:22:40,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 582 transitions. [2018-04-11 13:22:40,871 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 582 transitions. Word has length 39 [2018-04-11 13:22:40,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:40,871 INFO L459 AbstractCegarLoop]: Abstraction has 436 states and 582 transitions. [2018-04-11 13:22:40,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:22:40,871 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 582 transitions. [2018-04-11 13:22:40,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 13:22:40,872 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:40,872 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-11 13:22:40,872 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:40,872 INFO L82 PathProgramCache]: Analyzing trace with hash -247563480, now seen corresponding path program 1 times [2018-04-11 13:22:40,873 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:40,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:40,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:40,901 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:40,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:22:40,901 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:40,901 INFO L182 omatonBuilderFactory]: Interpolants [32288#false, 32289#(= 1 (select |#valid| |main_#t~malloc23.base|)), 32290#(= 1 (select |#valid| main_~newNode~0.base)), 32287#true] [2018-04-11 13:22:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:40,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:22:40,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:22:40,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:22:40,902 INFO L87 Difference]: Start difference. First operand 436 states and 582 transitions. Second operand 4 states. [2018-04-11 13:22:41,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:41,077 INFO L93 Difference]: Finished difference Result 1167 states and 1587 transitions. [2018-04-11 13:22:41,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:22:41,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-04-11 13:22:41,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:41,080 INFO L225 Difference]: With dead ends: 1167 [2018-04-11 13:22:41,080 INFO L226 Difference]: Without dead ends: 1167 [2018-04-11 13:22:41,080 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-11 13:22:41,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2018-04-11 13:22:41,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 435. [2018-04-11 13:22:41,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-04-11 13:22:41,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 581 transitions. [2018-04-11 13:22:41,085 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 581 transitions. Word has length 39 [2018-04-11 13:22:41,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:41,085 INFO L459 AbstractCegarLoop]: Abstraction has 435 states and 581 transitions. [2018-04-11 13:22:41,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:22:41,085 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 581 transitions. [2018-04-11 13:22:41,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 13:22:41,085 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:41,085 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-11 13:22:41,085 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:41,085 INFO L82 PathProgramCache]: Analyzing trace with hash -247563479, now seen corresponding path program 1 times [2018-04-11 13:22:41,086 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:41,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:41,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:41,113 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:41,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:22:41,114 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:41,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:41,114 INFO L182 omatonBuilderFactory]: Interpolants [33896#true, 33897#false, 33898#(and (= 12 (select |#length| |main_#t~malloc23.base|)) (= 0 |main_#t~malloc23.offset|)), 33899#(and (= main_~newNode~0.offset 0) (= 12 (select |#length| main_~newNode~0.base)))] [2018-04-11 13:22:41,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:41,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:22:41,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:22:41,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:22:41,115 INFO L87 Difference]: Start difference. First operand 435 states and 581 transitions. Second operand 4 states. [2018-04-11 13:22:41,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:41,200 INFO L93 Difference]: Finished difference Result 433 states and 579 transitions. [2018-04-11 13:22:41,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 13:22:41,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-04-11 13:22:41,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:41,202 INFO L225 Difference]: With dead ends: 433 [2018-04-11 13:22:41,202 INFO L226 Difference]: Without dead ends: 433 [2018-04-11 13:22:41,202 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:22:41,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-04-11 13:22:41,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2018-04-11 13:22:41,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-04-11 13:22:41,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 579 transitions. [2018-04-11 13:22:41,206 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 579 transitions. Word has length 39 [2018-04-11 13:22:41,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:41,206 INFO L459 AbstractCegarLoop]: Abstraction has 433 states and 579 transitions. [2018-04-11 13:22:41,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:22:41,206 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 579 transitions. [2018-04-11 13:22:41,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 13:22:41,207 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:41,207 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:41,207 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:41,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1316978381, now seen corresponding path program 1 times [2018-04-11 13:22:41,208 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:41,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:41,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:41,344 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:41,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-04-11 13:22:41,344 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:41,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:41,345 INFO L182 omatonBuilderFactory]: Interpolants [34768#true, 34769#false, 34770#(= (select |#valid| main_~tree~0.base) 1), 34771#(not (= main_~tree~0.base |main_#t~malloc1.base|)), 34772#(not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 34773#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem2.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 34774#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~mem3.base|) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem2.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 34775#(= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 34776#(= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 34777#(and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 34778#(and (= |main_#t~mem40.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| |main_#t~mem40.base|) |main_#t~mem40.offset|)) (= |main_#t~mem40.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 34779#(and (= 1 (select |#valid| |main_#t~mem41.base|)) (= |main_#t~mem42.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem42.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 34780#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 34781#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem43.base|) |main_#t~mem43.offset|))), 34782#(= 1 (select |#valid| |main_#t~mem44.base|)), 34783#(= 1 (select |#valid| main_~tmpList~0.base))] [2018-04-11 13:22:41,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:41,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 13:22:41,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 13:22:41,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-04-11 13:22:41,345 INFO L87 Difference]: Start difference. First operand 433 states and 579 transitions. Second operand 16 states. [2018-04-11 13:22:42,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:42,035 INFO L93 Difference]: Finished difference Result 781 states and 971 transitions. [2018-04-11 13:22:42,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 13:22:42,035 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-04-11 13:22:42,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:42,037 INFO L225 Difference]: With dead ends: 781 [2018-04-11 13:22:42,037 INFO L226 Difference]: Without dead ends: 781 [2018-04-11 13:22:42,037 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2018-04-11 13:22:42,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2018-04-11 13:22:42,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 438. [2018-04-11 13:22:42,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-04-11 13:22:42,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 585 transitions. [2018-04-11 13:22:42,040 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 585 transitions. Word has length 41 [2018-04-11 13:22:42,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:42,041 INFO L459 AbstractCegarLoop]: Abstraction has 438 states and 585 transitions. [2018-04-11 13:22:42,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 13:22:42,041 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 585 transitions. [2018-04-11 13:22:42,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 13:22:42,041 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:42,041 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:42,041 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:42,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1316978382, now seen corresponding path program 1 times [2018-04-11 13:22:42,042 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:42,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:42,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:42,208 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:42,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-11 13:22:42,208 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:42,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:42,208 INFO L182 omatonBuilderFactory]: Interpolants [36032#false, 36033#(= (select |#valid| main_~tree~0.base) 1), 36034#(not (= main_~tree~0.base |main_#t~malloc1.base|)), 36035#(not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 36036#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem2.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 36037#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~mem3.base|) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem2.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem3.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 36038#(and (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 36039#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 36040#(and (= |main_#t~mem41.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 36041#(and (= |main_#t~mem41.offset| (select (select |#memory_$Pointer$.offset| |main_#t~mem40.base|) |main_#t~mem40.offset|)) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| |main_#t~mem40.base|) |main_#t~mem40.offset|)) (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 36042#(and (= |main_#t~mem42.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem41.offset| |main_#t~mem42.offset|)), 36031#true] [2018-04-11 13:22:42,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:42,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 13:22:42,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 13:22:42,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-04-11 13:22:42,209 INFO L87 Difference]: Start difference. First operand 438 states and 585 transitions. Second operand 12 states. [2018-04-11 13:22:42,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:42,675 INFO L93 Difference]: Finished difference Result 613 states and 776 transitions. [2018-04-11 13:22:42,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 13:22:42,675 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-04-11 13:22:42,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:42,676 INFO L225 Difference]: With dead ends: 613 [2018-04-11 13:22:42,676 INFO L226 Difference]: Without dead ends: 613 [2018-04-11 13:22:42,677 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:22:42,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-04-11 13:22:42,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 433. [2018-04-11 13:22:42,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-04-11 13:22:42,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 578 transitions. [2018-04-11 13:22:42,680 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 578 transitions. Word has length 41 [2018-04-11 13:22:42,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:42,680 INFO L459 AbstractCegarLoop]: Abstraction has 433 states and 578 transitions. [2018-04-11 13:22:42,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 13:22:42,680 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 578 transitions. [2018-04-11 13:22:42,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 13:22:42,680 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:42,680 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:42,680 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:42,680 INFO L82 PathProgramCache]: Analyzing trace with hash 500119061, now seen corresponding path program 1 times [2018-04-11 13:22:42,681 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:42,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:42,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:42,705 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:42,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 13:22:42,705 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:42,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:42,706 INFO L182 omatonBuilderFactory]: Interpolants [37109#true, 37110#false, 37111#(= 1 (select |#valid| |main_#t~malloc25.base|)), 37112#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))), 37113#(= 1 (select |#valid| |main_#t~mem26.base|))] [2018-04-11 13:22:42,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:42,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:22:42,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:22:42,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:22:42,706 INFO L87 Difference]: Start difference. First operand 433 states and 578 transitions. Second operand 5 states. [2018-04-11 13:22:42,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:42,871 INFO L93 Difference]: Finished difference Result 670 states and 898 transitions. [2018-04-11 13:22:42,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 13:22:42,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-04-11 13:22:42,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:42,872 INFO L225 Difference]: With dead ends: 670 [2018-04-11 13:22:42,873 INFO L226 Difference]: Without dead ends: 670 [2018-04-11 13:22:42,873 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-11 13:22:42,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-04-11 13:22:42,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 432. [2018-04-11 13:22:42,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-04-11 13:22:42,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 577 transitions. [2018-04-11 13:22:42,876 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 577 transitions. Word has length 41 [2018-04-11 13:22:42,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:42,876 INFO L459 AbstractCegarLoop]: Abstraction has 432 states and 577 transitions. [2018-04-11 13:22:42,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:22:42,877 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 577 transitions. [2018-04-11 13:22:42,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 13:22:42,877 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:42,877 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:42,877 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:42,877 INFO L82 PathProgramCache]: Analyzing trace with hash 500119062, now seen corresponding path program 1 times [2018-04-11 13:22:42,878 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:42,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:42,925 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:42,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 13:22:42,925 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:42,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:42,925 INFO L182 omatonBuilderFactory]: Interpolants [38224#(and (= 0 |main_#t~malloc25.offset|) (= 4 (select |#length| |main_#t~malloc25.base|))), 38225#(and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))), 38226#(and (= 4 (select |#length| |main_#t~mem26.base|)) (= |main_#t~mem26.offset| 0)), 38222#true, 38223#false] [2018-04-11 13:22:42,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:42,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:22:42,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:22:42,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:22:42,925 INFO L87 Difference]: Start difference. First operand 432 states and 577 transitions. Second operand 5 states. [2018-04-11 13:22:43,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:43,110 INFO L93 Difference]: Finished difference Result 664 states and 887 transitions. [2018-04-11 13:22:43,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 13:22:43,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-04-11 13:22:43,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:43,111 INFO L225 Difference]: With dead ends: 664 [2018-04-11 13:22:43,111 INFO L226 Difference]: Without dead ends: 664 [2018-04-11 13:22:43,111 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-11 13:22:43,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-04-11 13:22:43,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 431. [2018-04-11 13:22:43,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-04-11 13:22:43,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 576 transitions. [2018-04-11 13:22:43,114 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 576 transitions. Word has length 41 [2018-04-11 13:22:43,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:43,114 INFO L459 AbstractCegarLoop]: Abstraction has 431 states and 576 transitions. [2018-04-11 13:22:43,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:22:43,114 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 576 transitions. [2018-04-11 13:22:43,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 13:22:43,115 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:43,115 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:43,115 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:43,115 INFO L82 PathProgramCache]: Analyzing trace with hash -704663211, now seen corresponding path program 1 times [2018-04-11 13:22:43,115 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:43,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:43,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:43,161 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:43,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 13:22:43,161 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:43,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:43,162 INFO L182 omatonBuilderFactory]: Interpolants [39328#true, 39329#false, 39330#(and (= 12 (select |#length| |main_#t~malloc23.base|)) (= 0 |main_#t~malloc23.offset|)), 39331#(and (= main_~newNode~0.offset 0) (= 12 (select |#length| main_~newNode~0.base))), 39332#(and (= main_~newNode~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (= 12 (select |#length| main_~newNode~0.base)))] [2018-04-11 13:22:43,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:43,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:22:43,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:22:43,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:22:43,162 INFO L87 Difference]: Start difference. First operand 431 states and 576 transitions. Second operand 5 states. [2018-04-11 13:22:43,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:43,339 INFO L93 Difference]: Finished difference Result 902 states and 1239 transitions. [2018-04-11 13:22:43,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 13:22:43,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-04-11 13:22:43,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:43,342 INFO L225 Difference]: With dead ends: 902 [2018-04-11 13:22:43,342 INFO L226 Difference]: Without dead ends: 902 [2018-04-11 13:22:43,342 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:22:43,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2018-04-11 13:22:43,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 422. [2018-04-11 13:22:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-04-11 13:22:43,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 567 transitions. [2018-04-11 13:22:43,347 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 567 transitions. Word has length 42 [2018-04-11 13:22:43,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:43,347 INFO L459 AbstractCegarLoop]: Abstraction has 422 states and 567 transitions. [2018-04-11 13:22:43,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:22:43,347 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 567 transitions. [2018-04-11 13:22:43,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 13:22:43,347 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:43,347 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:43,347 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:43,347 INFO L82 PathProgramCache]: Analyzing trace with hash 891196517, now seen corresponding path program 1 times [2018-04-11 13:22:43,348 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:43,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:43,490 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:43,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-04-11 13:22:43,490 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:43,490 INFO L182 omatonBuilderFactory]: Interpolants [40672#(and (or (not (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= |main_#t~mem42.base| main_~tmp~0.base)) (not (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select |#memory_$Pointer$.base| main_~tmp~0.base)))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem41.base|) (= 1 (select |#valid| main_~tmp~0.base))), 40673#(and (= 1 (select |#valid| main_~tmp~0.base)) (or (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) main_~tmp~0.base)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))), 40674#(or (not (= 0 |main_#t~mem47.offset|)) (and (= 1 (select |#valid| main_~tmp~0.base)) (not (= |main_#t~mem47.base| main_~tmp~0.base)))), 40675#(and (= 1 (select |#valid| main_~tmp~0.base)) (not (= |main_#t~mem47.base| main_~tmp~0.base))), 40676#(= 1 (select |#valid| main_~tmp~0.base)), 40661#true, 40662#false, 40663#(and (not (= 0 |main_#t~malloc0.base|)) (= |main_#t~malloc0.offset| 0)), 40664#(and (= main_~tree~0.offset 0) (not (= 0 main_~tree~0.base))), 40665#(and (= 1 (select |#valid| main_~tree~0.base)) (= main_~tree~0.offset 0) (not (= 0 main_~tree~0.base))), 40666#(and (= main_~tmp~0.offset 0) (= 1 (select |#valid| main_~tmp~0.base)) (not (= 0 main_~tmp~0.base))), 40667#(and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0) |main_#t~mem33.base|) (= 1 (select |#valid| main_~tmp~0.base)) (not (= 0 main_~tmp~0.base))), 40668#(and (or (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0) main_~tmp~0.base)) |main_#t~short35|) (= 1 (select |#valid| main_~tmp~0.base))), 40669#(and (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0) main_~tmp~0.base)) (= 1 (select |#valid| main_~tmp~0.base))), 40670#(and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem41.base|) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0) main_~tmp~0.base)) (= 1 (select |#valid| main_~tmp~0.base))), 40671#(and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem41.base|) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0) main_~tmp~0.base)) (= 1 (select |#valid| main_~tmp~0.base)) (= |main_#t~mem40.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem40.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))] [2018-04-11 13:22:43,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:43,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 13:22:43,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 13:22:43,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-04-11 13:22:43,491 INFO L87 Difference]: Start difference. First operand 422 states and 567 transitions. Second operand 16 states. [2018-04-11 13:22:44,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:44,336 INFO L93 Difference]: Finished difference Result 740 states and 921 transitions. [2018-04-11 13:22:44,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 13:22:44,336 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-04-11 13:22:44,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:44,338 INFO L225 Difference]: With dead ends: 740 [2018-04-11 13:22:44,338 INFO L226 Difference]: Without dead ends: 740 [2018-04-11 13:22:44,338 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=348, Invalid=1292, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 13:22:44,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2018-04-11 13:22:44,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 452. [2018-04-11 13:22:44,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-04-11 13:22:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 612 transitions. [2018-04-11 13:22:44,341 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 612 transitions. Word has length 43 [2018-04-11 13:22:44,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:44,341 INFO L459 AbstractCegarLoop]: Abstraction has 452 states and 612 transitions. [2018-04-11 13:22:44,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 13:22:44,341 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 612 transitions. [2018-04-11 13:22:44,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 13:22:44,342 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:44,342 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:44,342 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:44,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1802679286, now seen corresponding path program 1 times [2018-04-11 13:22:44,342 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:44,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:44,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:44,476 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:22:44,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 13:22:44,477 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:44,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:44,477 INFO L182 omatonBuilderFactory]: Interpolants [41920#false, 41921#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= (select |#valid| main_~tree~0.base) 1)), 41922#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~malloc1.base|))), 41923#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 41924#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 41925#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~malloc5.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 41926#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 41927#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~mem8.base|)) (not (= main_~tree~0.base main_~tmpList~0.base))), 41928#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 41929#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 41930#(and (= |main_#t~mem10.offset| 0) (= 0 |main_#t~mem10.base|)), 41931#(not |main_#t~short12|), 41919#true] [2018-04-11 13:22:44,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:44,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 13:22:44,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 13:22:44,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-04-11 13:22:44,477 INFO L87 Difference]: Start difference. First operand 452 states and 612 transitions. Second operand 13 states. [2018-04-11 13:22:45,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:45,066 INFO L93 Difference]: Finished difference Result 704 states and 896 transitions. [2018-04-11 13:22:45,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 13:22:45,066 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2018-04-11 13:22:45,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:45,068 INFO L225 Difference]: With dead ends: 704 [2018-04-11 13:22:45,068 INFO L226 Difference]: Without dead ends: 704 [2018-04-11 13:22:45,068 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2018-04-11 13:22:45,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2018-04-11 13:22:45,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 469. [2018-04-11 13:22:45,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-04-11 13:22:45,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 634 transitions. [2018-04-11 13:22:45,071 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 634 transitions. Word has length 45 [2018-04-11 13:22:45,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:45,071 INFO L459 AbstractCegarLoop]: Abstraction has 469 states and 634 transitions. [2018-04-11 13:22:45,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 13:22:45,071 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 634 transitions. [2018-04-11 13:22:45,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 13:22:45,072 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:45,072 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:45,072 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:45,072 INFO L82 PathProgramCache]: Analyzing trace with hash 509694365, now seen corresponding path program 1 times [2018-04-11 13:22:45,072 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:45,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:45,237 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:22:45,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 13:22:45,237 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:45,237 INFO L182 omatonBuilderFactory]: Interpolants [43136#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 43137#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~malloc5.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 43138#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 43139#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~mem8.base|)) (not (= main_~tree~0.base main_~tmpList~0.base))), 43140#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 43141#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 43142#(and (= |main_#t~mem33.base| 0) (= |main_#t~mem33.offset| 0)), 43143#(not |main_#t~short35|), 43131#true, 43132#false, 43133#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= (select |#valid| main_~tree~0.base) 1)), 43134#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~malloc1.base|))), 43135#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1))] [2018-04-11 13:22:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:45,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 13:22:45,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 13:22:45,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-04-11 13:22:45,238 INFO L87 Difference]: Start difference. First operand 469 states and 634 transitions. Second operand 13 states. [2018-04-11 13:22:45,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:45,904 INFO L93 Difference]: Finished difference Result 694 states and 882 transitions. [2018-04-11 13:22:45,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 13:22:45,904 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-04-11 13:22:45,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:45,905 INFO L225 Difference]: With dead ends: 694 [2018-04-11 13:22:45,905 INFO L226 Difference]: Without dead ends: 694 [2018-04-11 13:22:45,906 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=643, Unknown=0, NotChecked=0, Total=870 [2018-04-11 13:22:45,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2018-04-11 13:22:45,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 524. [2018-04-11 13:22:45,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-04-11 13:22:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 719 transitions. [2018-04-11 13:22:45,909 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 719 transitions. Word has length 46 [2018-04-11 13:22:45,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:45,909 INFO L459 AbstractCegarLoop]: Abstraction has 524 states and 719 transitions. [2018-04-11 13:22:45,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 13:22:45,909 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 719 transitions. [2018-04-11 13:22:45,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 13:22:45,909 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:45,910 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:45,910 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:45,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1319746159, now seen corresponding path program 1 times [2018-04-11 13:22:45,910 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:45,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:46,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:46,023 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:22:46,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 13:22:46,024 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:46,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:46,024 INFO L182 omatonBuilderFactory]: Interpolants [44396#true, 44397#false, 44398#(= (select |#valid| main_~tree~0.base) 1), 44399#(not (= main_~tree~0.base |main_#t~malloc1.base|)), 44400#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 44401#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 44402#(and (not (= main_~tree~0.base |main_#t~malloc5.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 44403#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 44404#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 44405#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 44406#(and (not (= main_~tree~0.base |main_#t~mem8.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 44407#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 44408#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 44409#(= 1 (select |#valid| |main_#t~mem40.base|))] [2018-04-11 13:22:46,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:46,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 13:22:46,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 13:22:46,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:22:46,025 INFO L87 Difference]: Start difference. First operand 524 states and 719 transitions. Second operand 14 states. [2018-04-11 13:22:46,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:46,602 INFO L93 Difference]: Finished difference Result 754 states and 976 transitions. [2018-04-11 13:22:46,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 13:22:46,602 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2018-04-11 13:22:46,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:46,603 INFO L225 Difference]: With dead ends: 754 [2018-04-11 13:22:46,603 INFO L226 Difference]: Without dead ends: 754 [2018-04-11 13:22:46,603 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=161, Invalid=595, Unknown=0, NotChecked=0, Total=756 [2018-04-11 13:22:46,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-04-11 13:22:46,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 529. [2018-04-11 13:22:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-04-11 13:22:46,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 725 transitions. [2018-04-11 13:22:46,607 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 725 transitions. Word has length 47 [2018-04-11 13:22:46,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:46,607 INFO L459 AbstractCegarLoop]: Abstraction has 529 states and 725 transitions. [2018-04-11 13:22:46,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 13:22:46,607 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 725 transitions. [2018-04-11 13:22:46,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 13:22:46,607 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:46,607 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:46,608 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:46,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1319746158, now seen corresponding path program 1 times [2018-04-11 13:22:46,608 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:46,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:46,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:46,773 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:22:46,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-11 13:22:46,773 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:46,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:46,774 INFO L182 omatonBuilderFactory]: Interpolants [45728#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 45729#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem8.base|)) (not (= main_~tree~0.base main_~tmpList~0.base)) (= |main_#t~mem8.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 45730#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 45731#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 45732#(and (<= 4 (select |#length| |main_#t~mem40.base|)) (= |main_#t~mem40.offset| 0)), 45721#true, 45722#false, 45723#(= (select |#valid| main_~tree~0.base) 1), 45724#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 45725#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 45726#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem2.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 45727#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc5.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))] [2018-04-11 13:22:46,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:46,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 13:22:46,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 13:22:46,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-04-11 13:22:46,774 INFO L87 Difference]: Start difference. First operand 529 states and 725 transitions. Second operand 12 states. [2018-04-11 13:22:47,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:47,346 INFO L93 Difference]: Finished difference Result 766 states and 988 transitions. [2018-04-11 13:22:47,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 13:22:47,347 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-04-11 13:22:47,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:47,348 INFO L225 Difference]: With dead ends: 766 [2018-04-11 13:22:47,348 INFO L226 Difference]: Without dead ends: 766 [2018-04-11 13:22:47,348 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:22:47,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2018-04-11 13:22:47,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 529. [2018-04-11 13:22:47,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-04-11 13:22:47,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 724 transitions. [2018-04-11 13:22:47,351 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 724 transitions. Word has length 47 [2018-04-11 13:22:47,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:47,351 INFO L459 AbstractCegarLoop]: Abstraction has 529 states and 724 transitions. [2018-04-11 13:22:47,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 13:22:47,351 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 724 transitions. [2018-04-11 13:22:47,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 13:22:47,352 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:47,352 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, 1, 1] [2018-04-11 13:22:47,352 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:47,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1681070032, now seen corresponding path program 1 times [2018-04-11 13:22:47,352 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:47,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:47,591 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-11 13:22:47,592 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:22:47,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-11 13:22:47,592 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:47,592 INFO L182 omatonBuilderFactory]: Interpolants [47056#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= |old(#valid)| (store (store |#valid| main_~tree~0.base 0) |main_#t~malloc1.base| 0)) (= 0 main_~tree~0.offset)), 47057#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) |old(#valid)|)), 47058#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) |old(#valid)|)), 47059#(and (= |old(#valid)| (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 47060#(and (not (= |main_#t~mem47.base| main_~tmp~0.base)) (= (store (store |#valid| main_~tmp~0.base 0) |main_#t~mem47.base| 0) |old(#valid)|)), 47061#(= (store |#valid| main_~tmp~0.base 0) |old(#valid)|), 47050#true, 47051#false, 47052#(= |#valid| |old(#valid)|), 47053#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (= 0 |main_#t~malloc0.offset|)), 47054#(and (= (store |#valid| main_~tree~0.base 0) |old(#valid)|) (= 0 main_~tree~0.offset)), 47055#(and (= (store |#valid| main_~tree~0.base 0) |old(#valid)|) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1))] [2018-04-11 13:22:47,592 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-11 13:22:47,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 13:22:47,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 13:22:47,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-04-11 13:22:47,593 INFO L87 Difference]: Start difference. First operand 529 states and 724 transitions. Second operand 12 states. [2018-04-11 13:22:48,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:48,092 INFO L93 Difference]: Finished difference Result 619 states and 827 transitions. [2018-04-11 13:22:48,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 13:22:48,092 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-04-11 13:22:48,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:48,093 INFO L225 Difference]: With dead ends: 619 [2018-04-11 13:22:48,093 INFO L226 Difference]: Without dead ends: 617 [2018-04-11 13:22:48,093 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-04-11 13:22:48,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-04-11 13:22:48,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 537. [2018-04-11 13:22:48,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-04-11 13:22:48,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 732 transitions. [2018-04-11 13:22:48,097 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 732 transitions. Word has length 48 [2018-04-11 13:22:48,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:48,097 INFO L459 AbstractCegarLoop]: Abstraction has 537 states and 732 transitions. [2018-04-11 13:22:48,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 13:22:48,097 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 732 transitions. [2018-04-11 13:22:48,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 13:22:48,098 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:48,098 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:48,098 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:48,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1681072013, now seen corresponding path program 1 times [2018-04-11 13:22:48,098 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:48,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:48,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:48,119 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:48,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:22:48,119 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:48,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:48,120 INFO L182 omatonBuilderFactory]: Interpolants [48236#true, 48237#false, 48238#(and (= main_~tree~0.base 0) (= main_~tree~0.offset 0))] [2018-04-11 13:22:48,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:48,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 13:22:48,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 13:22:48,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:22:48,120 INFO L87 Difference]: Start difference. First operand 537 states and 732 transitions. Second operand 3 states. [2018-04-11 13:22:48,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:48,130 INFO L93 Difference]: Finished difference Result 525 states and 679 transitions. [2018-04-11 13:22:48,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 13:22:48,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-04-11 13:22:48,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:48,131 INFO L225 Difference]: With dead ends: 525 [2018-04-11 13:22:48,131 INFO L226 Difference]: Without dead ends: 500 [2018-04-11 13:22:48,131 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 13:22:48,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-04-11 13:22:48,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 484. [2018-04-11 13:22:48,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-04-11 13:22:48,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 654 transitions. [2018-04-11 13:22:48,134 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 654 transitions. Word has length 48 [2018-04-11 13:22:48,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:48,134 INFO L459 AbstractCegarLoop]: Abstraction has 484 states and 654 transitions. [2018-04-11 13:22:48,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 13:22:48,135 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 654 transitions. [2018-04-11 13:22:48,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 13:22:48,135 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:48,135 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:48,135 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:48,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1629524322, now seen corresponding path program 1 times [2018-04-11 13:22:48,135 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:48,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:48,319 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:48,320 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:22:48,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 13:22:48,320 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:48,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:48,320 INFO L182 omatonBuilderFactory]: Interpolants [49248#true, 49249#false, 49250#(= (select |#valid| main_~tree~0.base) 1), 49251#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= (select |#valid| main_~tree~0.base) 1)), 49252#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~malloc1.base|))), 49253#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 49254#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 49255#(and (not (= main_~tree~0.base |main_#t~malloc5.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 49256#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 49257#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~mem8.base|)) (not (= main_~tree~0.base main_~tmpList~0.base))), 49258#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))), 49259#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))), 49260#(and (= 0 |main_#t~mem34.base|) (= |main_#t~mem34.offset| 0)), 49261#(not |main_#t~short35|)] [2018-04-11 13:22:48,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:48,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 13:22:48,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 13:22:48,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:22:48,321 INFO L87 Difference]: Start difference. First operand 484 states and 654 transitions. Second operand 14 states. [2018-04-11 13:22:48,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:48,965 INFO L93 Difference]: Finished difference Result 599 states and 780 transitions. [2018-04-11 13:22:48,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 13:22:48,965 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-04-11 13:22:48,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:48,966 INFO L225 Difference]: With dead ends: 599 [2018-04-11 13:22:48,966 INFO L226 Difference]: Without dead ends: 599 [2018-04-11 13:22:48,966 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2018-04-11 13:22:48,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-04-11 13:22:48,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 438. [2018-04-11 13:22:48,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-04-11 13:22:48,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 578 transitions. [2018-04-11 13:22:48,969 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 578 transitions. Word has length 48 [2018-04-11 13:22:48,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:48,969 INFO L459 AbstractCegarLoop]: Abstraction has 438 states and 578 transitions. [2018-04-11 13:22:48,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 13:22:48,969 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 578 transitions. [2018-04-11 13:22:48,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 13:22:48,970 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:48,970 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:48,970 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:48,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1806446818, now seen corresponding path program 1 times [2018-04-11 13:22:48,971 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:48,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:49,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:49,307 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:49,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-04-11 13:22:49,307 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:49,307 INFO L182 omatonBuilderFactory]: Interpolants [50336#(and (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base |main_#t~malloc25.base|)) (or (= |main_#t~malloc25.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))), 50337#(and (or (= (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 50338#(and (not (= |main_#t~mem26.base| main_~tree~0.base)) (or (and (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))), 50339#(and (not (= |main_#t~mem26.base| main_~tree~0.base)) (or (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))), 50340#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 50341#(= 1 (select |#valid| |main_#t~mem30.base|)), 50323#true, 50324#false, 50325#(= 0 |main_#t~malloc0.offset|), 50326#(= 0 main_~tree~0.offset), 50327#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 50328#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 main_~tree~0.offset) (= 1 (select |#valid| |main_#t~malloc1.base|))), 50329#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 50330#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 50331#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 50332#(and (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= main_~tmp~0.base main_~tree~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tmp~0.base) 1)), 50333#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= main_~tree~0.base main_~tmp~0.base) (not (= main_~tmp~0.base |main_#t~malloc19.base|))), 50334#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 50335#(and (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))] [2018-04-11 13:22:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:49,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 13:22:49,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 13:22:49,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-04-11 13:22:49,308 INFO L87 Difference]: Start difference. First operand 438 states and 578 transitions. Second operand 19 states. [2018-04-11 13:22:50,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:50,250 INFO L93 Difference]: Finished difference Result 874 states and 1110 transitions. [2018-04-11 13:22:50,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 13:22:50,251 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-04-11 13:22:50,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:50,251 INFO L225 Difference]: With dead ends: 874 [2018-04-11 13:22:50,252 INFO L226 Difference]: Without dead ends: 874 [2018-04-11 13:22:50,252 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=296, Invalid=826, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 13:22:50,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2018-04-11 13:22:50,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 497. [2018-04-11 13:22:50,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-04-11 13:22:50,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 662 transitions. [2018-04-11 13:22:50,255 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 662 transitions. Word has length 49 [2018-04-11 13:22:50,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:50,255 INFO L459 AbstractCegarLoop]: Abstraction has 497 states and 662 transitions. [2018-04-11 13:22:50,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 13:22:50,256 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 662 transitions. [2018-04-11 13:22:50,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 13:22:50,256 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:50,256 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:50,256 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:50,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1806446819, now seen corresponding path program 1 times [2018-04-11 13:22:50,256 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:50,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:50,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-11 13:22:50,698 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:50,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-04-11 13:22:50,698 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:50,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-11 13:22:50,698 INFO L182 omatonBuilderFactory]: Interpolants [51744#false, 51745#(= 0 |main_#t~malloc0.offset|), 51746#(= 0 main_~tree~0.offset), 51747#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 51748#(and (= 4 (select |#length| |main_#t~malloc1.base|)) (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|) (= 0 main_~tree~0.offset)), 51749#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 51750#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 51751#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 51752#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 51753#(and (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.base main_~tmp~0.base) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmp~0.base |main_#t~malloc19.base|))), 51754#(and (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))))), 51755#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1)), 51756#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 51757#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 51758#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 51759#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 51760#(and (= 4 (select |#length| |main_#t~mem30.base|)) (= |main_#t~mem30.offset| 0)), 51743#true] [2018-04-11 13:22:50,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-11 13:22:50,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 13:22:50,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 13:22:50,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:22:50,699 INFO L87 Difference]: Start difference. First operand 497 states and 662 transitions. Second operand 18 states. [2018-04-11 13:22:52,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:52,083 INFO L93 Difference]: Finished difference Result 876 states and 1112 transitions. [2018-04-11 13:22:52,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 13:22:52,084 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-04-11 13:22:52,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:52,085 INFO L225 Difference]: With dead ends: 876 [2018-04-11 13:22:52,085 INFO L226 Difference]: Without dead ends: 876 [2018-04-11 13:22:52,085 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=328, Invalid=1004, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 13:22:52,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2018-04-11 13:22:52,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 497. [2018-04-11 13:22:52,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-04-11 13:22:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 661 transitions. [2018-04-11 13:22:52,089 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 661 transitions. Word has length 49 [2018-04-11 13:22:52,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:52,089 INFO L459 AbstractCegarLoop]: Abstraction has 497 states and 661 transitions. [2018-04-11 13:22:52,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 13:22:52,089 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 661 transitions. [2018-04-11 13:22:52,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 13:22:52,090 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:52,090 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:52,090 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:52,090 INFO L82 PathProgramCache]: Analyzing trace with hash -8372055, now seen corresponding path program 1 times [2018-04-11 13:22:52,090 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:52,097 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:52,185 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:52,186 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:22:52,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-11 13:22:52,186 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:52,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:52,186 INFO L182 omatonBuilderFactory]: Interpolants [53172#true, 53173#false, 53174#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 53175#(and (= 12 (select |#length| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 53176#(and (= 12 (select |#length| main_~tree~0.base)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 53177#(and (= 12 (select |#length| main_~tmp~0.base)) (= 0 main_~tree~0.offset) (= main_~tmp~0.base main_~tree~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 53178#(and (= 12 (select |#length| main_~tmp~0.base)) (= 0 main_~tree~0.offset) (= main_~tmp~0.base main_~tree~0.base)), 53179#(and (= 12 (select |#length| main_~tmp~0.base)) (= main_~tmp~0.offset 0))] [2018-04-11 13:22:52,187 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:52,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 13:22:52,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 13:22:52,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:22:52,187 INFO L87 Difference]: Start difference. First operand 497 states and 661 transitions. Second operand 8 states. [2018-04-11 13:22:52,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:52,484 INFO L93 Difference]: Finished difference Result 696 states and 861 transitions. [2018-04-11 13:22:52,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 13:22:52,485 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-04-11 13:22:52,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:52,486 INFO L225 Difference]: With dead ends: 696 [2018-04-11 13:22:52,486 INFO L226 Difference]: Without dead ends: 696 [2018-04-11 13:22:52,486 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-04-11 13:22:52,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2018-04-11 13:22:52,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 399. [2018-04-11 13:22:52,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-04-11 13:22:52,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 494 transitions. [2018-04-11 13:22:52,491 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 494 transitions. Word has length 50 [2018-04-11 13:22:52,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:52,491 INFO L459 AbstractCegarLoop]: Abstraction has 399 states and 494 transitions. [2018-04-11 13:22:52,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 13:22:52,491 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 494 transitions. [2018-04-11 13:22:52,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 13:22:52,492 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:52,492 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:52,492 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:52,492 INFO L82 PathProgramCache]: Analyzing trace with hash 165276669, now seen corresponding path program 1 times [2018-04-11 13:22:52,493 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:52,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:52,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:52,527 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:52,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:22:52,527 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:52,527 INFO L182 omatonBuilderFactory]: Interpolants [54283#true, 54284#false, 54285#(= 1 (select |#valid| |main_#t~malloc29.base|)), 54286#(= 1 (select |#valid| main_~tmpList~0.base))] [2018-04-11 13:22:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:52,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:22:52,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:22:52,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:22:52,528 INFO L87 Difference]: Start difference. First operand 399 states and 494 transitions. Second operand 4 states. [2018-04-11 13:22:52,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:52,741 INFO L93 Difference]: Finished difference Result 770 states and 952 transitions. [2018-04-11 13:22:52,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 13:22:52,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-04-11 13:22:52,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:52,742 INFO L225 Difference]: With dead ends: 770 [2018-04-11 13:22:52,743 INFO L226 Difference]: Without dead ends: 770 [2018-04-11 13:22:52,743 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-11 13:22:52,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2018-04-11 13:22:52,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 398. [2018-04-11 13:22:52,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-04-11 13:22:52,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 493 transitions. [2018-04-11 13:22:52,746 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 493 transitions. Word has length 50 [2018-04-11 13:22:52,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:52,746 INFO L459 AbstractCegarLoop]: Abstraction has 398 states and 493 transitions. [2018-04-11 13:22:52,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:22:52,746 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 493 transitions. [2018-04-11 13:22:52,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 13:22:52,746 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:52,747 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:52,747 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:52,747 INFO L82 PathProgramCache]: Analyzing trace with hash 165276670, now seen corresponding path program 1 times [2018-04-11 13:22:52,747 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:52,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:52,781 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:52,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 13:22:52,781 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:52,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:52,782 INFO L182 omatonBuilderFactory]: Interpolants [55458#true, 55459#false, 55460#(and (= 0 |main_#t~malloc29.offset|) (= 4 (select |#length| |main_#t~malloc29.base|))), 55461#(and (= main_~tmpList~0.offset 0) (= 4 (select |#length| main_~tmpList~0.base)))] [2018-04-11 13:22:52,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:52,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 13:22:52,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 13:22:52,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 13:22:52,782 INFO L87 Difference]: Start difference. First operand 398 states and 493 transitions. Second operand 4 states. [2018-04-11 13:22:52,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:52,951 INFO L93 Difference]: Finished difference Result 734 states and 914 transitions. [2018-04-11 13:22:52,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 13:22:52,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-04-11 13:22:52,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:52,952 INFO L225 Difference]: With dead ends: 734 [2018-04-11 13:22:52,953 INFO L226 Difference]: Without dead ends: 734 [2018-04-11 13:22:52,953 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-11 13:22:52,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-04-11 13:22:52,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 397. [2018-04-11 13:22:52,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-04-11 13:22:52,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 492 transitions. [2018-04-11 13:22:52,957 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 492 transitions. Word has length 50 [2018-04-11 13:22:52,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:52,958 INFO L459 AbstractCegarLoop]: Abstraction has 397 states and 492 transitions. [2018-04-11 13:22:52,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 13:22:52,958 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 492 transitions. [2018-04-11 13:22:52,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 13:22:52,958 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:52,958 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:52,958 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:52,959 INFO L82 PathProgramCache]: Analyzing trace with hash -426931142, now seen corresponding path program 1 times [2018-04-11 13:22:52,959 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:52,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:53,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:53,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:22:53,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-11 13:22:53,103 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:53,104 INFO L182 omatonBuilderFactory]: Interpolants [56596#true, 56597#false, 56598#(= (select |#valid| main_~tree~0.base) 1), 56599#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 56600#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 56601#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem2.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 56602#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc5.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 56603#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 56604#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem8.base|)) (not (= main_~tree~0.base main_~tmpList~0.base))), 56605#(= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))), 56606#(= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))), 56607#(= 0 |main_#t~mem47.offset|)] [2018-04-11 13:22:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:53,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 13:22:53,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 13:22:53,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-04-11 13:22:53,105 INFO L87 Difference]: Start difference. First operand 397 states and 492 transitions. Second operand 12 states. [2018-04-11 13:22:53,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:53,576 INFO L93 Difference]: Finished difference Result 537 states and 625 transitions. [2018-04-11 13:22:53,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 13:22:53,577 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-04-11 13:22:53,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:53,577 INFO L225 Difference]: With dead ends: 537 [2018-04-11 13:22:53,577 INFO L226 Difference]: Without dead ends: 537 [2018-04-11 13:22:53,578 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:22:53,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-04-11 13:22:53,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 400. [2018-04-11 13:22:53,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-04-11 13:22:53,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 496 transitions. [2018-04-11 13:22:53,582 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 496 transitions. Word has length 50 [2018-04-11 13:22:53,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:53,582 INFO L459 AbstractCegarLoop]: Abstraction has 400 states and 496 transitions. [2018-04-11 13:22:53,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 13:22:53,583 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 496 transitions. [2018-04-11 13:22:53,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 13:22:53,583 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:53,583 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:53,583 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:53,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1555912094, now seen corresponding path program 1 times [2018-04-11 13:22:53,584 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:53,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:54,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:54,042 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:54,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-04-11 13:22:54,042 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:54,042 INFO L182 omatonBuilderFactory]: Interpolants [57569#true, 57570#false, 57571#(= 0 |main_#t~malloc0.offset|), 57572#(= 0 main_~tree~0.offset), 57573#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 57574#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 main_~tree~0.offset) (= 1 (select |#valid| |main_#t~malloc1.base|))), 57575#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 57576#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 57577#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 57578#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= main_~tree~0.base main_~tmp~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tmp~0.base) 1)), 57579#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (not (= main_~tmp~0.base |main_#t~malloc23.base|)) (= main_~tree~0.base main_~tmp~0.base)), 57580#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 57581#(and (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 57582#(and (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base |main_#t~malloc25.base|)) (or (= |main_#t~malloc25.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))), 57583#(and (or (= (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 57584#(and (not (= |main_#t~mem26.base| main_~tree~0.base)) (or (and (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))), 57585#(and (not (= |main_#t~mem26.base| main_~tree~0.base)) (or (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))), 57586#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 57587#(= 1 (select |#valid| |main_#t~mem30.base|))] [2018-04-11 13:22:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:54,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 13:22:54,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 13:22:54,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-04-11 13:22:54,043 INFO L87 Difference]: Start difference. First operand 400 states and 496 transitions. Second operand 19 states. [2018-04-11 13:22:55,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:55,288 INFO L93 Difference]: Finished difference Result 757 states and 914 transitions. [2018-04-11 13:22:55,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 13:22:55,288 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2018-04-11 13:22:55,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:55,290 INFO L225 Difference]: With dead ends: 757 [2018-04-11 13:22:55,290 INFO L226 Difference]: Without dead ends: 757 [2018-04-11 13:22:55,290 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=296, Invalid=826, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 13:22:55,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-04-11 13:22:55,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 463. [2018-04-11 13:22:55,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-04-11 13:22:55,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 583 transitions. [2018-04-11 13:22:55,296 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 583 transitions. Word has length 53 [2018-04-11 13:22:55,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:55,296 INFO L459 AbstractCegarLoop]: Abstraction has 463 states and 583 transitions. [2018-04-11 13:22:55,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 13:22:55,296 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 583 transitions. [2018-04-11 13:22:55,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 13:22:55,297 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:55,297 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:55,297 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:55,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1555912095, now seen corresponding path program 1 times [2018-04-11 13:22:55,298 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:55,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:55,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-11 13:22:55,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:55,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-04-11 13:22:55,758 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:55,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:55,758 INFO L182 omatonBuilderFactory]: Interpolants [58848#(and (not (= main_~tree~0.base |main_#t~malloc23.base|)) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= main_~tmp~0.base main_~tree~0.base) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))))), 58849#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))))), 58850#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1)), 58851#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 58852#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 58853#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 58854#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 58855#(and (= 4 (select |#length| |main_#t~mem30.base|)) (= |main_#t~mem30.offset| 0)), 58838#true, 58839#false, 58840#(= 0 |main_#t~malloc0.offset|), 58841#(= 0 main_~tree~0.offset), 58842#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 58843#(and (= 4 (select |#length| |main_#t~malloc1.base|)) (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|) (= 0 main_~tree~0.offset)), 58844#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 58845#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 58846#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 58847#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1) (= main_~tree~0.base main_~tmp~0.base))] [2018-04-11 13:22:55,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:55,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 13:22:55,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 13:22:55,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:22:55,759 INFO L87 Difference]: Start difference. First operand 463 states and 583 transitions. Second operand 18 states. [2018-04-11 13:22:57,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:57,042 INFO L93 Difference]: Finished difference Result 760 states and 917 transitions. [2018-04-11 13:22:57,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 13:22:57,042 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2018-04-11 13:22:57,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:57,043 INFO L225 Difference]: With dead ends: 760 [2018-04-11 13:22:57,043 INFO L226 Difference]: Without dead ends: 760 [2018-04-11 13:22:57,044 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=328, Invalid=1004, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 13:22:57,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-04-11 13:22:57,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 459. [2018-04-11 13:22:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-04-11 13:22:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 578 transitions. [2018-04-11 13:22:57,048 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 578 transitions. Word has length 53 [2018-04-11 13:22:57,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:57,049 INFO L459 AbstractCegarLoop]: Abstraction has 459 states and 578 transitions. [2018-04-11 13:22:57,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 13:22:57,049 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 578 transitions. [2018-04-11 13:22:57,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 13:22:57,049 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:57,049 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:57,050 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:57,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1724885864, now seen corresponding path program 1 times [2018-04-11 13:22:57,050 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:57,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:57,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:57,151 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:57,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 13:22:57,151 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:57,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:57,152 INFO L182 omatonBuilderFactory]: Interpolants [60113#true, 60114#false, 60115#(= 0 |main_#t~malloc0.offset|), 60116#(= main_~tree~0.offset 0), 60117#(and (= main_~tree~0.offset 0) (= 4 (select |#length| |main_#t~malloc29.base|))), 60118#(or (and (= main_~tree~0.offset 0) (= 4 (select |#length| main_~tree~0.base))) (not (= main_~tree~0.base main_~tmpList~0.base))), 60119#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (= |main_#t~mem30.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 60120#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 60121#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 60122#(= 1 (select |#valid| |main_#t~mem32.base|))] [2018-04-11 13:22:57,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:57,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 13:22:57,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 13:22:57,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:22:57,152 INFO L87 Difference]: Start difference. First operand 459 states and 578 transitions. Second operand 10 states. [2018-04-11 13:22:57,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:57,498 INFO L93 Difference]: Finished difference Result 760 states and 951 transitions. [2018-04-11 13:22:57,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 13:22:57,499 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-04-11 13:22:57,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:57,500 INFO L225 Difference]: With dead ends: 760 [2018-04-11 13:22:57,500 INFO L226 Difference]: Without dead ends: 760 [2018-04-11 13:22:57,500 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:22:57,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-04-11 13:22:57,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 458. [2018-04-11 13:22:57,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-04-11 13:22:57,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 577 transitions. [2018-04-11 13:22:57,506 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 577 transitions. Word has length 53 [2018-04-11 13:22:57,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:57,507 INFO L459 AbstractCegarLoop]: Abstraction has 458 states and 577 transitions. [2018-04-11 13:22:57,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 13:22:57,507 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 577 transitions. [2018-04-11 13:22:57,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 13:22:57,508 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:57,508 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:57,508 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:57,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1724885865, now seen corresponding path program 1 times [2018-04-11 13:22:57,509 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:57,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:57,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:57,663 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:22:57,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 13:22:57,663 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:57,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:57,664 INFO L182 omatonBuilderFactory]: Interpolants [61360#(= main_~tree~0.offset 0), 61361#(and (= main_~tree~0.offset 0) (= 4 (select |#length| |main_#t~malloc29.base|))), 61362#(and (= main_~tree~0.offset 0) (or (not (= main_~tree~0.base main_~tmpList~0.base)) (= 4 (select |#length| main_~tree~0.base)))), 61363#(and (= main_~tree~0.offset 0) (not (= (select |#length| main_~tree~0.base) 4)) (= |main_#t~mem30.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= |main_#t~mem30.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 61364#(and (= main_~tree~0.offset 0) (<= (+ (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= (select |#length| main_~tree~0.base) 4)) (not (= main_~tree~0.base main_~tmpList~0.base))), 61365#(and (= main_~tree~0.offset 0) (<= (+ (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= (select |#length| main_~tree~0.base) 4))), 61366#(and (<= 0 |main_#t~mem32.offset|) (<= (+ |main_#t~mem32.offset| 4) (select |#length| |main_#t~mem32.base|))), 61357#true, 61358#false, 61359#(= 0 |main_#t~malloc0.offset|)] [2018-04-11 13:22:57,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:57,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 13:22:57,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 13:22:57,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-04-11 13:22:57,664 INFO L87 Difference]: Start difference. First operand 458 states and 577 transitions. Second operand 10 states. [2018-04-11 13:22:58,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:58,017 INFO L93 Difference]: Finished difference Result 759 states and 950 transitions. [2018-04-11 13:22:58,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 13:22:58,017 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-04-11 13:22:58,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:58,018 INFO L225 Difference]: With dead ends: 759 [2018-04-11 13:22:58,018 INFO L226 Difference]: Without dead ends: 759 [2018-04-11 13:22:58,018 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2018-04-11 13:22:58,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-04-11 13:22:58,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 457. [2018-04-11 13:22:58,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-04-11 13:22:58,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 576 transitions. [2018-04-11 13:22:58,020 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 576 transitions. Word has length 53 [2018-04-11 13:22:58,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:58,021 INFO L459 AbstractCegarLoop]: Abstraction has 457 states and 576 transitions. [2018-04-11 13:22:58,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 13:22:58,021 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 576 transitions. [2018-04-11 13:22:58,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 13:22:58,021 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:58,021 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:58,021 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:58,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1273760456, now seen corresponding path program 1 times [2018-04-11 13:22:58,022 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:58,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:58,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:58,132 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:22:58,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 13:22:58,133 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:58,133 INFO L182 omatonBuilderFactory]: Interpolants [62599#true, 62600#false, 62601#(= (select |#valid| main_~tree~0.base) 1), 62602#(not (= main_~tree~0.base |main_#t~malloc1.base|)), 62603#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 62604#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 62605#(and (not (= main_~tree~0.base |main_#t~malloc5.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 62606#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 62607#(and (= 1 (select |#valid| main_~tmpList~0.base)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 62608#(and (= |main_#t~mem8.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| main_~tmpList~0.base)) (not (= main_~tree~0.base |main_#t~mem8.base|)) (= |main_#t~mem8.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 62609#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 62610#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 62611#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= |main_#t~mem43.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem43.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 62612#(= 1 (select |#valid| |main_#t~mem44.base|)), 62613#(= 1 (select |#valid| main_~tmpList~0.base))] [2018-04-11 13:22:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:58,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 13:22:58,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 13:22:58,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-04-11 13:22:58,134 INFO L87 Difference]: Start difference. First operand 457 states and 576 transitions. Second operand 15 states. [2018-04-11 13:22:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:22:58,857 INFO L93 Difference]: Finished difference Result 756 states and 899 transitions. [2018-04-11 13:22:58,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 13:22:58,857 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2018-04-11 13:22:58,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:22:58,858 INFO L225 Difference]: With dead ends: 756 [2018-04-11 13:22:58,858 INFO L226 Difference]: Without dead ends: 756 [2018-04-11 13:22:58,858 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=727, Unknown=0, NotChecked=0, Total=930 [2018-04-11 13:22:58,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-04-11 13:22:58,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 462. [2018-04-11 13:22:58,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-04-11 13:22:58,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 582 transitions. [2018-04-11 13:22:58,861 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 582 transitions. Word has length 53 [2018-04-11 13:22:58,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:22:58,861 INFO L459 AbstractCegarLoop]: Abstraction has 462 states and 582 transitions. [2018-04-11 13:22:58,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 13:22:58,861 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 582 transitions. [2018-04-11 13:22:58,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 13:22:58,862 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:22:58,862 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:22:58,862 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:22:58,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1273760455, now seen corresponding path program 1 times [2018-04-11 13:22:58,863 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:22:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:22:58,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:22:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:59,371 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:22:59,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 13:22:59,371 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:22:59,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:59,371 INFO L182 omatonBuilderFactory]: Interpolants [63872#(and (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~malloc5.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~malloc5.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc5.base|)) (= 4 (select |#length| |main_#t~malloc5.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 63873#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 4 (select |#length| main_~tmpList~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmpList~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tmpList~0.base))), 63874#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| |main_#t~mem6.base|) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= |main_#t~mem6.base| main_~tmpList~0.base)) (not (= main_~tree~0.base main_~tmpList~0.base)) (= main_~tmpList~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem6.base|) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 4 (select |#length| main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 63875#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 4 (select |#length| main_~tmpList~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmpList~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 63876#(and (= |main_#t~mem8.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tmpList~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem8.base|) |main_#t~mem8.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem8.base|)) (not (= main_~tree~0.base main_~tmpList~0.base)) (= |main_#t~mem8.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| main_~tmpList~0.base)) (= (select (select |#memory_$Pointer$.offset| |main_#t~mem8.base|) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 63877#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))))), 63878#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))), 63879#(and (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem41.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem41.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))), 63880#(and (= |main_#t~mem41.offset| (select (select |#memory_$Pointer$.offset| |main_#t~mem40.base|) |main_#t~mem40.offset|)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= |main_#t~mem40.offset| 0) (= |main_#t~mem40.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem40.offset| |main_#t~mem41.offset|) (= |main_#t~mem40.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 63881#(and (= |main_#t~mem42.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (<= 0 |main_#t~mem41.offset|) (<= |main_#t~mem41.offset| 0) (= |main_#t~mem41.offset| |main_#t~mem42.offset|)), 63882#(and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (<= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (<= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)), 63883#(and (<= (select (select |#memory_$Pointer$.offset| |main_#t~mem43.base|) |main_#t~mem43.offset|) 0) (<= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem43.base|) |main_#t~mem43.offset|)) (= |main_#t~mem43.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= |main_#t~mem43.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 63884#(and (= 4 (select |#length| |main_#t~mem44.base|)) (<= 0 |main_#t~mem44.offset|) (<= |main_#t~mem44.offset| 0)), 63885#(and (<= main_~tmpList~0.offset 0) (<= 0 main_~tmpList~0.offset) (= 4 (select |#length| main_~tmpList~0.base))), 63864#true, 63865#false, 63866#(= (select |#valid| main_~tree~0.base) 1), 63867#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 63868#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 63869#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem2.base|)) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem2.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| main_~tree~0.base) 1)), 63870#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 0 |main_#t~mem3.offset|) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem2.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| main_~tree~0.base) 1) (= |main_#t~mem3.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 63871#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1))] [2018-04-11 13:22:59,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:22:59,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 13:22:59,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 13:22:59,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:22:59,372 INFO L87 Difference]: Start difference. First operand 462 states and 582 transitions. Second operand 22 states. [2018-04-11 13:23:00,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:00,695 INFO L93 Difference]: Finished difference Result 618 states and 729 transitions. [2018-04-11 13:23:00,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 13:23:00,695 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2018-04-11 13:23:00,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:00,695 INFO L225 Difference]: With dead ends: 618 [2018-04-11 13:23:00,695 INFO L226 Difference]: Without dead ends: 618 [2018-04-11 13:23:00,696 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=292, Invalid=1430, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 13:23:00,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-04-11 13:23:00,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 465. [2018-04-11 13:23:00,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-04-11 13:23:00,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 586 transitions. [2018-04-11 13:23:00,698 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 586 transitions. Word has length 53 [2018-04-11 13:23:00,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:00,698 INFO L459 AbstractCegarLoop]: Abstraction has 465 states and 586 transitions. [2018-04-11 13:23:00,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 13:23:00,698 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 586 transitions. [2018-04-11 13:23:00,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 13:23:00,699 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:00,699 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:00,699 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:00,699 INFO L82 PathProgramCache]: Analyzing trace with hash -831868191, now seen corresponding path program 1 times [2018-04-11 13:23:00,699 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:00,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:00,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 13:23:00,721 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:23:00,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 13:23:00,721 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:00,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:00,722 INFO L182 omatonBuilderFactory]: Interpolants [65009#true, 65010#false, 65011#(= |main_#t~mem40.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))), 65012#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 65013#(= 1 (select |#valid| |main_#t~mem45.base|))] [2018-04-11 13:23:00,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 13:23:00,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:23:00,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:23:00,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:23:00,722 INFO L87 Difference]: Start difference. First operand 465 states and 586 transitions. Second operand 5 states. [2018-04-11 13:23:00,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:00,875 INFO L93 Difference]: Finished difference Result 464 states and 582 transitions. [2018-04-11 13:23:00,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 13:23:00,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-04-11 13:23:00,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:00,876 INFO L225 Difference]: With dead ends: 464 [2018-04-11 13:23:00,876 INFO L226 Difference]: Without dead ends: 464 [2018-04-11 13:23:00,876 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 13:23:00,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-04-11 13:23:00,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2018-04-11 13:23:00,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2018-04-11 13:23:00,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 582 transitions. [2018-04-11 13:23:00,879 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 582 transitions. Word has length 54 [2018-04-11 13:23:00,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:00,879 INFO L459 AbstractCegarLoop]: Abstraction has 464 states and 582 transitions. [2018-04-11 13:23:00,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:23:00,879 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 582 transitions. [2018-04-11 13:23:00,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 13:23:00,879 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:00,879 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:00,880 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:00,880 INFO L82 PathProgramCache]: Analyzing trace with hash -831868190, now seen corresponding path program 1 times [2018-04-11 13:23:00,880 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:00,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 13:23:00,917 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:23:00,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 13:23:00,917 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:00,917 INFO L182 omatonBuilderFactory]: Interpolants [65947#false, 65946#true, 65949#(and (<= |main_#t~mem43.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (<= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem43.offset|) (= |main_#t~mem43.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 65948#(= |main_#t~mem40.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))), 65951#(and (<= 0 |main_#t~mem45.offset|) (<= (+ |main_#t~mem45.offset| 4) (select |#length| |main_#t~mem45.base|))), 65950#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))] [2018-04-11 13:23:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 13:23:00,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 13:23:00,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 13:23:00,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 13:23:00,918 INFO L87 Difference]: Start difference. First operand 464 states and 582 transitions. Second operand 6 states. [2018-04-11 13:23:01,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:01,153 INFO L93 Difference]: Finished difference Result 463 states and 578 transitions. [2018-04-11 13:23:01,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 13:23:01,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-04-11 13:23:01,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:01,154 INFO L225 Difference]: With dead ends: 463 [2018-04-11 13:23:01,154 INFO L226 Difference]: Without dead ends: 463 [2018-04-11 13:23:01,154 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:23:01,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-04-11 13:23:01,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2018-04-11 13:23:01,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-04-11 13:23:01,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 578 transitions. [2018-04-11 13:23:01,156 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 578 transitions. Word has length 54 [2018-04-11 13:23:01,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:01,157 INFO L459 AbstractCegarLoop]: Abstraction has 463 states and 578 transitions. [2018-04-11 13:23:01,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 13:23:01,157 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 578 transitions. [2018-04-11 13:23:01,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 13:23:01,157 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:01,157 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:01,157 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:01,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1261495612, now seen corresponding path program 1 times [2018-04-11 13:23:01,158 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:01,165 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:02,000 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:02,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 13:23:02,001 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:02,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:02,001 INFO L182 omatonBuilderFactory]: Interpolants [66883#false, 66882#true, 66885#(= 0 main_~tree~0.offset), 66884#(= 0 |main_#t~malloc0.offset|), 66887#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 66886#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 66889#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 66888#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 main_~tree~0.offset)), 66891#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= main_~tree~0.base main_~tmp~0.base)), 66890#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 66893#(and (or |main_#t~short12| (and (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))))) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= main_~tree~0.base main_~tmp~0.base)), 66892#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) |main_#t~mem10.offset|) (= 0 main_~tree~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= (select |#valid| main_~tree~0.base) 1) (= main_~tree~0.base main_~tmp~0.base)), 66895#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) |main_#t~malloc19.offset|) (= 0 main_~tree~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tmp~0.base main_~tree~0.base) (not (= main_~tree~0.base |main_#t~malloc19.base|))), 66894#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) 0) (= 0 main_~tree~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= (select |#valid| main_~tree~0.base) 1) (= main_~tree~0.base main_~tmp~0.base)), 66897#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 66896#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (not (= main_~tmp~0.base main_~newNode~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tmp~0.base main_~tree~0.base) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) main_~newNode~0.offset)), 66899#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 66898#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 66901#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset)), 66900#(and (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset)), 66903#(and (= |main_#t~mem11.offset| 0) (= main_~tmp~0.offset 0) (= |main_#t~mem11.base| 0)), 66902#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= main_~tmp~0.offset 0)), 66904#(and (= main_~tmp~0.offset 0) (not |main_#t~short12|))] [2018-04-11 13:23:02,001 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:02,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 13:23:02,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 13:23:02,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:23:02,001 INFO L87 Difference]: Start difference. First operand 463 states and 578 transitions. Second operand 23 states. [2018-04-11 13:23:03,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:03,940 INFO L93 Difference]: Finished difference Result 906 states and 1059 transitions. [2018-04-11 13:23:03,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 13:23:03,941 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 60 [2018-04-11 13:23:03,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:03,941 INFO L225 Difference]: With dead ends: 906 [2018-04-11 13:23:03,942 INFO L226 Difference]: Without dead ends: 906 [2018-04-11 13:23:03,942 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=860, Invalid=2220, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 13:23:03,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2018-04-11 13:23:03,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 437. [2018-04-11 13:23:03,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-04-11 13:23:03,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 536 transitions. [2018-04-11 13:23:03,946 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 536 transitions. Word has length 60 [2018-04-11 13:23:03,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:03,946 INFO L459 AbstractCegarLoop]: Abstraction has 437 states and 536 transitions. [2018-04-11 13:23:03,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 13:23:03,946 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 536 transitions. [2018-04-11 13:23:03,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 13:23:03,946 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:03,946 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:03,946 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:03,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1115327643, now seen corresponding path program 1 times [2018-04-11 13:23:03,947 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:03,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:04,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:04,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:04,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 13:23:04,130 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:04,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-11 13:23:04,130 INFO L182 omatonBuilderFactory]: Interpolants [68321#(and (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~malloc5.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc5.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 68320#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 68323#(and (not (= main_~tree~0.base |main_#t~mem8.base|)) (not (= main_~tree~0.base main_~tmpList~0.base)) (= |main_#t~mem8.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem8.offset| 0) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tmpList~0.base))), 68322#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tmpList~0.base))), 68325#(not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))), 68324#(not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0))), 68327#(and (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= |main_#t~mem40.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem40.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 68326#(and (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 68329#(not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)), 68328#(and (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (or (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem42.base|)))), 68330#(not (= |main_#t~mem47.offset| 0)), 68315#false, 68314#true, 68317#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 68316#(= (select |#valid| main_~tree~0.base) 1), 68319#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem2.base|)) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| main_~tree~0.base) 1)), 68318#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1))] [2018-04-11 13:23:04,130 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:04,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 13:23:04,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 13:23:04,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-04-11 13:23:04,130 INFO L87 Difference]: Start difference. First operand 437 states and 536 transitions. Second operand 17 states. [2018-04-11 13:23:04,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:04,866 INFO L93 Difference]: Finished difference Result 545 states and 638 transitions. [2018-04-11 13:23:04,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 13:23:04,866 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 60 [2018-04-11 13:23:04,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:04,866 INFO L225 Difference]: With dead ends: 545 [2018-04-11 13:23:04,866 INFO L226 Difference]: Without dead ends: 543 [2018-04-11 13:23:04,867 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=870, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 13:23:04,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-04-11 13:23:04,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 435. [2018-04-11 13:23:04,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-04-11 13:23:04,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 533 transitions. [2018-04-11 13:23:04,869 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 533 transitions. Word has length 60 [2018-04-11 13:23:04,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:04,869 INFO L459 AbstractCegarLoop]: Abstraction has 435 states and 533 transitions. [2018-04-11 13:23:04,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 13:23:04,869 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 533 transitions. [2018-04-11 13:23:04,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 13:23:04,870 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:04,870 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:04,870 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:04,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1599938534, now seen corresponding path program 1 times [2018-04-11 13:23:04,871 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:04,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:05,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:05,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 13:23:05,286 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:05,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:05,286 INFO L182 omatonBuilderFactory]: Interpolants [69345#(= 0 |main_#t~malloc0.offset|), 69344#false, 69347#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 69346#(= 0 main_~tree~0.offset), 69349#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 69348#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|) (= 0 main_~tree~0.offset)), 69351#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= |main_#t~malloc5.base| main_~tree~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 69350#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem2.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 69353#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 69352#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 69355#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0)))), 69354#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem8.base|)) (not (= main_~tree~0.base main_~tmpList~0.base)) (= |main_#t~mem8.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= |main_#t~mem8.offset| 0)), 69357#(and (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem41.offset|) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= |main_#t~mem41.offset| 0) (= main_~tmp~0.offset 0) (= 1 (select |#valid| main_~tmp~0.base))), 69356#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= main_~tmp~0.offset 0) (= 1 (select |#valid| main_~tmp~0.base))), 69359#(and (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem41.offset|) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= |main_#t~mem42.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= |main_#t~mem41.offset| 0) (= main_~tmp~0.offset 0) (= 1 (select |#valid| main_~tmp~0.base))), 69358#(and (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem41.offset|) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= |main_#t~mem41.offset| 0) (= main_~tmp~0.offset 0) (= 1 (select |#valid| main_~tmp~0.base)) (= |main_#t~mem40.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem40.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 69361#(and (or (and (= |main_#t~mem43.offset| (select (select |#memory_$Pointer$.offset| |main_#t~mem43.base|) |main_#t~mem43.offset|)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= |main_#t~mem43.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem43.base|) |main_#t~mem43.offset|)))) (= main_~tmp~0.offset 0) (= 1 (select |#valid| main_~tmp~0.base))), 69360#(and (or (not (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (and (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))) (= main_~tmp~0.offset 0) (= 1 (select |#valid| main_~tmp~0.base))), 69363#(or (not (= 0 main_~tmpList~0.offset)) (and (not (= main_~tmpList~0.base main_~tmp~0.base)) (= 1 (select |#valid| main_~tmp~0.base)))), 69362#(and (or (not (= |main_#t~mem44.offset| 0)) (not (= main_~tmp~0.base |main_#t~mem44.base|))) (= main_~tmp~0.offset 0) (= 1 (select |#valid| main_~tmp~0.base))), 69365#(= 1 (select |#valid| main_~tmp~0.base)), 69364#(and (not (= main_~tmpList~0.base main_~tmp~0.base)) (= 1 (select |#valid| main_~tmp~0.base))), 69343#true] [2018-04-11 13:23:05,286 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:05,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 13:23:05,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 13:23:05,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:23:05,287 INFO L87 Difference]: Start difference. First operand 435 states and 533 transitions. Second operand 23 states. [2018-04-11 13:23:06,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:06,532 INFO L93 Difference]: Finished difference Result 580 states and 674 transitions. [2018-04-11 13:23:06,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 13:23:06,533 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 60 [2018-04-11 13:23:06,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:06,533 INFO L225 Difference]: With dead ends: 580 [2018-04-11 13:23:06,533 INFO L226 Difference]: Without dead ends: 580 [2018-04-11 13:23:06,533 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=523, Invalid=2233, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 13:23:06,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-04-11 13:23:06,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 437. [2018-04-11 13:23:06,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-04-11 13:23:06,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 535 transitions. [2018-04-11 13:23:06,536 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 535 transitions. Word has length 60 [2018-04-11 13:23:06,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:06,536 INFO L459 AbstractCegarLoop]: Abstraction has 437 states and 535 transitions. [2018-04-11 13:23:06,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 13:23:06,537 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 535 transitions. [2018-04-11 13:23:06,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 13:23:06,537 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:06,537 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:06,537 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:06,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1009835691, now seen corresponding path program 1 times [2018-04-11 13:23:06,538 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:06,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:06,644 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:06,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:06,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 13:23:06,644 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:06,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:06,645 INFO L182 omatonBuilderFactory]: Interpolants [70443#true, 70445#(= (select |#valid| main_~tree~0.base) 1), 70444#false, 70447#(and (= main_~tmp~0.base main_~tree~0.base) (not (= main_~tree~0.base |main_#t~malloc19.base|)) (= main_~tmp~0.offset main_~tree~0.offset)), 70446#(and (= (select |#valid| main_~tree~0.base) 1) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 70449#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1)), 70448#(and (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 70451#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 1 (select |#valid| main_~newNode~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 70450#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 70453#(and (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)))), 70452#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 1 (select |#valid| main_~newNode~0.base))), 70455#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 70454#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))), 70457#(= 1 (select |#valid| main_~tmp~0.base)), 70456#(= 1 (select |#valid| |main_#t~mem37.base|))] [2018-04-11 13:23:06,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:06,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 13:23:06,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 13:23:06,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-04-11 13:23:06,645 INFO L87 Difference]: Start difference. First operand 437 states and 535 transitions. Second operand 15 states. [2018-04-11 13:23:07,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:07,666 INFO L93 Difference]: Finished difference Result 992 states and 1177 transitions. [2018-04-11 13:23:07,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 13:23:07,666 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2018-04-11 13:23:07,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:07,667 INFO L225 Difference]: With dead ends: 992 [2018-04-11 13:23:07,667 INFO L226 Difference]: Without dead ends: 992 [2018-04-11 13:23:07,667 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=326, Invalid=864, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 13:23:07,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-04-11 13:23:07,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 506. [2018-04-11 13:23:07,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-04-11 13:23:07,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 630 transitions. [2018-04-11 13:23:07,671 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 630 transitions. Word has length 61 [2018-04-11 13:23:07,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:07,671 INFO L459 AbstractCegarLoop]: Abstraction has 506 states and 630 transitions. [2018-04-11 13:23:07,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 13:23:07,671 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 630 transitions. [2018-04-11 13:23:07,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 13:23:07,671 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:07,671 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:07,671 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:07,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1009835692, now seen corresponding path program 1 times [2018-04-11 13:23:07,672 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:07,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:07,830 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:07,830 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:07,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 13:23:07,830 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:07,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:07,831 INFO L182 omatonBuilderFactory]: Interpolants [72001#(and (= main_~newNode~0.offset 0) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 72000#(and (= 0 |main_#t~malloc19.offset|) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (not (= main_~tmp~0.base |main_#t~malloc19.base|))), 72003#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 72002#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~tree~0.base) 1)), 72005#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= |main_#t~mem26.base| main_~tree~0.base)) (<= (+ main_~newNode~0.offset 12) (select |#length| main_~newNode~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= main_~newNode~0.offset 0)), 72004#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (<= (+ main_~newNode~0.offset 12) (select |#length| main_~newNode~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= main_~newNode~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 72007#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)))), 72006#(and (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)))), 72009#(and (= 0 |main_#t~mem37.offset|) (<= 12 (select |#length| |main_#t~mem37.base|))), 72008#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))), 72010#(and (<= 12 (select |#length| main_~tmp~0.base)) (= main_~tmp~0.offset 0)), 71997#false, 71996#true, 71999#(and (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 71998#(= (select |#valid| main_~tree~0.base) 1)] [2018-04-11 13:23:07,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:07,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 13:23:07,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 13:23:07,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-04-11 13:23:07,831 INFO L87 Difference]: Start difference. First operand 506 states and 630 transitions. Second operand 15 states. [2018-04-11 13:23:09,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:09,145 INFO L93 Difference]: Finished difference Result 1134 states and 1339 transitions. [2018-04-11 13:23:09,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 13:23:09,145 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2018-04-11 13:23:09,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:09,146 INFO L225 Difference]: With dead ends: 1134 [2018-04-11 13:23:09,146 INFO L226 Difference]: Without dead ends: 1134 [2018-04-11 13:23:09,146 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 13:23:09,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2018-04-11 13:23:09,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 539. [2018-04-11 13:23:09,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-04-11 13:23:09,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 680 transitions. [2018-04-11 13:23:09,149 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 680 transitions. Word has length 61 [2018-04-11 13:23:09,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:09,149 INFO L459 AbstractCegarLoop]: Abstraction has 539 states and 680 transitions. [2018-04-11 13:23:09,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 13:23:09,150 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 680 transitions. [2018-04-11 13:23:09,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 13:23:09,150 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:09,150 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:09,150 INFO L408 AbstractCegarLoop]: === Iteration 67 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:09,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1015561329, now seen corresponding path program 1 times [2018-04-11 13:23:09,150 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:09,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 13:23:09,199 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:23:09,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 13:23:09,199 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:09,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:09,200 INFO L182 omatonBuilderFactory]: Interpolants [73723#false, 73722#true, 73725#(or (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) 0)) (not |main_#t~short35|) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) 0))), 73724#(and (= |main_#t~mem33.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= |main_#t~mem33.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset))), 73727#(or (not (= |main_#t~mem36.base| 0)) (not (= |main_#t~mem36.offset| 0))), 73726#(or (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) 0)))] [2018-04-11 13:23:09,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 13:23:09,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 13:23:09,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 13:23:09,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 13:23:09,200 INFO L87 Difference]: Start difference. First operand 539 states and 680 transitions. Second operand 6 states. [2018-04-11 13:23:09,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:09,296 INFO L93 Difference]: Finished difference Result 540 states and 677 transitions. [2018-04-11 13:23:09,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 13:23:09,297 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-04-11 13:23:09,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:09,297 INFO L225 Difference]: With dead ends: 540 [2018-04-11 13:23:09,297 INFO L226 Difference]: Without dead ends: 540 [2018-04-11 13:23:09,297 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-04-11 13:23:09,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-04-11 13:23:09,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 539. [2018-04-11 13:23:09,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-04-11 13:23:09,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 677 transitions. [2018-04-11 13:23:09,300 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 677 transitions. Word has length 61 [2018-04-11 13:23:09,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:09,300 INFO L459 AbstractCegarLoop]: Abstraction has 539 states and 677 transitions. [2018-04-11 13:23:09,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 13:23:09,300 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 677 transitions. [2018-04-11 13:23:09,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 13:23:09,301 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:09,301 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:09,301 INFO L408 AbstractCegarLoop]: === Iteration 68 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:09,301 INFO L82 PathProgramCache]: Analyzing trace with hash 972744023, now seen corresponding path program 1 times [2018-04-11 13:23:09,301 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:09,308 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:09,372 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:09,372 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:23:09,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 13:23:09,372 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:09,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:09,372 INFO L182 omatonBuilderFactory]: Interpolants [74817#(or (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 74816#(and (or (and (or (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (+ main_~tree~0.offset 8) |main_#t~mem32.offset|)) (or (= 1 (select |#valid| main_~tmpList~0.base)) (not (= (+ main_~tree~0.offset 8) |main_#t~mem32.offset|)))) (not (= main_~tree~0.base |main_#t~mem32.base|))) (or (= main_~tree~0.base |main_#t~mem32.base|) (= |main_#t~mem32.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 74818#(= 1 (select |#valid| |main_#t~mem30.base|)), 74813#true, 74815#(= 1 (select |#valid| main_~tmpList~0.base)), 74814#false] [2018-04-11 13:23:09,372 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:09,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 13:23:09,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 13:23:09,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 13:23:09,373 INFO L87 Difference]: Start difference. First operand 539 states and 677 transitions. Second operand 6 states. [2018-04-11 13:23:09,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:09,646 INFO L93 Difference]: Finished difference Result 938 states and 1177 transitions. [2018-04-11 13:23:09,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 13:23:09,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-04-11 13:23:09,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:09,647 INFO L225 Difference]: With dead ends: 938 [2018-04-11 13:23:09,647 INFO L226 Difference]: Without dead ends: 938 [2018-04-11 13:23:09,647 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-04-11 13:23:09,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-04-11 13:23:09,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 546. [2018-04-11 13:23:09,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2018-04-11 13:23:09,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 686 transitions. [2018-04-11 13:23:09,651 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 686 transitions. Word has length 61 [2018-04-11 13:23:09,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:09,651 INFO L459 AbstractCegarLoop]: Abstraction has 546 states and 686 transitions. [2018-04-11 13:23:09,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 13:23:09,651 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 686 transitions. [2018-04-11 13:23:09,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 13:23:09,651 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:09,651 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:09,651 INFO L408 AbstractCegarLoop]: === Iteration 69 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:09,651 INFO L82 PathProgramCache]: Analyzing trace with hash 972744024, now seen corresponding path program 1 times [2018-04-11 13:23:09,652 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:09,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:10,151 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:10,151 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:10,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 13:23:10,151 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:10,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:10,151 INFO L182 omatonBuilderFactory]: Interpolants [76321#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 76320#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 main_~tree~0.offset)), 76323#(and (= main_~tree~0.offset 0) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1) (= main_~tmp~0.base main_~tree~0.base)), 76322#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 76325#(and (= main_~tree~0.offset 0) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (not (= main_~tmp~0.base main_~newNode~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tree~0.base main_~tmp~0.base)), 76324#(and (= main_~tree~0.offset 0) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc19.base|)) (= main_~tree~0.base main_~tmp~0.base)), 76327#(and (= main_~tree~0.offset 0) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 76326#(and (= main_~tree~0.offset 0) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 76329#(and (= main_~tree~0.offset 0) (not (= |main_#t~mem26.base| main_~tree~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 76328#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 76331#(and (= main_~tree~0.offset 0) (or (= main_~tree~0.base |main_#t~malloc29.base|) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (or (not (= main_~tree~0.base |main_#t~malloc29.base|)) (= 4 (select |#length| |main_#t~malloc29.base|)))), 76330#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 76333#(and (= main_~tree~0.offset 0) (= |main_#t~mem30.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmpList~0.base main_~tree~0.base))), 76332#(and (= main_~tree~0.offset 0) (or (and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmpList~0.base main_~tree~0.base))) (= 4 (select |#length| main_~tree~0.base)))), 76335#(and (= main_~tree~0.offset 0) (= |main_#t~mem32.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem32.base|)) (= |main_#t~mem32.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 76334#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmpList~0.base main_~tree~0.base))), 76337#(and (= main_~tree~0.offset 0) (<= (+ (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 76336#(and (= main_~tree~0.offset 0) (<= (+ (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 76338#(and (<= 0 |main_#t~mem30.offset|) (<= (+ |main_#t~mem30.offset| 4) (select |#length| |main_#t~mem30.base|))), 76315#true, 76317#(= 0 |main_#t~malloc0.offset|), 76316#false, 76319#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 76318#(= 0 main_~tree~0.offset)] [2018-04-11 13:23:10,151 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:10,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 13:23:10,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 13:23:10,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:23:10,152 INFO L87 Difference]: Start difference. First operand 546 states and 686 transitions. Second operand 24 states. [2018-04-11 13:23:12,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:12,398 INFO L93 Difference]: Finished difference Result 1282 states and 1572 transitions. [2018-04-11 13:23:12,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 13:23:12,399 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 61 [2018-04-11 13:23:12,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:12,400 INFO L225 Difference]: With dead ends: 1282 [2018-04-11 13:23:12,400 INFO L226 Difference]: Without dead ends: 1282 [2018-04-11 13:23:12,400 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=868, Invalid=2324, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 13:23:12,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2018-04-11 13:23:12,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 662. [2018-04-11 13:23:12,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-04-11 13:23:12,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 848 transitions. [2018-04-11 13:23:12,405 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 848 transitions. Word has length 61 [2018-04-11 13:23:12,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:12,405 INFO L459 AbstractCegarLoop]: Abstraction has 662 states and 848 transitions. [2018-04-11 13:23:12,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 13:23:12,405 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 848 transitions. [2018-04-11 13:23:12,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 13:23:12,405 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:12,405 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:12,405 INFO L408 AbstractCegarLoop]: === Iteration 70 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:12,406 INFO L82 PathProgramCache]: Analyzing trace with hash -2130375603, now seen corresponding path program 1 times [2018-04-11 13:23:12,406 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:12,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:12,862 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:12,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 13:23:12,862 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:12,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:12,863 INFO L182 omatonBuilderFactory]: Interpolants [78369#(and (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 78368#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 78371#(= 1 (select |#valid| |main_#t~mem30.base|)), 78370#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 78349#true, 78351#(= 0 |main_#t~malloc0.offset|), 78350#false, 78353#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 78352#(= 0 main_~tree~0.offset), 78355#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 78354#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 main_~tree~0.offset)), 78357#(and (not (= main_~tree~0.base |main_#t~malloc5.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 78356#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 78359#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 78358#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 78361#(and (not (= main_~tree~0.base |main_#t~mem8.base|)) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 78360#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 78363#(and (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= (select |#valid| main_~tree~0.base) 1) (= main_~tree~0.base main_~tmp~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 78362#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 78365#(and (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) 1) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 78364#(and (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) 1) (not (= main_~tree~0.base |main_#t~malloc19.base|)) (= main_~tree~0.base main_~tmp~0.base)), 78367#(and (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base |main_#t~malloc25.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 78366#(and (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))] [2018-04-11 13:23:12,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:12,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 13:23:12,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 13:23:12,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:23:12,863 INFO L87 Difference]: Start difference. First operand 662 states and 848 transitions. Second operand 23 states. [2018-04-11 13:23:13,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:13,956 INFO L93 Difference]: Finished difference Result 1090 states and 1344 transitions. [2018-04-11 13:23:13,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 13:23:13,957 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 61 [2018-04-11 13:23:13,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:13,957 INFO L225 Difference]: With dead ends: 1090 [2018-04-11 13:23:13,957 INFO L226 Difference]: Without dead ends: 1090 [2018-04-11 13:23:13,958 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=509, Invalid=1561, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 13:23:13,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-04-11 13:23:13,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 721. [2018-04-11 13:23:13,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-04-11 13:23:13,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 930 transitions. [2018-04-11 13:23:13,961 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 930 transitions. Word has length 61 [2018-04-11 13:23:13,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:13,962 INFO L459 AbstractCegarLoop]: Abstraction has 721 states and 930 transitions. [2018-04-11 13:23:13,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 13:23:13,962 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 930 transitions. [2018-04-11 13:23:13,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 13:23:13,962 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:13,962 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:13,962 INFO L408 AbstractCegarLoop]: === Iteration 71 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:13,962 INFO L82 PathProgramCache]: Analyzing trace with hash -2130375602, now seen corresponding path program 1 times [2018-04-11 13:23:13,963 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:13,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:14,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:14,576 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:14,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 13:23:14,576 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:14,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:14,576 INFO L182 omatonBuilderFactory]: Interpolants [80229#true, 80231#(= 0 |main_#t~malloc0.offset|), 80230#false, 80233#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 80232#(= 0 main_~tree~0.offset), 80235#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 80234#(and (= 4 (select |#length| |main_#t~malloc1.base|)) (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|) (= 0 main_~tree~0.offset)), 80237#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc5.base|)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 80236#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 80239#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| |main_#t~mem6.base|)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 80238#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 80241#(and (= 4 (select |#length| |main_#t~mem8.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem8.base|)) (not (= main_~tree~0.base main_~tmpList~0.base)) (= |main_#t~mem8.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 80240#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 80243#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 80242#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 80245#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (or (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) 1)) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 80244#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (or (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)) |main_#t~malloc19.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) 1)) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.base main_~tmp~0.base) (not (= main_~tmp~0.base |main_#t~malloc19.base|))), 80247#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~newNode~0.base main_~tree~0.base)) (or (and (or (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (and (= |main_#t~malloc25.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| |main_#t~malloc25.base|)))) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 80246#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (or (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1)), 80249#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 1 (select |#valid| main_~newNode~0.base)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (or (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1))), 80248#(and (or (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| main_~newNode~0.base)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 80251#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 80250#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= |main_#t~mem26.base| main_~tree~0.base)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (or (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1))), 80253#(and (<= 4 (select |#length| |main_#t~mem30.base|)) (= |main_#t~mem30.offset| 0)), 80252#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))] [2018-04-11 13:23:14,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:14,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 13:23:14,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 13:23:14,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2018-04-11 13:23:14,577 INFO L87 Difference]: Start difference. First operand 721 states and 930 transitions. Second operand 25 states. [2018-04-11 13:23:16,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:16,732 INFO L93 Difference]: Finished difference Result 1078 states and 1346 transitions. [2018-04-11 13:23:16,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 13:23:16,733 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 61 [2018-04-11 13:23:16,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:16,733 INFO L225 Difference]: With dead ends: 1078 [2018-04-11 13:23:16,733 INFO L226 Difference]: Without dead ends: 1078 [2018-04-11 13:23:16,734 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=540, Invalid=1910, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 13:23:16,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2018-04-11 13:23:16,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 721. [2018-04-11 13:23:16,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-04-11 13:23:16,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 930 transitions. [2018-04-11 13:23:16,738 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 930 transitions. Word has length 61 [2018-04-11 13:23:16,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:16,738 INFO L459 AbstractCegarLoop]: Abstraction has 721 states and 930 transitions. [2018-04-11 13:23:16,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 13:23:16,738 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 930 transitions. [2018-04-11 13:23:16,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 13:23:16,738 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:16,738 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:16,738 INFO L408 AbstractCegarLoop]: === Iteration 72 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:16,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1299733059, now seen corresponding path program 1 times [2018-04-11 13:23:16,739 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:16,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:16,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:16,847 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:16,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 13:23:16,848 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:16,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:16,848 INFO L182 omatonBuilderFactory]: Interpolants [82113#(not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0)), 82112#(and (not (= |main_#t~mem26.base| main_~tree~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0))), 82115#(and (= |main_#t~mem33.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) 0))), 82114#(not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) 0)), 82116#|main_#t~short35|, 82103#true, 82105#(= (select |#valid| main_~tree~0.base) 1), 82104#false, 82107#(and (not (= |main_#t~malloc19.base| 0)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (not (= main_~tmp~0.base |main_#t~malloc19.base|))), 82106#(and (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 82109#(and (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0)) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1)), 82108#(and (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (not (= main_~newNode~0.base 0)) (= main_~tmp~0.offset main_~tree~0.offset)), 82111#(and (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 82110#(and (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0)) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base |main_#t~malloc25.base|)))] [2018-04-11 13:23:16,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:16,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 13:23:16,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 13:23:16,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:23:16,849 INFO L87 Difference]: Start difference. First operand 721 states and 930 transitions. Second operand 14 states. [2018-04-11 13:23:17,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:17,730 INFO L93 Difference]: Finished difference Result 1386 states and 1719 transitions. [2018-04-11 13:23:17,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 13:23:17,730 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2018-04-11 13:23:17,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:17,731 INFO L225 Difference]: With dead ends: 1386 [2018-04-11 13:23:17,731 INFO L226 Difference]: Without dead ends: 1386 [2018-04-11 13:23:17,731 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=321, Invalid=1011, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 13:23:17,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2018-04-11 13:23:17,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 721. [2018-04-11 13:23:17,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-04-11 13:23:17,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 929 transitions. [2018-04-11 13:23:17,737 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 929 transitions. Word has length 62 [2018-04-11 13:23:17,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:17,737 INFO L459 AbstractCegarLoop]: Abstraction has 721 states and 929 transitions. [2018-04-11 13:23:17,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 13:23:17,737 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 929 transitions. [2018-04-11 13:23:17,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 13:23:17,737 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:17,737 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:17,737 INFO L408 AbstractCegarLoop]: === Iteration 73 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:17,737 INFO L82 PathProgramCache]: Analyzing trace with hash -57352567, now seen corresponding path program 1 times [2018-04-11 13:23:17,738 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:17,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:18,297 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:18,297 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:18,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 13:23:18,297 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:18,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:18,298 INFO L182 omatonBuilderFactory]: Interpolants [84289#(and (= main_~tmp~0.offset 0) (or (and (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem43.base|) |main_#t~mem43.offset|) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem43.base|) |main_#t~mem43.offset|))))), 84288#(and (or (not (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (and (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))) (= main_~tmp~0.offset 0)), 84291#(and (or (not (= 0 main_~tmpList~0.offset)) (and (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))) (= main_~tmp~0.offset 0)), 84290#(and (= main_~tmp~0.offset 0) (or (and (not (= |main_#t~mem44.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (not (= 0 |main_#t~mem44.offset|)))), 84293#(and (or (not (= 0 main_~tmpList~0.offset)) (and (not (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))) (= main_~tmp~0.offset 0)), 84292#(and (or (not (= 0 main_~tmpList~0.offset)) (and (not (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmp~0.base |main_#t~mem45.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))) (= main_~tmp~0.offset 0)), 84295#(and (= main_~tmp~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 84294#(and (= main_~tmp~0.offset 0) (not (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 84296#(= 1 (select |#valid| |main_#t~mem40.base|)), 84271#false, 84270#true, 84273#(= 0 main_~tree~0.offset), 84272#(= 0 |main_#t~malloc0.offset|), 84275#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|) (= 0 main_~tree~0.offset)), 84274#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 84277#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 84276#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 84279#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 84278#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc5.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 84281#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 84280#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 84283#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 84282#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem8.base|)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 84285#(and (= |main_#t~mem41.offset| 0) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmp~0.offset 0) (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 84284#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmp~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 84287#(and (= |main_#t~mem42.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= |main_#t~mem41.offset| 0) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmp~0.offset 0) (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem42.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 84286#(and (= |main_#t~mem41.offset| 0) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmp~0.offset 0) (= |main_#t~mem40.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem40.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))] [2018-04-11 13:23:18,298 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:18,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 13:23:18,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 13:23:18,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2018-04-11 13:23:18,298 INFO L87 Difference]: Start difference. First operand 721 states and 929 transitions. Second operand 27 states. [2018-04-11 13:23:19,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:19,664 INFO L93 Difference]: Finished difference Result 863 states and 1072 transitions. [2018-04-11 13:23:19,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 13:23:19,664 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 62 [2018-04-11 13:23:19,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:19,665 INFO L225 Difference]: With dead ends: 863 [2018-04-11 13:23:19,665 INFO L226 Difference]: Without dead ends: 863 [2018-04-11 13:23:19,665 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=458, Invalid=2848, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 13:23:19,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2018-04-11 13:23:19,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 725. [2018-04-11 13:23:19,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-04-11 13:23:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 934 transitions. [2018-04-11 13:23:19,668 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 934 transitions. Word has length 62 [2018-04-11 13:23:19,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:19,669 INFO L459 AbstractCegarLoop]: Abstraction has 725 states and 934 transitions. [2018-04-11 13:23:19,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 13:23:19,669 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 934 transitions. [2018-04-11 13:23:19,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 13:23:19,669 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:19,669 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:19,669 INFO L408 AbstractCegarLoop]: === Iteration 74 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:19,669 INFO L82 PathProgramCache]: Analyzing trace with hash -57352566, now seen corresponding path program 1 times [2018-04-11 13:23:19,670 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:19,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:19,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 13:23:19,936 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:19,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 13:23:19,936 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:19,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:19,936 INFO L182 omatonBuilderFactory]: Interpolants [85953#(and (<= main_~tmp~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmp~0.offset 0)), 85952#(and (= main_~tmp~0.offset 0) (= |main_#t~mem40.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem40.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 85955#(and (<= main_~tmp~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) |main_#t~mem44.offset|) (= |main_#t~mem44.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmp~0.offset 0)), 85954#(and (<= main_~tmp~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem43.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= main_~tmp~0.offset 0) (= |main_#t~mem43.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| |main_#t~mem43.base|))), 85957#(and (or (and (or (<= 1 main_~tmp~0.offset) (and (<= main_~tmp~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))) (or (= main_~tmpList~0.base main_~tmp~0.base) (not (= main_~tmp~0.base |main_#t~mem45.base|)) (not (= (+ main_~tmp~0.offset 8) |main_#t~mem45.offset|)))) (= main_~tmp~0.base |main_#t~mem45.base|)) (or (and (or (<= (+ main_~tmp~0.offset 8) main_~tmpList~0.offset) (not (= (+ main_~tmp~0.offset 8) |main_#t~mem45.offset|))) (or (= (+ main_~tmp~0.offset 8) |main_#t~mem45.offset|) (and (or (<= 1 main_~tmp~0.offset) (and (<= main_~tmp~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))) (or (= main_~tmpList~0.base main_~tmp~0.base) (not (= main_~tmp~0.base |main_#t~mem45.base|)) (not (= (+ main_~tmp~0.offset 8) |main_#t~mem45.offset|)))))) (not (= main_~tmp~0.base |main_#t~mem45.base|))) (= main_~tmp~0.offset 0)), 85956#(and (<= main_~tmp~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmp~0.offset 0) (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= (+ main_~tmp~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (<= (+ main_~tmp~0.offset 8) main_~tmpList~0.offset))), 85959#(and (or (= main_~tmpList~0.base main_~tmp~0.base) (and (<= main_~tmp~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))) (= main_~tmp~0.offset 0)), 85958#(and (or (= main_~tmpList~0.base main_~tmp~0.base) (and (<= main_~tmp~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (<= (+ main_~tmp~0.offset 8) main_~tmpList~0.offset)) (= main_~tmp~0.offset 0)), 85961#(and (<= 0 |main_#t~mem40.offset|) (<= (+ |main_#t~mem40.offset| 4) (select |#length| |main_#t~mem40.base|))), 85960#(and (or (= 0 (select |#valid| main_~tmp~0.base)) (and (<= main_~tmp~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))) (= main_~tmp~0.offset 0)), 85947#true, 85949#(= 0 |main_#t~malloc0.offset|), 85948#false, 85951#(= main_~tmp~0.offset 0), 85950#(= 0 main_~tree~0.offset)] [2018-04-11 13:23:19,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 13:23:19,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 13:23:19,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 13:23:19,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-04-11 13:23:19,937 INFO L87 Difference]: Start difference. First operand 725 states and 934 transitions. Second operand 15 states. [2018-04-11 13:23:20,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:20,584 INFO L93 Difference]: Finished difference Result 840 states and 1057 transitions. [2018-04-11 13:23:20,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 13:23:20,584 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-04-11 13:23:20,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:20,585 INFO L225 Difference]: With dead ends: 840 [2018-04-11 13:23:20,585 INFO L226 Difference]: Without dead ends: 840 [2018-04-11 13:23:20,585 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2018-04-11 13:23:20,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2018-04-11 13:23:20,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 744. [2018-04-11 13:23:20,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-04-11 13:23:20,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 960 transitions. [2018-04-11 13:23:20,588 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 960 transitions. Word has length 62 [2018-04-11 13:23:20,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:20,589 INFO L459 AbstractCegarLoop]: Abstraction has 744 states and 960 transitions. [2018-04-11 13:23:20,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 13:23:20,589 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 960 transitions. [2018-04-11 13:23:20,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 13:23:20,589 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:20,589 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:20,589 INFO L408 AbstractCegarLoop]: === Iteration 75 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:20,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1463202560, now seen corresponding path program 1 times [2018-04-11 13:23:20,590 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:20,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:20,768 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:20,768 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:20,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 13:23:20,768 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:20,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:20,768 INFO L182 omatonBuilderFactory]: Interpolants [87585#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1)), 87584#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 87587#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 87586#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 87589#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 87588#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 87591#(and (= |main_#t~mem10.offset| 0) (= 0 |main_#t~mem10.base|)), 87590#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 87592#(not |main_#t~short12|), 87577#false, 87576#true, 87579#(and (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 87578#(= (select |#valid| main_~tree~0.base) 1), 87581#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)) |main_#t~short12|), 87580#(and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) |main_#t~mem10.base|) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= |main_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= (select |#valid| main_~tmp~0.base) 1)), 87583#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tmp~0.base |main_#t~malloc23.base|)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 87582#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1))] [2018-04-11 13:23:20,768 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:20,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 13:23:20,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 13:23:20,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-04-11 13:23:20,769 INFO L87 Difference]: Start difference. First operand 744 states and 960 transitions. Second operand 17 states. [2018-04-11 13:23:21,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:21,930 INFO L93 Difference]: Finished difference Result 1437 states and 1744 transitions. [2018-04-11 13:23:22,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 13:23:22,040 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 64 [2018-04-11 13:23:22,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:22,041 INFO L225 Difference]: With dead ends: 1437 [2018-04-11 13:23:22,041 INFO L226 Difference]: Without dead ends: 1437 [2018-04-11 13:23:22,041 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=349, Invalid=983, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 13:23:22,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2018-04-11 13:23:22,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 822. [2018-04-11 13:23:22,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2018-04-11 13:23:22,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1052 transitions. [2018-04-11 13:23:22,047 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1052 transitions. Word has length 64 [2018-04-11 13:23:22,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:22,047 INFO L459 AbstractCegarLoop]: Abstraction has 822 states and 1052 transitions. [2018-04-11 13:23:22,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 13:23:22,047 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1052 transitions. [2018-04-11 13:23:22,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 13:23:22,047 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:22,047 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:22,047 INFO L408 AbstractCegarLoop]: === Iteration 76 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:22,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1327183513, now seen corresponding path program 1 times [2018-04-11 13:23:22,048 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:22,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:22,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:22,214 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:22,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 13:23:22,215 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:22,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:22,215 INFO L182 omatonBuilderFactory]: Interpolants [89893#true, 89895#(= (select |#valid| main_~tree~0.base) 1), 89894#false, 89897#(and (= |main_#t~mem10.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= |main_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= (select |#valid| main_~tmp~0.base) 1)), 89896#(and (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 89899#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 89898#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)) |main_#t~short12|), 89901#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 89900#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tmp~0.base |main_#t~malloc23.base|)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 89903#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 89902#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1)), 89905#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 89904#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 89907#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 89906#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 89908#(and (= |main_#t~mem36.offset| 0) (= |main_#t~mem36.base| 0))] [2018-04-11 13:23:22,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:22,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 13:23:22,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 13:23:22,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-04-11 13:23:22,215 INFO L87 Difference]: Start difference. First operand 822 states and 1052 transitions. Second operand 16 states. [2018-04-11 13:23:23,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:23,379 INFO L93 Difference]: Finished difference Result 1389 states and 1674 transitions. [2018-04-11 13:23:23,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 13:23:23,379 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2018-04-11 13:23:23,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:23,380 INFO L225 Difference]: With dead ends: 1389 [2018-04-11 13:23:23,380 INFO L226 Difference]: Without dead ends: 1365 [2018-04-11 13:23:23,380 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=352, Invalid=980, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 13:23:23,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2018-04-11 13:23:23,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 877. [2018-04-11 13:23:23,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2018-04-11 13:23:23,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1132 transitions. [2018-04-11 13:23:23,385 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1132 transitions. Word has length 65 [2018-04-11 13:23:23,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:23,385 INFO L459 AbstractCegarLoop]: Abstraction has 877 states and 1132 transitions. [2018-04-11 13:23:23,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 13:23:23,385 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1132 transitions. [2018-04-11 13:23:23,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 13:23:23,386 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:23,386 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:23,386 INFO L408 AbstractCegarLoop]: === Iteration 77 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:23,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1364275180, now seen corresponding path program 1 times [2018-04-11 13:23:23,386 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:23,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:23,795 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:23,795 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:23,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 13:23:23,796 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:23,796 INFO L182 omatonBuilderFactory]: Interpolants [92225#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base |main_#t~mem2.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 92224#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 92227#(and (= main_~tree~0.offset 0) (= main_~tmp~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= main_~tree~0.base main_~tmp~0.base)), 92226#(and (= main_~tree~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 92229#(and (= main_~tree~0.offset 0) (= 0 |main_#t~malloc29.offset|) (= 4 (select |#length| |main_#t~malloc29.base|))), 92228#(and (= main_~tree~0.offset 0) (= main_~tree~0.base main_~tmp~0.base)), 92231#(and (= 0 main_~tmpList~0.offset) (not (= main_~tmpList~0.offset (+ main_~tree~0.offset 8))) (= |main_#t~mem30.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 4 (select |#length| main_~tmpList~0.base)) (= |main_#t~mem30.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| main_~tree~0.base) 1)), 92230#(and (or (= main_~tree~0.base main_~tmpList~0.base) (and (= 0 main_~tmpList~0.offset) (not (= main_~tmpList~0.offset (+ main_~tree~0.offset 8))) (= 4 (select |#length| main_~tmpList~0.base)))) (or (and (= main_~tree~0.offset 0) (= 4 (select |#length| main_~tree~0.base))) (not (= main_~tree~0.base main_~tmpList~0.base)))), 92233#(and (or (and (or (and (= |main_#t~mem32.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 0 |main_#t~mem32.offset|) (= (select |#valid| main_~tree~0.base) 1)) (= (+ main_~tree~0.offset 8) |main_#t~mem32.offset|)) (or (and (= 0 main_~tmpList~0.offset) (= (select |#length| main_~tmpList~0.base) 4)) (not (= (+ main_~tree~0.offset 8) |main_#t~mem32.offset|)))) (not (= main_~tree~0.base |main_#t~mem32.base|))) (or (= main_~tree~0.base |main_#t~mem32.base|) (and (= |main_#t~mem32.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select |#length| |main_#t~mem32.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1))) (not (= main_~tree~0.base main_~tmpList~0.base))), 92232#(and (= 0 main_~tmpList~0.offset) (not (= main_~tmpList~0.offset (+ main_~tree~0.offset 8))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 4 (select |#length| main_~tmpList~0.base)) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 92235#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 92234#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1))), 92236#(and (<= 0 |main_#t~mem30.offset|) (<= (+ |main_#t~mem30.offset| 4) (select |#length| |main_#t~mem30.base|))), 92219#false, 92218#true, 92221#(= main_~tree~0.offset 0), 92220#(= |main_#t~malloc0.offset| 0), 92223#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base |main_#t~malloc1.base|)) (not (= 0 |main_#t~malloc1.base|))), 92222#(and (= main_~tree~0.offset 0) (= (select |#valid| main_~tree~0.base) 1))] [2018-04-11 13:23:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:23,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 13:23:23,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 13:23:23,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-04-11 13:23:23,796 INFO L87 Difference]: Start difference. First operand 877 states and 1132 transitions. Second operand 19 states. [2018-04-11 13:23:25,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:25,848 INFO L93 Difference]: Finished difference Result 1502 states and 1889 transitions. [2018-04-11 13:23:25,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 13:23:25,848 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2018-04-11 13:23:25,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:25,849 INFO L225 Difference]: With dead ends: 1502 [2018-04-11 13:23:25,849 INFO L226 Difference]: Without dead ends: 1502 [2018-04-11 13:23:25,850 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=650, Invalid=2002, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 13:23:25,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2018-04-11 13:23:25,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 873. [2018-04-11 13:23:25,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-04-11 13:23:25,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1127 transitions. [2018-04-11 13:23:25,855 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1127 transitions. Word has length 65 [2018-04-11 13:23:25,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:25,855 INFO L459 AbstractCegarLoop]: Abstraction has 873 states and 1127 transitions. [2018-04-11 13:23:25,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 13:23:25,855 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1127 transitions. [2018-04-11 13:23:25,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 13:23:25,855 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:25,855 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:25,855 INFO L408 AbstractCegarLoop]: === Iteration 78 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:25,856 INFO L82 PathProgramCache]: Analyzing trace with hash 806924354, now seen corresponding path program 1 times [2018-04-11 13:23:25,856 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:25,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:26,001 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:26,001 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:26,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 13:23:26,002 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:26,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:26,002 INFO L182 omatonBuilderFactory]: Interpolants [94689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (not (= main_~tmp~0.base |main_#t~mem45.base|))), 94688#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 94691#(= 0 |main_#t~mem47.offset|), 94690#(= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))), 94679#false, 94678#true, 94681#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 94680#(= (select |#valid| main_~tree~0.base) 1), 94683#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem2.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 94682#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 94685#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 94684#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc5.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 94687#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 94686#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem8.base|)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))] [2018-04-11 13:23:26,002 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:26,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 13:23:26,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 13:23:26,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:23:26,002 INFO L87 Difference]: Start difference. First operand 873 states and 1127 transitions. Second operand 14 states. [2018-04-11 13:23:26,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:26,573 INFO L93 Difference]: Finished difference Result 1077 states and 1355 transitions. [2018-04-11 13:23:26,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 13:23:26,573 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2018-04-11 13:23:26,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:26,574 INFO L225 Difference]: With dead ends: 1077 [2018-04-11 13:23:26,574 INFO L226 Difference]: Without dead ends: 1077 [2018-04-11 13:23:26,574 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2018-04-11 13:23:26,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2018-04-11 13:23:26,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 890. [2018-04-11 13:23:26,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2018-04-11 13:23:26,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1150 transitions. [2018-04-11 13:23:26,578 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1150 transitions. Word has length 65 [2018-04-11 13:23:26,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:26,578 INFO L459 AbstractCegarLoop]: Abstraction has 890 states and 1150 transitions. [2018-04-11 13:23:26,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 13:23:26,578 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1150 transitions. [2018-04-11 13:23:26,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 13:23:26,578 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:26,578 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:26,578 INFO L408 AbstractCegarLoop]: === Iteration 79 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:26,579 INFO L82 PathProgramCache]: Analyzing trace with hash 437552009, now seen corresponding path program 1 times [2018-04-11 13:23:26,579 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:26,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:26,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:26,994 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:26,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 13:23:26,994 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:26,994 INFO L182 omatonBuilderFactory]: Interpolants [96705#(and (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base |main_#t~malloc25.base|)) (or (= |main_#t~malloc25.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))), 96704#(and (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 96707#(and (not (= |main_#t~mem26.base| main_~tree~0.base)) (or (and (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))), 96706#(and (or (= (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 96709#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 96708#(and (not (= |main_#t~mem26.base| main_~tree~0.base)) (or (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))), 96710#(= 1 (select |#valid| |main_#t~mem30.base|)), 96687#true, 96689#(= 0 |main_#t~malloc0.offset|), 96688#false, 96691#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 96690#(= 0 main_~tree~0.offset), 96693#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 96692#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 main_~tree~0.offset)), 96695#(and (not (= main_~tree~0.base |main_#t~malloc5.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 96694#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 96697#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 96696#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 96699#(and (not (= main_~tree~0.base |main_#t~mem8.base|)) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 96698#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 96701#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= (select |#valid| main_~tree~0.base) 1) (= main_~tree~0.base main_~tmp~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 96700#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 96703#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 96702#(and (not (= main_~tree~0.base |main_#t~malloc23.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= main_~tree~0.base main_~tmp~0.base))] [2018-04-11 13:23:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:26,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 13:23:26,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 13:23:26,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:23:26,995 INFO L87 Difference]: Start difference. First operand 890 states and 1150 transitions. Second operand 24 states. [2018-04-11 13:23:28,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:28,179 INFO L93 Difference]: Finished difference Result 1184 states and 1487 transitions. [2018-04-11 13:23:28,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 13:23:28,179 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 65 [2018-04-11 13:23:28,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:28,180 INFO L225 Difference]: With dead ends: 1184 [2018-04-11 13:23:28,180 INFO L226 Difference]: Without dead ends: 1184 [2018-04-11 13:23:28,180 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=511, Invalid=1651, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 13:23:28,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-04-11 13:23:28,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 925. [2018-04-11 13:23:28,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 925 states. [2018-04-11 13:23:28,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1192 transitions. [2018-04-11 13:23:28,185 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1192 transitions. Word has length 65 [2018-04-11 13:23:28,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:28,185 INFO L459 AbstractCegarLoop]: Abstraction has 925 states and 1192 transitions. [2018-04-11 13:23:28,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 13:23:28,185 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1192 transitions. [2018-04-11 13:23:28,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 13:23:28,185 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:28,185 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:28,185 INFO L408 AbstractCegarLoop]: === Iteration 80 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:28,186 INFO L82 PathProgramCache]: Analyzing trace with hash 437552010, now seen corresponding path program 1 times [2018-04-11 13:23:28,186 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:28,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:28,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:28,764 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:28,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 13:23:28,764 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:28,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:28,764 INFO L182 omatonBuilderFactory]: Interpolants [98881#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1) (= main_~tree~0.base main_~tmp~0.base)), 98880#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 98883#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 98882#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc23.base|)) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.base main_~tmp~0.base)), 98885#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 98884#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1)), 98887#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= |main_#t~mem26.base| main_~tree~0.base)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 98886#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 98889#(and (<= 4 (select |#length| |main_#t~mem30.base|)) (= |main_#t~mem30.offset| 0)), 98888#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 98867#false, 98866#true, 98869#(= 0 main_~tree~0.offset), 98868#(= 0 |main_#t~malloc0.offset|), 98871#(and (= 4 (select |#length| |main_#t~malloc1.base|)) (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|) (= 0 main_~tree~0.offset)), 98870#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 98873#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 98872#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 98875#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc5.base|)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 98874#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 98877#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| |main_#t~mem6.base|)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| main_~tree~0.base) 1)), 98876#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 98879#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem8.base|)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 98878#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1))] [2018-04-11 13:23:28,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:28,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 13:23:28,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 13:23:28,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:23:28,765 INFO L87 Difference]: Start difference. First operand 925 states and 1192 transitions. Second operand 24 states. [2018-04-11 13:23:31,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:31,057 INFO L93 Difference]: Finished difference Result 1278 states and 1608 transitions. [2018-04-11 13:23:31,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-11 13:23:31,057 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 65 [2018-04-11 13:23:31,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:31,058 INFO L225 Difference]: With dead ends: 1278 [2018-04-11 13:23:31,058 INFO L226 Difference]: Without dead ends: 1278 [2018-04-11 13:23:31,059 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=771, Invalid=2651, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 13:23:31,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2018-04-11 13:23:31,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 890. [2018-04-11 13:23:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2018-04-11 13:23:31,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1150 transitions. [2018-04-11 13:23:31,063 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1150 transitions. Word has length 65 [2018-04-11 13:23:31,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:31,063 INFO L459 AbstractCegarLoop]: Abstraction has 890 states and 1150 transitions. [2018-04-11 13:23:31,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 13:23:31,063 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1150 transitions. [2018-04-11 13:23:31,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 13:23:31,064 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:31,064 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:31,064 INFO L408 AbstractCegarLoop]: === Iteration 81 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:31,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1866581767, now seen corresponding path program 1 times [2018-04-11 13:23:31,064 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:31,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:31,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:31,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:31,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 13:23:31,246 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:31,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:31,247 INFO L182 omatonBuilderFactory]: Interpolants [101129#false, 101128#true, 101131#(= 0 main_~tree~0.offset), 101130#(= 0 |main_#t~malloc0.offset|), 101133#(and (= 0 main_~tree~0.offset) (= main_~tmp~0.base main_~tree~0.base) (= main_~tree~0.offset main_~tmp~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 101132#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 101135#(and (not (= 0 main_~newNode~0.base)) (= 0 main_~tree~0.offset) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tree~0.offset main_~tmp~0.offset)), 101134#(and (not (= main_~tmp~0.base |main_#t~malloc23.base|)) (not (= 0 |main_#t~malloc23.base|)) (= 0 main_~tree~0.offset) (= main_~tmp~0.base main_~tree~0.base) (= main_~tree~0.offset main_~tmp~0.offset)), 101137#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (not (= main_~newNode~0.base main_~tree~0.base)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 101136#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (not (= main_~newNode~0.base main_~tree~0.base)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 101139#(and (not (= |main_#t~mem26.base| main_~tree~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= 0 main_~tree~0.offset)), 101138#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 101141#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))) (= main_~tmp~0.offset 0)), 101140#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= 0 main_~tree~0.offset)), 101143#(and (= main_~tmp~0.offset 0) |main_#t~short35|), 101142#(and (= main_~tmp~0.offset 0) (not (= 0 |main_#t~mem34.base|)))] [2018-04-11 13:23:31,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:31,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 13:23:31,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 13:23:31,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-04-11 13:23:31,247 INFO L87 Difference]: Start difference. First operand 890 states and 1150 transitions. Second operand 16 states. [2018-04-11 13:23:32,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:32,495 INFO L93 Difference]: Finished difference Result 1687 states and 2119 transitions. [2018-04-11 13:23:32,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 13:23:32,495 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2018-04-11 13:23:32,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:32,497 INFO L225 Difference]: With dead ends: 1687 [2018-04-11 13:23:32,497 INFO L226 Difference]: Without dead ends: 1687 [2018-04-11 13:23:32,497 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=486, Invalid=1236, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 13:23:32,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2018-04-11 13:23:32,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 979. [2018-04-11 13:23:32,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2018-04-11 13:23:32,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1268 transitions. [2018-04-11 13:23:32,505 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1268 transitions. Word has length 66 [2018-04-11 13:23:32,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:32,505 INFO L459 AbstractCegarLoop]: Abstraction has 979 states and 1268 transitions. [2018-04-11 13:23:32,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 13:23:32,505 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1268 transitions. [2018-04-11 13:23:32,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-11 13:23:32,505 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:32,506 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:32,506 INFO L408 AbstractCegarLoop]: === Iteration 82 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:32,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1637606424, now seen corresponding path program 1 times [2018-04-11 13:23:32,506 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:32,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:32,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:32,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 13:23:32,678 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:32,678 INFO L182 omatonBuilderFactory]: Interpolants [103873#(and (= 1 (select |#valid| main_~newNode~0.base)) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset)), 103872#(and (= 1 (select |#valid| main_~newNode~0.base)) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 103875#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= 0 main_~tree~0.offset)), 103874#(and (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= 0 main_~tree~0.offset)), 103877#(= 1 (select |#valid| |main_#t~mem38.base|)), 103876#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))) (= main_~tmp~0.offset 0)), 103878#(= 1 (select |#valid| main_~tmp~0.base)), 103863#false, 103862#true, 103865#(= 0 main_~tree~0.offset), 103864#(= 0 |main_#t~malloc0.offset|), 103867#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= main_~tree~0.offset main_~tmp~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 103866#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 103869#(and (= 0 main_~tree~0.offset) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tree~0.offset main_~tmp~0.offset)), 103868#(and (not (= main_~tree~0.base |main_#t~malloc23.base|)) (= 0 main_~tree~0.offset) (= main_~tmp~0.base main_~tree~0.base) (= main_~tree~0.offset main_~tmp~0.offset)), 103871#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 103870#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1))] [2018-04-11 13:23:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:32,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 13:23:32,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 13:23:32,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-04-11 13:23:32,679 INFO L87 Difference]: Start difference. First operand 979 states and 1268 transitions. Second operand 17 states. [2018-04-11 13:23:33,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:33,861 INFO L93 Difference]: Finished difference Result 1698 states and 2131 transitions. [2018-04-11 13:23:33,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 13:23:33,861 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2018-04-11 13:23:33,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:33,863 INFO L225 Difference]: With dead ends: 1698 [2018-04-11 13:23:33,863 INFO L226 Difference]: Without dead ends: 1698 [2018-04-11 13:23:33,863 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=458, Invalid=1102, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 13:23:33,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2018-04-11 13:23:33,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 991. [2018-04-11 13:23:33,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2018-04-11 13:23:33,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1282 transitions. [2018-04-11 13:23:33,869 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1282 transitions. Word has length 67 [2018-04-11 13:23:33,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:33,869 INFO L459 AbstractCegarLoop]: Abstraction has 991 states and 1282 transitions. [2018-04-11 13:23:33,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 13:23:33,869 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1282 transitions. [2018-04-11 13:23:33,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-11 13:23:33,870 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:33,870 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:33,870 INFO L408 AbstractCegarLoop]: === Iteration 83 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:33,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1637606423, now seen corresponding path program 1 times [2018-04-11 13:23:33,870 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:33,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:34,303 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:34,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 13:23:34,303 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:34,303 INFO L182 omatonBuilderFactory]: Interpolants [106625#(and (= 12 (select |#length| |main_#t~malloc23.base|)) (not (= main_~tmp~0.base |main_#t~malloc23.base|)) (= main_~tmp~0.offset 0) (= 0 main_~tree~0.offset) (= main_~tmp~0.base main_~tree~0.base) (= 0 |main_#t~malloc23.offset|)), 106624#(and (= main_~tmp~0.offset 0) (= 0 main_~tree~0.offset) (= main_~tmp~0.base main_~tree~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 106627#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (= 0 main_~tree~0.offset) (= 12 (select |#length| main_~newNode~0.base)) (= (select |#valid| main_~tree~0.base) 1)), 106626#(and (= 0 main_~newNode~0.offset) (= main_~tmp~0.offset 0) (= 0 main_~tree~0.offset) (not (= main_~tmp~0.base main_~newNode~0.base)) (= 12 (select |#length| main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base)), 106629#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (= 0 main_~tree~0.offset) (not (= main_~newNode~0.base |main_#t~malloc25.base|)) (= 12 (select |#length| main_~newNode~0.base)) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 106628#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~newNode~0.base) 1) (= 0 main_~tree~0.offset) (= 12 (select |#length| main_~newNode~0.base)) (= (select |#valid| main_~tree~0.base) 1)), 106631#(and (not (= |main_#t~mem26.base| main_~tree~0.base)) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (= 12 (select |#length| main_~newNode~0.base))), 106630#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (= 12 (select |#length| main_~newNode~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 106633#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))))), 106632#(and (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))))), 106635#(and (= 0 |main_#t~mem38.offset|) (= 12 (select |#length| |main_#t~mem38.base|))), 106634#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= main_~tmp~0.offset 0)), 106636#(and (= 12 (select |#length| main_~tmp~0.base)) (= main_~tmp~0.offset 0)), 106615#false, 106614#true, 106617#(= 0 main_~tree~0.offset), 106616#(= 0 |main_#t~malloc0.offset|), 106619#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 106618#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 106621#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 106620#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 main_~tree~0.offset)), 106623#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= main_~tmp~0.offset 0) (= 0 main_~tree~0.offset) (= main_~tmp~0.base main_~tree~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 106622#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1))] [2018-04-11 13:23:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:34,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 13:23:34,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 13:23:34,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:23:34,304 INFO L87 Difference]: Start difference. First operand 991 states and 1282 transitions. Second operand 23 states. [2018-04-11 13:23:37,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:37,097 INFO L93 Difference]: Finished difference Result 2027 states and 2501 transitions. [2018-04-11 13:23:37,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-11 13:23:37,097 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2018-04-11 13:23:37,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:37,099 INFO L225 Difference]: With dead ends: 2027 [2018-04-11 13:23:37,099 INFO L226 Difference]: Without dead ends: 2027 [2018-04-11 13:23:37,099 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1336 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1131, Invalid=4271, Unknown=0, NotChecked=0, Total=5402 [2018-04-11 13:23:37,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2018-04-11 13:23:37,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1014. [2018-04-11 13:23:37,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-04-11 13:23:37,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1317 transitions. [2018-04-11 13:23:37,106 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1317 transitions. Word has length 67 [2018-04-11 13:23:37,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:37,106 INFO L459 AbstractCegarLoop]: Abstraction has 1014 states and 1317 transitions. [2018-04-11 13:23:37,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 13:23:37,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1317 transitions. [2018-04-11 13:23:37,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-11 13:23:37,107 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:37,107 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:37,107 INFO L408 AbstractCegarLoop]: === Iteration 84 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:37,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1796748196, now seen corresponding path program 1 times [2018-04-11 13:23:37,107 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:37,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 13:23:37,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:37,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-04-11 13:23:37,125 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:37,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:37,125 INFO L182 omatonBuilderFactory]: Interpolants [109781#false, 109780#true, 109783#(and (= main_~pred~0.base main_~tmp~0.base) (= 1 (select |#valid| main_~tmp~0.base))), 109782#(= 1 (select |#valid| main_~tmp~0.base)), 109784#(= 1 (select |#valid| main_~pred~0.base))] [2018-04-11 13:23:37,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 13:23:37,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 13:23:37,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 13:23:37,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 13:23:37,125 INFO L87 Difference]: Start difference. First operand 1014 states and 1317 transitions. Second operand 5 states. [2018-04-11 13:23:37,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:37,241 INFO L93 Difference]: Finished difference Result 1098 states and 1417 transitions. [2018-04-11 13:23:37,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 13:23:37,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-04-11 13:23:37,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:37,242 INFO L225 Difference]: With dead ends: 1098 [2018-04-11 13:23:37,242 INFO L226 Difference]: Without dead ends: 1098 [2018-04-11 13:23:37,242 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-11 13:23:37,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2018-04-11 13:23:37,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1011. [2018-04-11 13:23:37,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-04-11 13:23:37,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1305 transitions. [2018-04-11 13:23:37,247 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1305 transitions. Word has length 68 [2018-04-11 13:23:37,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:37,247 INFO L459 AbstractCegarLoop]: Abstraction has 1011 states and 1305 transitions. [2018-04-11 13:23:37,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 13:23:37,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1305 transitions. [2018-04-11 13:23:37,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-11 13:23:37,247 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:37,247 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:37,247 INFO L408 AbstractCegarLoop]: === Iteration 85 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:37,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1796748195, now seen corresponding path program 1 times [2018-04-11 13:23:37,248 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:37,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:37,309 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 13:23:37,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:37,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-11 13:23:37,310 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:37,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-11 13:23:37,310 INFO L182 omatonBuilderFactory]: Interpolants [111897#false, 111896#true, 111899#(= 0 main_~tree~0.offset), 111898#(= 0 |main_#t~malloc0.offset|), 111901#(and (= main_~tmp~0.offset 0) (<= (+ main_~tmp~0.offset 4) (select |#length| main_~tmp~0.base))), 111900#(= main_~tmp~0.offset 0), 111903#(and (<= 4 (select |#length| main_~pred~0.base)) (= main_~pred~0.offset 0)), 111902#(and (= main_~pred~0.base main_~tmp~0.base) (= main_~tmp~0.offset 0) (<= (+ main_~tmp~0.offset 4) (select |#length| main_~tmp~0.base)) (= main_~pred~0.offset 0))] [2018-04-11 13:23:37,310 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 13:23:37,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 13:23:37,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 13:23:37,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:23:37,310 INFO L87 Difference]: Start difference. First operand 1011 states and 1305 transitions. Second operand 8 states. [2018-04-11 13:23:37,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:37,500 INFO L93 Difference]: Finished difference Result 1217 states and 1545 transitions. [2018-04-11 13:23:37,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 13:23:37,500 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2018-04-11 13:23:37,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:37,501 INFO L225 Difference]: With dead ends: 1217 [2018-04-11 13:23:37,501 INFO L226 Difference]: Without dead ends: 1217 [2018-04-11 13:23:37,501 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:23:37,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2018-04-11 13:23:37,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1046. [2018-04-11 13:23:37,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2018-04-11 13:23:37,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1350 transitions. [2018-04-11 13:23:37,506 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1350 transitions. Word has length 68 [2018-04-11 13:23:37,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:37,507 INFO L459 AbstractCegarLoop]: Abstraction has 1046 states and 1350 transitions. [2018-04-11 13:23:37,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 13:23:37,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1350 transitions. [2018-04-11 13:23:37,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-11 13:23:37,507 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:37,507 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:37,507 INFO L408 AbstractCegarLoop]: === Iteration 86 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:37,507 INFO L82 PathProgramCache]: Analyzing trace with hash 185201712, now seen corresponding path program 1 times [2018-04-11 13:23:37,508 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:37,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:38,470 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:38,470 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:38,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-11 13:23:38,470 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:38,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:38,471 INFO L182 omatonBuilderFactory]: Interpolants [114179#true, 114181#(= (select |#valid| main_~tree~0.base) 1), 114180#false, 114183#(and (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 114182#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 114185#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~mem3.base|) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem2.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| main_~tree~0.base) 1) (= |main_#t~mem3.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 114184#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem2.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| main_~tree~0.base) 1)), 114187#(and (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc5.base|)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (= |main_#t~malloc5.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 114186#(and (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 114189#(and (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| |main_#t~mem6.base|) |main_#t~mem6.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_#t~mem6.base|) |main_#t~mem6.offset|) 0) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base main_~tmpList~0.base)) (= main_~tmpList~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 114188#(and (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base main_~tmpList~0.base)) (= main_~tmpList~0.offset 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 114191#(and (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base main_~tmpList~0.base)) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~tmpList~0.base) 0)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tmpList~0.base) 0) 0)), 114190#(and (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base main_~tmpList~0.base)) (= main_~tmpList~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~mem7.offset| 0) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~mem7.base|)), 114193#(and (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0)) 0) 0) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0)) 0))) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0)))), 114192#(and (= |main_#t~mem8.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base main_~tmpList~0.base)) (= |main_#t~mem8.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (or (= main_~tmpList~0.base |main_#t~mem8.base|) (and (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~tmpList~0.base) 0)) (= (select (select |#memory_$Pointer$.offset| main_~tmpList~0.base) 0) 0)))), 114195#(and (= |main_#t~mem41.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) 0) 0) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) 0))) (and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)), 114194#(and (or (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) 0) 0) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) 0)))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)), 114197#(and (or (and (= |main_#t~mem42.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) 0) 0) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) 0)))) (= |main_#t~mem42.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= |main_#t~mem41.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)), 114196#(and (= |main_#t~mem41.offset| |main_#t~mem40.offset|) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= |main_#t~mem40.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (or (and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| |main_#t~mem40.base|) 0)) (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) 0) 0) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) 0)))) (= |main_#t~mem40.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)), 114199#(and (or (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.offset| |main_#t~mem43.base|) |main_#t~mem43.offset|))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem43.base|) |main_#t~mem43.offset|)) 0) 0) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem43.base|) |main_#t~mem43.offset|)) 0)))) (= |main_#t~mem43.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= |main_#t~mem43.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)), 114198#(and (or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) 0) 0) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) 0))) (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)), 114201#(or (not (= 0 main_~tmpList~0.offset)) (and (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tmpList~0.base) main_~tmpList~0.offset) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 114200#(and (= |main_#t~mem44.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (or (and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| |main_#t~mem44.base|) 0)) (= (select (select |#memory_$Pointer$.offset| |main_#t~mem44.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem44.offset|))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)), 114203#(or (not (= 0 main_~tmpList~0.offset)) (and (= |main_#t~mem46.offset| (select (select |#memory_$Pointer$.offset| main_~tmpList~0.base) main_~tmpList~0.offset)) (= |main_#t~mem45.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem45.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem46.base|) (not (= main_~tmp~0.base |main_#t~mem45.base|)) (= (select (select |#memory_$Pointer$.offset| main_~tmpList~0.base) main_~tmpList~0.offset) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 114202#(or (not (= 0 main_~tmpList~0.offset)) (and (= |main_#t~mem45.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem45.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset)) (not (= main_~tmp~0.base |main_#t~mem45.base|)) (= (select (select |#memory_$Pointer$.offset| main_~tmpList~0.base) main_~tmpList~0.offset) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 114205#(or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= main_~tmpList~0.base main_~tmp~0.base)), 114204#(or (not (= 0 main_~tmpList~0.offset)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= main_~tmpList~0.base main_~tmp~0.base)), 114207#(and (= |main_#t~mem41.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 114206#(or (= 0 (select |#valid| main_~tmp~0.base)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))), 114209#(and (= |main_#t~mem42.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem41.offset| |main_#t~mem42.offset|)), 114208#(and (= |main_#t~mem41.offset| (select (select |#memory_$Pointer$.offset| |main_#t~mem40.base|) |main_#t~mem40.offset|)) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| |main_#t~mem40.base|) |main_#t~mem40.offset|)) (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))] [2018-04-11 13:23:38,471 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:38,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 13:23:38,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 13:23:38,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=852, Unknown=0, NotChecked=0, Total=930 [2018-04-11 13:23:38,471 INFO L87 Difference]: Start difference. First operand 1046 states and 1350 transitions. Second operand 31 states. [2018-04-11 13:23:41,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:41,214 INFO L93 Difference]: Finished difference Result 1300 states and 1644 transitions. [2018-04-11 13:23:41,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-11 13:23:41,215 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 68 [2018-04-11 13:23:41,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:41,215 INFO L225 Difference]: With dead ends: 1300 [2018-04-11 13:23:41,215 INFO L226 Difference]: Without dead ends: 1300 [2018-04-11 13:23:41,216 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=445, Invalid=3845, Unknown=0, NotChecked=0, Total=4290 [2018-04-11 13:23:41,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2018-04-11 13:23:41,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1105. [2018-04-11 13:23:41,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1105 states. [2018-04-11 13:23:41,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1415 transitions. [2018-04-11 13:23:41,221 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1415 transitions. Word has length 68 [2018-04-11 13:23:41,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:41,222 INFO L459 AbstractCegarLoop]: Abstraction has 1105 states and 1415 transitions. [2018-04-11 13:23:41,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 13:23:41,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1415 transitions. [2018-04-11 13:23:41,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-11 13:23:41,222 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:41,223 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:41,223 INFO L408 AbstractCegarLoop]: === Iteration 87 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:41,223 INFO L82 PathProgramCache]: Analyzing trace with hash 316089932, now seen corresponding path program 2 times [2018-04-11 13:23:41,223 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:41,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:41,482 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:41,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 13:23:41,483 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:41,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-11 13:23:41,483 INFO L182 omatonBuilderFactory]: Interpolants [116704#(not |main_#t~short35|), 116685#true, 116687#(= (select |#valid| main_~tree~0.base) 1), 116686#false, 116689#(and (= 0 |main_#t~malloc19.offset|) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (not (= main_~tmp~0.base |main_#t~malloc19.base|))), 116688#(and (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 116691#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~tree~0.base) 1)), 116690#(and (= main_~newNode~0.offset 0) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 116693#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (not (= main_~newNode~0.base |main_#t~malloc25.base|)) (not (= main_~tree~0.base |main_#t~malloc25.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset))), 116692#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset))), 116695#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= |main_#t~mem26.base| main_~tree~0.base)) (not (= main_~newNode~0.base |main_#t~mem26.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= main_~newNode~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset))), 116694#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= main_~newNode~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset))), 116697#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) 0))), 116696#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) 0)) (not (= |main_#t~mem26.base| main_~tree~0.base)) (not (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) 0))), 116699#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) 0)) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) |main_#t~mem33.offset|) (= |main_#t~mem33.offset| 0)), 116698#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) 0))), 116701#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset|))), 116700#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)))), 116703#(and (= |main_#t~mem33.base| 0) (= |main_#t~mem33.offset| 0)), 116702#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))] [2018-04-11 13:23:41,483 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:41,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 13:23:41,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 13:23:41,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-04-11 13:23:41,483 INFO L87 Difference]: Start difference. First operand 1105 states and 1415 transitions. Second operand 20 states. [2018-04-11 13:23:43,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:43,220 INFO L93 Difference]: Finished difference Result 2055 states and 2559 transitions. [2018-04-11 13:23:43,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 13:23:43,221 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 70 [2018-04-11 13:23:43,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:43,222 INFO L225 Difference]: With dead ends: 2055 [2018-04-11 13:23:43,222 INFO L226 Difference]: Without dead ends: 2055 [2018-04-11 13:23:43,222 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=442, Invalid=2108, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 13:23:43,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2018-04-11 13:23:43,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 1109. [2018-04-11 13:23:43,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2018-04-11 13:23:43,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1419 transitions. [2018-04-11 13:23:43,229 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1419 transitions. Word has length 70 [2018-04-11 13:23:43,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:43,229 INFO L459 AbstractCegarLoop]: Abstraction has 1109 states and 1419 transitions. [2018-04-11 13:23:43,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 13:23:43,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1419 transitions. [2018-04-11 13:23:43,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-11 13:23:43,229 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:43,229 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:43,229 INFO L408 AbstractCegarLoop]: === Iteration 88 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:43,229 INFO L82 PathProgramCache]: Analyzing trace with hash -98155618, now seen corresponding path program 1 times [2018-04-11 13:23:43,230 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:43,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:43,263 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 13:23:43,263 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 13:23:43,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 13:23:43,263 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:43,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:43,263 INFO L182 omatonBuilderFactory]: Interpolants [119936#(and (= |main_#t~mem39.base| main_~tmp~0.base) (= |main_#t~mem39.offset| main_~tmp~0.offset)), 119931#true, 119933#(and (= main_~tmp~0.offset main_~pred~0.offset) (= main_~tmp~0.base main_~pred~0.base)), 119932#false, 119935#(and (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset)) (= main_~tmp~0.offset (select (select |#memory_$Pointer$.offset| main_~pred~0.base) main_~pred~0.offset))), 119934#(and (= |main_#t~mem37.base| (select (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset)) (= |main_#t~mem37.offset| (select (select |#memory_$Pointer$.offset| main_~pred~0.base) main_~pred~0.offset)))] [2018-04-11 13:23:43,263 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 13:23:43,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 13:23:43,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 13:23:43,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 13:23:43,264 INFO L87 Difference]: Start difference. First operand 1109 states and 1419 transitions. Second operand 6 states. [2018-04-11 13:23:43,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:43,416 INFO L93 Difference]: Finished difference Result 1209 states and 1544 transitions. [2018-04-11 13:23:43,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 13:23:43,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-04-11 13:23:43,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:43,417 INFO L225 Difference]: With dead ends: 1209 [2018-04-11 13:23:43,417 INFO L226 Difference]: Without dead ends: 1209 [2018-04-11 13:23:43,418 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:23:43,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2018-04-11 13:23:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1145. [2018-04-11 13:23:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2018-04-11 13:23:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1477 transitions. [2018-04-11 13:23:43,423 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1477 transitions. Word has length 70 [2018-04-11 13:23:43,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:43,423 INFO L459 AbstractCegarLoop]: Abstraction has 1145 states and 1477 transitions. [2018-04-11 13:23:43,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 13:23:43,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1477 transitions. [2018-04-11 13:23:43,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-11 13:23:43,424 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:43,424 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:43,424 INFO L408 AbstractCegarLoop]: === Iteration 89 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:43,424 INFO L82 PathProgramCache]: Analyzing trace with hash -119456504, now seen corresponding path program 1 times [2018-04-11 13:23:43,424 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:43,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:43,749 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 13:23:43,749 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:43,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 13:23:43,749 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:43,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:43,750 INFO L182 omatonBuilderFactory]: Interpolants [122305#(and (or (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) main_~tmp~0.base)) (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) main_~tmp~0.offset)) (and (= 0 |main_#t~mem44.base|) (= (select |#valid| 0) 0))) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) main_~tmp~0.base)) (= main_~tmp~0.offset 0)), 122304#(and (or (not (= |main_#t~mem43.base| main_~tmp~0.base)) (and (or (= main_~tmp~0.offset |main_#t~mem43.offset|) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem43.offset|)) (or (not (= main_~tmp~0.offset |main_#t~mem43.offset|)) (and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= (select |#valid| 0) 0))))) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) main_~tmp~0.base)) (= main_~tmp~0.offset 0) (or (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) main_~tmp~0.base)) (= |main_#t~mem43.base| main_~tmp~0.base))), 122307#(or (and (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmp~0.base |main_#t~mem45.base|))) (and (or (and (= (select |#valid| 0) 0) (= 0 main_~tmpList~0.base)) (not (= main_~tmp~0.offset |main_#t~mem45.offset|))) (or (and (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) main_~tmp~0.base)) (= main_~tmp~0.offset 0) (= main_~tmp~0.base |main_#t~mem45.base|)) (= main_~tmp~0.offset |main_#t~mem45.offset|)))), 122306#(and (or (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) main_~tmp~0.base)) (and (= (select |#valid| 0) 0) (= 0 main_~tmpList~0.base)) (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) main_~tmp~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) main_~tmp~0.base)) (= main_~tmp~0.offset 0)), 122309#(or (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (and (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) main_~tmp~0.base)) (= main_~tmp~0.offset 0))), 122308#(or (and (not (= main_~tmp~0.offset |main_#t~mem45.offset|)) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) main_~tmp~0.base)) (= main_~tmp~0.offset 0) (= main_~tmp~0.base |main_#t~mem45.base|)) (and (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmp~0.base |main_#t~mem45.base|)))), 122311#(and (or (and (or (and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem41.base|) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem40.base|) main_~tmp~0.offset) main_~tmp~0.base))) (not (= main_~tmp~0.offset |main_#t~mem40.offset|))) (or (not (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmp~0.offset |main_#t~mem40.offset|))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= 1 (select |#valid| main_~tmp~0.base))), 122310#(and (or (and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem41.base|) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) main_~tmp~0.base)) (= main_~tmp~0.offset 0)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= 1 (select |#valid| main_~tmp~0.base))), 122313#(and (= 1 (select |#valid| main_~tmp~0.base)) (or (not (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))), 122312#(and (= 1 (select |#valid| main_~tmp~0.base)) (or (not (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem41.base|) (not (= |main_#t~mem42.base| main_~tmp~0.base))))), 122315#(and (not (= main_~tmp~0.base |main_#t~mem47.base|)) (= 1 (select |#valid| main_~tmp~0.base))), 122314#(and (or (not (= main_~tmp~0.base |main_#t~mem47.base|)) (not (= 0 |main_#t~mem47.offset|))) (or (= 1 (select |#valid| main_~tmp~0.base)) (= main_~tmp~0.base |main_#t~mem47.base|))), 122316#(= 1 (select |#valid| main_~tmp~0.base)), 122295#true, 122297#(= (select |#valid| 0) 0), 122296#false, 122299#(and (not (= 0 main_~tree~0.base)) (= (select |#valid| 0) 0) (= 0 main_~tree~0.offset)), 122298#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|) (= (select |#valid| 0) 0)), 122301#(and (= (select |#valid| 0) 0) (= main_~tmp~0.offset 0) (not (= 0 main_~tmp~0.base)) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) |main_#t~mem33.base|)), 122300#(and (= (select |#valid| 0) 0) (= main_~tmp~0.offset 0) (not (= 0 main_~tmp~0.base))), 122303#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) main_~tmp~0.base)) (= (select |#valid| 0) 0) (= main_~tmp~0.offset 0)), 122302#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) main_~tmp~0.base)) (= (select |#valid| 0) 0) (= main_~tmp~0.offset 0)) |main_#t~short35|)] [2018-04-11 13:23:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 13:23:43,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 13:23:43,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 13:23:43,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:23:43,750 INFO L87 Difference]: Start difference. First operand 1145 states and 1477 transitions. Second operand 22 states. [2018-04-11 13:23:45,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:45,330 INFO L93 Difference]: Finished difference Result 1241 states and 1558 transitions. [2018-04-11 13:23:45,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 13:23:45,330 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 70 [2018-04-11 13:23:45,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:45,331 INFO L225 Difference]: With dead ends: 1241 [2018-04-11 13:23:45,331 INFO L226 Difference]: Without dead ends: 1241 [2018-04-11 13:23:45,331 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=426, Invalid=1926, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 13:23:45,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2018-04-11 13:23:45,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1129. [2018-04-11 13:23:45,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2018-04-11 13:23:45,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1455 transitions. [2018-04-11 13:23:45,336 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1455 transitions. Word has length 70 [2018-04-11 13:23:45,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:45,336 INFO L459 AbstractCegarLoop]: Abstraction has 1129 states and 1455 transitions. [2018-04-11 13:23:45,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 13:23:45,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1455 transitions. [2018-04-11 13:23:45,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-04-11 13:23:45,337 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:45,337 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:45,337 INFO L408 AbstractCegarLoop]: === Iteration 90 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:45,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1268451010, now seen corresponding path program 1 times [2018-04-11 13:23:45,338 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:45,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:45,360 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 13:23:45,361 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:45,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-11 13:23:45,361 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:45,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:45,361 INFO L182 omatonBuilderFactory]: Interpolants [124741#true, 124743#(not (= 0 |main_#t~malloc0.base|)), 124742#false, 124745#(not (= 0 main_~tmp~0.base)), 124744#(not (= 0 main_~tree~0.base)), 124746#(not (= 0 main_~pred~0.base))] [2018-04-11 13:23:45,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 13:23:45,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 13:23:45,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 13:23:45,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 13:23:45,361 INFO L87 Difference]: Start difference. First operand 1129 states and 1455 transitions. Second operand 6 states. [2018-04-11 13:23:45,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:45,486 INFO L93 Difference]: Finished difference Result 1257 states and 1564 transitions. [2018-04-11 13:23:45,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 13:23:45,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-04-11 13:23:45,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:45,487 INFO L225 Difference]: With dead ends: 1257 [2018-04-11 13:23:45,487 INFO L226 Difference]: Without dead ends: 1257 [2018-04-11 13:23:45,487 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-11 13:23:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2018-04-11 13:23:45,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1106. [2018-04-11 13:23:45,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106 states. [2018-04-11 13:23:45,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1418 transitions. [2018-04-11 13:23:45,492 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1418 transitions. Word has length 71 [2018-04-11 13:23:45,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:45,492 INFO L459 AbstractCegarLoop]: Abstraction has 1106 states and 1418 transitions. [2018-04-11 13:23:45,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 13:23:45,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1418 transitions. [2018-04-11 13:23:45,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-11 13:23:45,493 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:45,493 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:45,493 INFO L408 AbstractCegarLoop]: === Iteration 91 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:45,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1295176589, now seen corresponding path program 1 times [2018-04-11 13:23:45,493 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:45,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:45,948 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:45,948 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:45,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 13:23:45,948 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:45,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:45,949 INFO L182 omatonBuilderFactory]: Interpolants [127137#(and (= |main_#t~mem33.offset| 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 4))) (= |main_#t~mem33.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset))), 127136#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 4)))), 127139#(or (<= (+ main_~tmp~0.offset 1) 0) (and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4))))), 127138#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 4))) (= 0 |main_#t~mem37.offset|)), 127141#(and (= 0 |main_#t~mem34.base|) (= |main_#t~mem34.offset| 0)), 127140#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))), 127142#(not |main_#t~short35|), 127121#false, 127120#true, 127123#(= main_~tree~0.offset 0), 127122#(= 0 |main_#t~malloc0.offset|), 127125#(and (= main_~tree~0.offset 0) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 127124#(and (= main_~tree~0.offset 0) (= (select |#valid| main_~tree~0.base) 1)), 127127#(and (= main_~tree~0.offset 0) (= main_~newNode~0.offset 0) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 127126#(and (= main_~tree~0.offset 0) (= 0 |main_#t~malloc19.offset|) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (not (= main_~tmp~0.base |main_#t~malloc19.base|))), 127129#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (= (select |#valid| main_~tree~0.base) 1)), 127128#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~tree~0.base) 1)), 127131#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (not (= main_~newNode~0.base |main_#t~malloc25.base|)) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 127130#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (= (select |#valid| main_~tree~0.base) 1)), 127133#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (not (= main_~newNode~0.base |main_#t~mem26.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (= main_~newNode~0.offset 0)), 127132#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (not (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (= main_~newNode~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 127135#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 4)))), 127134#(and (= main_~tree~0.offset 0) (not (= |main_#t~mem26.base| main_~tree~0.base)) (not (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 4))))] [2018-04-11 13:23:45,949 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:45,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 13:23:45,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 13:23:45,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:23:45,949 INFO L87 Difference]: Start difference. First operand 1106 states and 1418 transitions. Second operand 23 states. [2018-04-11 13:23:47,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:47,827 INFO L93 Difference]: Finished difference Result 1986 states and 2494 transitions. [2018-04-11 13:23:47,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-11 13:23:47,828 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2018-04-11 13:23:47,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:47,829 INFO L225 Difference]: With dead ends: 1986 [2018-04-11 13:23:47,829 INFO L226 Difference]: Without dead ends: 1986 [2018-04-11 13:23:47,829 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=647, Invalid=2659, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 13:23:47,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2018-04-11 13:23:47,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1106. [2018-04-11 13:23:47,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106 states. [2018-04-11 13:23:47,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1417 transitions. [2018-04-11 13:23:47,836 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1417 transitions. Word has length 72 [2018-04-11 13:23:47,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:47,836 INFO L459 AbstractCegarLoop]: Abstraction has 1106 states and 1417 transitions. [2018-04-11 13:23:47,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 13:23:47,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1417 transitions. [2018-04-11 13:23:47,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-11 13:23:47,837 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:47,837 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:47,837 INFO L408 AbstractCegarLoop]: === Iteration 92 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:47,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1936046681, now seen corresponding path program 1 times [2018-04-11 13:23:47,837 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:47,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:48,655 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:48,656 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:48,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-11 13:23:48,656 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:48,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:48,656 INFO L182 omatonBuilderFactory]: Interpolants [130305#true, 130307#(= 0 |main_#t~malloc0.offset|), 130306#false, 130309#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 130308#(= 0 main_~tree~0.offset), 130311#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 main_~tree~0.offset)), 130310#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 130313#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 130312#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 130315#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) |main_#t~mem10.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tree~0.base main_~tmp~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 130314#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= main_~tree~0.base main_~tmp~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 130317#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 130316#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (or (and (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tmp~0.offset main_~tree~0.offset)) |main_#t~short12|) (< main_~tmp~0.offset (+ main_~tree~0.offset 1)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 130319#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tmp~0.base main_~newNode~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) main_~newNode~0.offset) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 130318#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) |main_#t~malloc19.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base) (not (= main_~tmp~0.base |main_#t~malloc19.base|))), 130321#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 130320#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 130323#(and (= main_~tree~0.offset 0) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 130322#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 130325#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 4 (select |#length| |main_#t~malloc29.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 130324#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 130327#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmpList~0.base main_~tree~0.base))), 130326#(and (= main_~tree~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmpList~0.base main_~tree~0.base))) (= 4 (select |#length| main_~tree~0.base)))), 130329#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))), 130328#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~mem32.base|))), 130331#(and (= |main_#t~mem11.offset| 0) (= |main_#t~mem11.base| 0)), 130330#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))), 130332#(not |main_#t~short12|)] [2018-04-11 13:23:48,656 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:48,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 13:23:48,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 13:23:48,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2018-04-11 13:23:48,657 INFO L87 Difference]: Start difference. First operand 1106 states and 1417 transitions. Second operand 28 states. [2018-04-11 13:23:52,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:52,464 INFO L93 Difference]: Finished difference Result 1866 states and 2375 transitions. [2018-04-11 13:23:52,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-11 13:23:52,464 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 72 [2018-04-11 13:23:52,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:52,465 INFO L225 Difference]: With dead ends: 1866 [2018-04-11 13:23:52,465 INFO L226 Difference]: Without dead ends: 1866 [2018-04-11 13:23:52,466 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1804 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2187, Invalid=5823, Unknown=0, NotChecked=0, Total=8010 [2018-04-11 13:23:52,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2018-04-11 13:23:52,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1007. [2018-04-11 13:23:52,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2018-04-11 13:23:52,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1275 transitions. [2018-04-11 13:23:52,476 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1275 transitions. Word has length 72 [2018-04-11 13:23:52,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:52,476 INFO L459 AbstractCegarLoop]: Abstraction has 1007 states and 1275 transitions. [2018-04-11 13:23:52,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 13:23:52,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1275 transitions. [2018-04-11 13:23:52,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-11 13:23:52,477 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:52,477 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:52,477 INFO L408 AbstractCegarLoop]: === Iteration 93 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:52,477 INFO L82 PathProgramCache]: Analyzing trace with hash 512837873, now seen corresponding path program 1 times [2018-04-11 13:23:52,478 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:52,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:53,011 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:53,012 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:53,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 13:23:53,012 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:53,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:53,012 INFO L182 omatonBuilderFactory]: Interpolants [133330#true, 133331#false, 133334#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 133335#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 133332#(= 0 |main_#t~malloc0.offset|), 133333#(= 0 main_~tree~0.offset), 133338#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 133339#(and (not (= main_~tree~0.base |main_#t~malloc5.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 133336#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 main_~tree~0.offset)), 133337#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 133342#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~mem8.base|)) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 133343#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= main_~tmp~0.base main_~tree~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 133340#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 133341#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 133346#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tmp~0.base main_~tree~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 133347#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) |main_#t~malloc19.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tmp~0.base main_~tree~0.base) (not (= main_~tmp~0.base |main_#t~malloc19.base|))), 133344#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) |main_#t~mem10.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tmp~0.base main_~tree~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 133345#(and (or |main_#t~short12| (and (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))))) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tmp~0.base main_~tree~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 133350#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 133351#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 133348#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tmp~0.base main_~newNode~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tmp~0.base main_~tree~0.base) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) main_~newNode~0.offset)), 133349#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1)), 133354#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))), 133355#(and (= |main_#t~mem11.offset| 0) (= |main_#t~mem11.base| 0)), 133352#(and (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))), 133353#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))), 133356#(not |main_#t~short12|)] [2018-04-11 13:23:53,012 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:53,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 13:23:53,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 13:23:53,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2018-04-11 13:23:53,013 INFO L87 Difference]: Start difference. First operand 1007 states and 1275 transitions. Second operand 27 states. [2018-04-11 13:23:56,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:56,571 INFO L93 Difference]: Finished difference Result 1749 states and 2167 transitions. [2018-04-11 13:23:56,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-11 13:23:56,571 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 72 [2018-04-11 13:23:56,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:56,572 INFO L225 Difference]: With dead ends: 1749 [2018-04-11 13:23:56,572 INFO L226 Difference]: Without dead ends: 1749 [2018-04-11 13:23:56,572 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1778 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1809, Invalid=5673, Unknown=0, NotChecked=0, Total=7482 [2018-04-11 13:23:56,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2018-04-11 13:23:56,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1056. [2018-04-11 13:23:56,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2018-04-11 13:23:56,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1335 transitions. [2018-04-11 13:23:56,578 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1335 transitions. Word has length 72 [2018-04-11 13:23:56,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:56,578 INFO L459 AbstractCegarLoop]: Abstraction has 1056 states and 1335 transitions. [2018-04-11 13:23:56,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 13:23:56,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1335 transitions. [2018-04-11 13:23:56,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-11 13:23:56,579 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:56,579 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:56,579 INFO L408 AbstractCegarLoop]: === Iteration 94 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:56,579 INFO L82 PathProgramCache]: Analyzing trace with hash 670272416, now seen corresponding path program 1 times [2018-04-11 13:23:56,579 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:56,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:57,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:57,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:57,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 13:23:57,011 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:57,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:57,012 INFO L182 omatonBuilderFactory]: Interpolants [136282#true, 136283#false, 136286#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 136287#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 main_~tree~0.offset)), 136284#(= 0 |main_#t~malloc0.offset|), 136285#(= 0 main_~tree~0.offset), 136290#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 136291#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base) (not (= main_~tmp~0.base |main_#t~malloc19.base|))), 136288#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 136289#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 136294#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 136295#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (= 1 (select |#valid| main_~newNode~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 136292#(and (= main_~tree~0.offset 0) (not (= main_~tmp~0.base main_~newNode~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 136293#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 136298#(and (= main_~tree~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 136299#(and (= main_~tree~0.offset 0) (= 4 (select |#length| |main_#t~malloc29.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (or (= |main_#t~malloc29.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))))), 136296#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 1 (select |#valid| main_~newNode~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 136297#(and (= main_~tree~0.offset 0) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 136302#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base |main_#t~mem32.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)))), 136303#(and (= main_~tree~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)))), 136300#(and (= main_~tree~0.offset 0) (or (and (or (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmpList~0.base main_~tree~0.base))) (= 4 (select |#length| main_~tree~0.base)))), 136301#(and (= main_~tree~0.offset 0) (or (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmpList~0.base main_~tree~0.base))), 136306#(= 1 (select |#valid| main_~tmp~0.base)), 136304#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 136305#(= 1 (select |#valid| |main_#t~mem37.base|))] [2018-04-11 13:23:57,012 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:57,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 13:23:57,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 13:23:57,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2018-04-11 13:23:57,012 INFO L87 Difference]: Start difference. First operand 1056 states and 1335 transitions. Second operand 25 states. [2018-04-11 13:23:59,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:23:59,088 INFO L93 Difference]: Finished difference Result 1598 states and 2010 transitions. [2018-04-11 13:23:59,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-11 13:23:59,089 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 73 [2018-04-11 13:23:59,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:23:59,090 INFO L225 Difference]: With dead ends: 1598 [2018-04-11 13:23:59,090 INFO L226 Difference]: Without dead ends: 1598 [2018-04-11 13:23:59,090 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1019, Invalid=2887, Unknown=0, NotChecked=0, Total=3906 [2018-04-11 13:23:59,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2018-04-11 13:23:59,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1069. [2018-04-11 13:23:59,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2018-04-11 13:23:59,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1350 transitions. [2018-04-11 13:23:59,096 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1350 transitions. Word has length 73 [2018-04-11 13:23:59,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:23:59,096 INFO L459 AbstractCegarLoop]: Abstraction has 1069 states and 1350 transitions. [2018-04-11 13:23:59,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 13:23:59,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1350 transitions. [2018-04-11 13:23:59,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-11 13:23:59,096 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:23:59,097 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:23:59,097 INFO L408 AbstractCegarLoop]: === Iteration 95 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:23:59,097 INFO L82 PathProgramCache]: Analyzing trace with hash 670272417, now seen corresponding path program 1 times [2018-04-11 13:23:59,097 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:23:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:23:59,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:23:59,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:59,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:23:59,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 13:23:59,676 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:23:59,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:59,677 INFO L182 omatonBuilderFactory]: Interpolants [139074#(and (<= 12 (select |#length| main_~tmp~0.base)) (= main_~tmp~0.offset 0)), 139072#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))), 139073#(and (= 0 |main_#t~mem37.offset|) (<= 12 (select |#length| |main_#t~mem37.base|))), 139050#true, 139051#false, 139054#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 139055#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 main_~tree~0.offset)), 139052#(= 0 |main_#t~malloc0.offset|), 139053#(= 0 main_~tree~0.offset), 139058#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 139059#(and (= main_~tree~0.offset 0) (= 0 |main_#t~malloc19.offset|) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc19.base|)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 139056#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 139057#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 139062#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 139063#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (= 1 (select |#valid| main_~newNode~0.base)) (<= (+ main_~newNode~0.offset 12) (select |#length| main_~newNode~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= main_~newNode~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 139060#(and (= main_~tree~0.offset 0) (= main_~newNode~0.offset 0) (not (= main_~tmp~0.base main_~newNode~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 139061#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 139066#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) 1) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 139067#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= 4 (select |#length| |main_#t~malloc29.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 139064#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 1 (select |#valid| main_~newNode~0.base)) (<= (+ main_~newNode~0.offset 12) (select |#length| main_~newNode~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= main_~newNode~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 139065#(and (= main_~tree~0.offset 0) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) 1) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 139070#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (not (= main_~tree~0.base |main_#t~mem32.base|)) (not (= main_~tree~0.base main_~tmpList~0.base))), 139071#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)))), 139068#(and (= main_~tree~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmpList~0.base main_~tree~0.base))) (= 4 (select |#length| main_~tree~0.base)))), 139069#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmpList~0.base main_~tree~0.base)))] [2018-04-11 13:23:59,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:23:59,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 13:23:59,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 13:23:59,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2018-04-11 13:23:59,677 INFO L87 Difference]: Start difference. First operand 1069 states and 1350 transitions. Second operand 25 states. [2018-04-11 13:24:01,470 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 63 DAG size of output 52 [2018-04-11 13:24:02,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:24:02,967 INFO L93 Difference]: Finished difference Result 1845 states and 2284 transitions. [2018-04-11 13:24:02,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-11 13:24:02,967 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 73 [2018-04-11 13:24:02,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:24:02,968 INFO L225 Difference]: With dead ends: 1845 [2018-04-11 13:24:02,968 INFO L226 Difference]: Without dead ends: 1845 [2018-04-11 13:24:02,968 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1347, Invalid=4055, Unknown=0, NotChecked=0, Total=5402 [2018-04-11 13:24:02,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2018-04-11 13:24:02,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1074. [2018-04-11 13:24:02,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1074 states. [2018-04-11 13:24:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1356 transitions. [2018-04-11 13:24:02,974 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1356 transitions. Word has length 73 [2018-04-11 13:24:02,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:24:02,975 INFO L459 AbstractCegarLoop]: Abstraction has 1074 states and 1356 transitions. [2018-04-11 13:24:02,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 13:24:02,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1356 transitions. [2018-04-11 13:24:02,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 13:24:02,975 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:24:02,975 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:24:02,975 INFO L408 AbstractCegarLoop]: === Iteration 96 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:24:02,975 INFO L82 PathProgramCache]: Analyzing trace with hash 664331170, now seen corresponding path program 1 times [2018-04-11 13:24:02,976 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:24:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:24:02,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:24:03,297 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:03,297 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:24:03,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 13:24:03,298 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:24:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:03,298 INFO L182 omatonBuilderFactory]: Interpolants [142112#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 142113#(= 1 (select |#valid| |main_#t~mem40.base|)), 142094#(= 0 |main_#t~malloc0.offset|), 142095#(= main_~tree~0.offset 0), 142092#true, 142093#false, 142098#(and (= main_~tree~0.offset 0) (= 0 |main_#t~malloc19.offset|) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (not (= main_~tmp~0.base |main_#t~malloc19.base|))), 142099#(and (= main_~tree~0.offset 0) (= main_~tree~0.offset main_~newNode~0.offset) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 142096#(and (= main_~tree~0.offset 0) (= (select |#valid| main_~tree~0.base) 1)), 142097#(and (= main_~tree~0.offset 0) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 142102#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~tree~0.offset main_~newNode~0.offset) (not (= main_~newNode~0.base |main_#t~malloc25.base|)) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 142103#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (not (= main_~tree~0.base main_~newNode~0.base)) (not (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset main_~newNode~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 142100#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~tree~0.offset main_~newNode~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 142101#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~newNode~0.base) 1) (= main_~tree~0.offset main_~newNode~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 142106#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8))))), 142107#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8)))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))), 142104#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base main_~newNode~0.base)) (not (= |main_#t~mem26.base| main_~tree~0.base)) (not (= main_~newNode~0.base |main_#t~mem26.base|)) (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset main_~newNode~0.offset)), 142105#(and (= main_~tree~0.offset 0) (not (= |main_#t~mem26.base| main_~tree~0.base)) (not (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 142110#(and (not (= main_~pred~0.base |main_#t~mem37.base|)) (= 0 |main_#t~mem37.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 8))))), 142111#(and (not (= main_~pred~0.base main_~tmp~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 142108#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8)))) (= |main_#t~mem33.offset| 0) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))) (= |main_#t~mem33.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset))), 142109#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8)))) (not (= main_~pred~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))))] [2018-04-11 13:24:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:03,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 13:24:03,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 13:24:03,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:24:03,298 INFO L87 Difference]: Start difference. First operand 1074 states and 1356 transitions. Second operand 22 states. [2018-04-11 13:24:05,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:24:05,143 INFO L93 Difference]: Finished difference Result 1850 states and 2291 transitions. [2018-04-11 13:24:05,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 13:24:05,144 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 74 [2018-04-11 13:24:05,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:24:05,145 INFO L225 Difference]: With dead ends: 1850 [2018-04-11 13:24:05,145 INFO L226 Difference]: Without dead ends: 1850 [2018-04-11 13:24:05,145 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=585, Invalid=2277, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 13:24:05,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2018-04-11 13:24:05,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1082. [2018-04-11 13:24:05,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1082 states. [2018-04-11 13:24:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1365 transitions. [2018-04-11 13:24:05,153 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1365 transitions. Word has length 74 [2018-04-11 13:24:05,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:24:05,153 INFO L459 AbstractCegarLoop]: Abstraction has 1082 states and 1365 transitions. [2018-04-11 13:24:05,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 13:24:05,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1365 transitions. [2018-04-11 13:24:05,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 13:24:05,154 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:24:05,154 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:24:05,154 INFO L408 AbstractCegarLoop]: === Iteration 97 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:24:05,154 INFO L82 PathProgramCache]: Analyzing trace with hash 664331171, now seen corresponding path program 1 times [2018-04-11 13:24:05,154 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:24:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:24:05,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:24:05,613 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:05,613 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:24:05,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 13:24:05,613 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:24:05,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:05,613 INFO L182 omatonBuilderFactory]: Interpolants [145122#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (not (= main_~tree~0.base main_~newNode~0.base)) (not (= |main_#t~mem26.base| main_~tree~0.base)) (not (= main_~newNode~0.base |main_#t~mem26.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= main_~newNode~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))), 145123#(and (= main_~tree~0.offset 0) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8)))) (not (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8)))), 145120#(and (= 0 |main_#t~malloc25.offset|) (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 4 (select |#length| |main_#t~malloc25.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (not (= main_~newNode~0.base |main_#t~malloc25.base|)) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 145121#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base main_~newNode~0.base)) (not (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= main_~newNode~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 145126#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8)))) (= |main_#t~mem33.offset| 0) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))) (= |main_#t~mem33.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset))), 145127#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8)))) (not (= main_~pred~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))), 145124#(and (= main_~tree~0.offset 0) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8)))), 145125#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8)))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))), 145130#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (not (= main_~pred~0.base main_~tmp~0.base)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 145131#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 145128#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) (+ 0 8))) (not (= main_~pred~0.base |main_#t~mem37.base|)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 8)))) (= 0 |main_#t~mem37.offset|)), 145129#(and (not (= main_~pred~0.base main_~tmp~0.base)) (or (<= (+ main_~tmp~0.offset 1) 0) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))))), 145132#(and (= |main_#t~mem40.offset| 0) (= 4 (select |#length| |main_#t~mem40.base|))), 145110#true, 145111#false, 145114#(and (= main_~tree~0.offset 0) (= (select |#valid| main_~tree~0.base) 1)), 145115#(and (= main_~tree~0.offset 0) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 145112#(= 0 |main_#t~malloc0.offset|), 145113#(= main_~tree~0.offset 0), 145118#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~tree~0.base) 1)), 145119#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (= (select |#valid| main_~tree~0.base) 1)), 145116#(and (= main_~tree~0.offset 0) (= 0 |main_#t~malloc19.offset|) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (not (= main_~tmp~0.base |main_#t~malloc19.base|))), 145117#(and (= main_~tree~0.offset 0) (= main_~newNode~0.offset 0) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base))] [2018-04-11 13:24:05,614 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:05,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 13:24:05,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 13:24:05,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:24:05,614 INFO L87 Difference]: Start difference. First operand 1082 states and 1365 transitions. Second operand 23 states. [2018-04-11 13:24:07,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:24:07,784 INFO L93 Difference]: Finished difference Result 1832 states and 2273 transitions. [2018-04-11 13:24:07,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 13:24:07,784 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 74 [2018-04-11 13:24:07,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:24:07,785 INFO L225 Difference]: With dead ends: 1832 [2018-04-11 13:24:07,785 INFO L226 Difference]: Without dead ends: 1832 [2018-04-11 13:24:07,785 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=517, Invalid=2033, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 13:24:07,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2018-04-11 13:24:07,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1082. [2018-04-11 13:24:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1082 states. [2018-04-11 13:24:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1364 transitions. [2018-04-11 13:24:07,792 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1364 transitions. Word has length 74 [2018-04-11 13:24:07,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:24:07,792 INFO L459 AbstractCegarLoop]: Abstraction has 1082 states and 1364 transitions. [2018-04-11 13:24:07,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 13:24:07,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1364 transitions. [2018-04-11 13:24:07,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 13:24:07,793 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:24:07,793 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:24:07,793 INFO L408 AbstractCegarLoop]: === Iteration 98 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:24:07,793 INFO L82 PathProgramCache]: Analyzing trace with hash -636793874, now seen corresponding path program 1 times [2018-04-11 13:24:07,793 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:24:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:24:07,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:24:08,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:08,252 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:24:08,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 13:24:08,252 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:24:08,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:08,253 INFO L182 omatonBuilderFactory]: Interpolants [148103#true, 148106#(= 0 main_~tree~0.offset), 148107#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 148104#false, 148105#(= 0 |main_#t~malloc0.offset|), 148110#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 148111#(and (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 148108#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 main_~tree~0.offset)), 148109#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 148114#(and (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0)) (not (= main_~newNode~0.base main_~tree~0.base)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 148115#(and (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0)) (not (= main_~newNode~0.base main_~tree~0.base)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 148112#(and (not (= |main_#t~malloc19.base| 0)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc19.base|)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 148113#(and (= 0 main_~tree~0.offset) (not (= main_~tmp~0.base main_~newNode~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~newNode~0.base 0)) (= main_~tree~0.base main_~tmp~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 148118#(and (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 148119#(and (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0)) (or (not (= main_~tree~0.base |main_#t~malloc29.base|)) (and (= 0 main_~tree~0.offset) (= 4 (select |#length| main_~tree~0.base)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 148116#(and (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 148117#(and (not (= |main_#t~mem26.base| main_~tree~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 148122#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0)) (not (= main_~tree~0.base |main_#t~mem32.base|))) (and (= 0 main_~tree~0.offset) (= 4 (select |#length| main_~tree~0.base)))), 148123#(or (and (= 0 main_~tree~0.offset) (= 4 (select |#length| main_~tree~0.base))) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0))), 148120#(or (and (= 0 main_~tree~0.offset) (= 4 (select |#length| main_~tree~0.base))) (and (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmpList~0.base main_~tree~0.base)))), 148121#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (and (= 0 main_~tree~0.offset) (= 4 (select |#length| main_~tree~0.base)))), 148126#(or (and (= main_~tmp~0.offset 0) (= 4 (select |#length| main_~tmp~0.base))) |main_#t~short35|), 148127#(and (= main_~tmp~0.offset 0) (= 4 (select |#length| main_~tmp~0.base))), 148124#(or (and (= main_~tmp~0.offset 0) (= 4 (select |#length| main_~tmp~0.base))) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) 0))), 148125#(or (and (= |main_#t~mem33.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) 0))) (and (= main_~tmp~0.offset 0) (= 4 (select |#length| main_~tmp~0.base))))] [2018-04-11 13:24:08,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:08,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 13:24:08,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 13:24:08,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2018-04-11 13:24:08,253 INFO L87 Difference]: Start difference. First operand 1082 states and 1364 transitions. Second operand 25 states. [2018-04-11 13:24:11,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:24:11,028 INFO L93 Difference]: Finished difference Result 1735 states and 2140 transitions. [2018-04-11 13:24:11,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-11 13:24:11,028 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 74 [2018-04-11 13:24:11,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:24:11,029 INFO L225 Difference]: With dead ends: 1735 [2018-04-11 13:24:11,029 INFO L226 Difference]: Without dead ends: 1726 [2018-04-11 13:24:11,029 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1350, Invalid=4052, Unknown=0, NotChecked=0, Total=5402 [2018-04-11 13:24:11,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2018-04-11 13:24:11,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1168. [2018-04-11 13:24:11,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1168 states. [2018-04-11 13:24:11,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1468 transitions. [2018-04-11 13:24:11,036 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1468 transitions. Word has length 74 [2018-04-11 13:24:11,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:24:11,036 INFO L459 AbstractCegarLoop]: Abstraction has 1168 states and 1468 transitions. [2018-04-11 13:24:11,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 13:24:11,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1468 transitions. [2018-04-11 13:24:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-04-11 13:24:11,036 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:24:11,036 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:24:11,037 INFO L408 AbstractCegarLoop]: === Iteration 99 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:24:11,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1516688019, now seen corresponding path program 1 times [2018-04-11 13:24:11,037 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:24:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:24:11,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:24:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:12,929 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:24:12,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-11 13:24:12,929 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:24:12,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:12,929 INFO L182 omatonBuilderFactory]: Interpolants [151130#false, 151131#(= 0 (select |#valid| 0)), 151129#true, 151134#(and (= main_~tree~0.offset 0) (= (store |#valid| main_~tree~0.base 0) |old(#valid)|) (= 0 (select |#valid| 0))), 151135#(and (= main_~tree~0.offset 0) (= (store |#valid| main_~tree~0.base 0) |old(#valid)|) (= 0 (select |#valid| 0)) (= (select |#valid| main_~tree~0.base) 1)), 151132#(and (= |#valid| |old(#valid)|) (= 0 (select |#valid| 0))), 151133#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (= 0 (select |#valid| 0)) (= |main_#t~malloc0.offset| 0)), 151138#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select |#valid| 0)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (or (= |main_#t~mem2.base| (@diff (store |#valid| (@diff |#valid| (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0)) (select (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (@diff |#valid| (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0)))) (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0))) (= main_~tree~0.base (@diff (store |#valid| (@diff |#valid| (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0)) (select (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (@diff |#valid| (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0)))) (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0))) (= (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (store |#valid| (@diff |#valid| (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0)) (select (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (@diff |#valid| (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0)))))) (= (select |#valid| main_~tree~0.base) 1) (or (= |main_#t~mem2.base| (@diff |#valid| (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0))) (= main_~tree~0.base (@diff |#valid| (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0)))) (= (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) |old(#valid)|)), 151139#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| (@diff |#valid| (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0))) 1) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (or (= (select |#valid| (@diff (store |#valid| (@diff |#valid| (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0)) (select (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (@diff |#valid| (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0)))) (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0))) 1) (= (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (store |#valid| (@diff |#valid| (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0)) (select (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (@diff |#valid| (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0)))))) (= 0 (select |#valid| 0)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1) (= (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) |old(#valid)|)), 151136#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 (select |#valid| 0)) (= main_~tree~0.offset |main_#t~malloc1.offset|) (= 0 |main_#t~malloc1.offset|) (= |old(#valid)| (store (store |#valid| main_~tree~0.base 0) |main_#t~malloc1.base| 0))), 151137#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select |#valid| 0)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1) (= (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) |old(#valid)|)), 151142#(and (= |main_#t~mem8.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (store (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) main_~tmpList~0.base 0) |old(#valid)|) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem8.base|)) (= 0 (select |#valid| 0)) (not (= main_~tree~0.base main_~tmpList~0.base)) (= |main_#t~mem8.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 151143#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select |#valid| 0)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (= (store (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0) |old(#valid)|)), 151140#(and (= |old(#valid)| (store (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) |main_#t~malloc5.base| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc5.base|)) (= 0 (select |#valid| 0)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 151141#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (store (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) main_~tmpList~0.base 0) |old(#valid)|) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select |#valid| 0)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 151146#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (or (and (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) |old(#valid)|) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (and (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) |main_#t~short35|) (= 0 (select |#valid| 0)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))), 151147#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 0 (select |#valid| 0)) (or (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) |old(#valid)|)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))), 151144#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= main_~tmp~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 0 (select |#valid| 0)) (or (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) |old(#valid)|)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))), 151145#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (or (and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) |main_#t~mem33.base|) (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) |main_#t~mem33.base|) (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) |old(#valid)|))) (= 0 (select |#valid| 0)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))), 151150#(and (= |main_#t~mem42.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= |main_#t~mem41.offset| 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 0 (select |#valid| 0)) (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (or (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) |old(#valid)|)) (= |main_#t~mem42.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))), 151151#(and (= 0 (select |#valid| 0)) (or (and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (or (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) |old(#valid)|)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))) (not (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))))), 151148#(and (= |main_#t~mem41.offset| 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 0 (select |#valid| 0)) (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (or (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) |old(#valid)|)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))), 151149#(and (= |main_#t~mem41.offset| 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 0 (select |#valid| 0)) (= |main_#t~mem40.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem40.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (or (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) |old(#valid)|)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))), 151154#(and (= 0 (select |#valid| 0)) (or (not (= 0 main_~tmpList~0.offset)) (and (not (= main_~tmpList~0.base main_~tmp~0.base)) (or (not (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select |#memory_$Pointer$.base| main_~tmp~0.base))) (= 0 main_~tmpList~0.base)) (or (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (and (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) main_~tmpList~0.base 0) |old(#valid)|) (not (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))))))), 151155#(and (or (not (= 0 main_~tmpList~0.offset)) (and (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) main_~tmpList~0.base 0) |old(#valid)|) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmpList~0.base main_~tmp~0.base)) (not (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= |main_#t~mem45.base| main_~tmp~0.base))) (= 0 main_~tmpList~0.base)) (= 0 (select |#valid| 0))), 151152#(and (or (not (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem43.base|) |main_#t~mem43.offset|))) (and (= |main_#t~mem43.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) |main_#t~mem43.offset|)) (or (and (= |old(#valid)| (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) (select (select |#memory_$Pointer$.base| |main_#t~mem43.base|) |main_#t~mem43.offset|) 0)) (= |main_#t~mem43.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (and (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem43.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem43.base|) |main_#t~mem43.offset|) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))))) (= 0 (select |#valid| 0))), 151153#(and (or (and (or (and (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (or (= 0 |main_#t~mem44.base|) (not (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select |#memory_$Pointer$.base| main_~tmp~0.base))))) (and (not (= |main_#t~mem44.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (or (= 0 |main_#t~mem44.base|) (not (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select |#memory_$Pointer$.base| main_~tmp~0.base)))) (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) |main_#t~mem44.base| 0) |old(#valid)|))) (not (= main_~tmp~0.base |main_#t~mem44.base|))) (not (= 0 |main_#t~mem44.offset|))) (= 0 (select |#valid| 0))), 151158#(and (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) main_~tmpList~0.base 0) |old(#valid)|) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmpList~0.base main_~tmp~0.base)) (not (= 0 main_~tmpList~0.base)) (not (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 151159#(and (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) main_~tmpList~0.base 0) |old(#valid)|) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmpList~0.base main_~tmp~0.base)) (not (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 151156#(and (or (not (= 0 main_~tmpList~0.offset)) (and (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) main_~tmpList~0.base 0) |old(#valid)|) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmpList~0.base main_~tmp~0.base)) (not (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= |main_#t~mem45.base| main_~tmp~0.base)))) (not (= 0 main_~tmpList~0.base))), 151157#(and (or (not (= 0 main_~tmpList~0.offset)) (and (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) main_~tmpList~0.base 0) |old(#valid)|) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmpList~0.base main_~tmp~0.base)) (not (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))) (not (= 0 main_~tmpList~0.base))), 151162#(= (store |#valid| main_~tmp~0.base 0) |old(#valid)|), 151163#(= |#valid| |old(#valid)|), 151160#(and (= |old(#valid)| (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 151161#(and (not (= |main_#t~mem47.base| main_~tmp~0.base)) (= (store (store |#valid| main_~tmp~0.base 0) |main_#t~mem47.base| 0) |old(#valid)|))] [2018-04-11 13:24:12,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:12,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 13:24:12,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 13:24:12,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1088, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 13:24:12,930 INFO L87 Difference]: Start difference. First operand 1168 states and 1468 transitions. Second operand 35 states. [2018-04-11 13:24:16,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:24:16,875 INFO L93 Difference]: Finished difference Result 1191 states and 1491 transitions. [2018-04-11 13:24:16,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-11 13:24:16,875 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 75 [2018-04-11 13:24:16,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:24:16,876 INFO L225 Difference]: With dead ends: 1191 [2018-04-11 13:24:16,876 INFO L226 Difference]: Without dead ends: 1147 [2018-04-11 13:24:16,876 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=449, Invalid=4521, Unknown=0, NotChecked=0, Total=4970 [2018-04-11 13:24:16,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2018-04-11 13:24:16,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1138. [2018-04-11 13:24:16,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2018-04-11 13:24:16,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1437 transitions. [2018-04-11 13:24:16,880 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1437 transitions. Word has length 75 [2018-04-11 13:24:16,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:24:16,881 INFO L459 AbstractCegarLoop]: Abstraction has 1138 states and 1437 transitions. [2018-04-11 13:24:16,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 13:24:16,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1437 transitions. [2018-04-11 13:24:16,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-04-11 13:24:16,881 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:24:16,881 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:24:16,881 INFO L408 AbstractCegarLoop]: === Iteration 100 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:24:16,881 INFO L82 PathProgramCache]: Analyzing trace with hash 796425647, now seen corresponding path program 1 times [2018-04-11 13:24:16,882 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:24:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:24:16,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:24:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:17,726 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:24:17,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-11 13:24:17,726 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:24:17,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:17,727 INFO L182 omatonBuilderFactory]: Interpolants [153566#false, 153567#(= 0 (select |#valid| 0)), 153565#true, 153570#(and (= 0 (select |#valid| 0)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 153571#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select |#valid| 0)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 153568#(and (= 0 |main_#t~malloc0.offset|) (= 0 (select |#valid| 0))), 153569#(and (= 0 (select |#valid| 0)) (= 0 main_~tree~0.offset)), 153574#(and (= 1 (select |#valid| main_~tree~0.base)) (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select |#valid| 0)) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 4) (= 0 main_~tree~0.offset)), 153575#(and (= 1 (select |#valid| main_~tree~0.base)) (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select |#valid| 0)) (= main_~tree~0.base main_~tmp~0.base)), 153572#(and (= 4 (select |#length| |main_#t~malloc1.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 (select |#valid| 0)) (= 0 main_~tree~0.offset)), 153573#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select |#valid| 0)) (= (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 4) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 153578#(and (= main_~tree~0.offset 0) (or (not (= main_~tree~0.offset main_~tmp~0.offset)) (= main_~newNode~0.offset 0)) (or (and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= 0 (select |#valid| 0))) (= main_~tree~0.offset main_~tmp~0.offset)) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base)), 153579#(and (= 1 (select |#valid| main_~tree~0.base)) (= main_~tree~0.offset 0) (not (= main_~newNode~0.base main_~tree~0.base)) (or (and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select |#valid| 0))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) 4)) (= main_~newNode~0.offset 0))) (or (and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select |#valid| 0))) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) 4)))), 153576#(and (= 1 (select |#valid| main_~tree~0.base)) (= main_~tree~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= 0 (select |#valid| 0))) (= main_~tree~0.offset main_~tmp~0.offset)) (= main_~tree~0.base main_~tmp~0.base)), 153577#(and (= main_~tree~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= 0 (select |#valid| 0))) (= main_~tree~0.offset main_~tmp~0.offset)) (or (not (= main_~tree~0.offset main_~tmp~0.offset)) (= 0 |main_#t~malloc23.offset|)) (not (= |main_#t~malloc23.base| main_~tmp~0.base)) (= main_~tmp~0.base main_~tree~0.base)), 153582#(and (= main_~tree~0.offset 0) (not (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (or (and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select |#valid| 0))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) 4)) (= main_~newNode~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset)))) (or (and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select |#valid| 0))) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) 4))) (not (= (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)) main_~tree~0.base))), 153583#(and (= main_~tree~0.offset 0) (not (= |main_#t~mem26.base| main_~tree~0.base)) (not (= main_~newNode~0.base |main_#t~mem26.base|)) (or (and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select |#valid| 0))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) 4)) (= main_~newNode~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset)))) (or (and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select |#valid| 0))) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) 4)))), 153580#(and (= 1 (select |#valid| main_~tree~0.base)) (= main_~tree~0.offset 0) (or (and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select |#valid| 0))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) 4)) (= main_~newNode~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset)))) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~newNode~0.base) 1) (or (and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select |#valid| 0))) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) 4)))), 153581#(and (= main_~tree~0.offset 0) (or (and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select |#valid| 0))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) 4)) (= main_~newNode~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset)))) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~newNode~0.base |main_#t~malloc25.base|)) (or (and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select |#valid| 0))) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) 4))) (not (= |main_#t~malloc25.base| main_~tree~0.base))), 153586#(and (or (and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 4)) (= 0 (select |#valid| 0))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 4)) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 4)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) 4)))) (= main_~tmp~0.offset 0)), 153587#(and (= main_~tmp~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) 0)) (= |main_#t~mem34.offset| 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) 0)) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)) |main_#t~mem34.offset|)) (and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 0 (select |#valid| 0))))), 153584#(and (= main_~tree~0.offset 0) (not (= |main_#t~mem26.base| main_~tree~0.base)) (or (and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select |#valid| 0))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) 4)) (not (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) 4)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) 4)) 0))))), 153585#(and (= main_~tree~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) 4)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) 4)) 0))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select |#valid| 0))))), 153590#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))) (and (= 0 main_~tmp~0.base) (= 0 (select |#valid| 0)))), 153591#(and (= |main_#t~mem33.base| 0) (= 1 (select |#valid| main_~tmp~0.base)) (= |main_#t~mem33.offset| 0)), 153588#(and (or (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4))))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 0 (select |#valid| 0)))) (= main_~tmp~0.offset 0)), 153589#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem38.base|) |main_#t~mem38.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem38.base|) |main_#t~mem38.offset|))) (and (= 0 |main_#t~mem38.base|) (= 0 (select |#valid| 0)))), 153592#(and (= 1 (select |#valid| main_~tmp~0.base)) (not |main_#t~short35|))] [2018-04-11 13:24:17,727 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:17,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 13:24:17,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 13:24:17,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2018-04-11 13:24:17,727 INFO L87 Difference]: Start difference. First operand 1138 states and 1437 transitions. Second operand 28 states. [2018-04-11 13:24:22,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:24:22,603 INFO L93 Difference]: Finished difference Result 2520 states and 3199 transitions. [2018-04-11 13:24:22,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-11 13:24:22,603 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 76 [2018-04-11 13:24:22,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:24:22,605 INFO L225 Difference]: With dead ends: 2520 [2018-04-11 13:24:22,605 INFO L226 Difference]: Without dead ends: 2520 [2018-04-11 13:24:22,605 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2242 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1220, Invalid=6612, Unknown=0, NotChecked=0, Total=7832 [2018-04-11 13:24:22,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2018-04-11 13:24:22,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1300. [2018-04-11 13:24:22,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2018-04-11 13:24:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1681 transitions. [2018-04-11 13:24:22,616 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1681 transitions. Word has length 76 [2018-04-11 13:24:22,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:24:22,616 INFO L459 AbstractCegarLoop]: Abstraction has 1300 states and 1681 transitions. [2018-04-11 13:24:22,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 13:24:22,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1681 transitions. [2018-04-11 13:24:22,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-04-11 13:24:22,616 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:24:22,616 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:24:22,616 INFO L408 AbstractCegarLoop]: === Iteration 101 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:24:22,617 INFO L82 PathProgramCache]: Analyzing trace with hash 382180097, now seen corresponding path program 1 times [2018-04-11 13:24:22,617 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:24:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:24:22,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:24:22,667 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 13:24:22,667 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:24:22,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-11 13:24:22,667 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:24:22,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:22,667 INFO L182 omatonBuilderFactory]: Interpolants [157538#(= 0 main_~tree~0.offset), 157539#(= main_~tmp~0.offset 0), 157536#false, 157537#(= 0 |main_#t~malloc0.offset|), 157542#(and (<= 8 (select |#length| main_~pred~0.base)) (= main_~pred~0.offset 0)), 157540#(and (= main_~tmp~0.offset 0) (<= (+ main_~tmp~0.offset 8) (select |#length| main_~tmp~0.base))), 157541#(and (= main_~pred~0.base main_~tmp~0.base) (= main_~tmp~0.offset 0) (= main_~pred~0.offset 0) (<= (+ main_~tmp~0.offset 8) (select |#length| main_~tmp~0.base))), 157535#true] [2018-04-11 13:24:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 13:24:22,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 13:24:22,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 13:24:22,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-11 13:24:22,668 INFO L87 Difference]: Start difference. First operand 1300 states and 1681 transitions. Second operand 8 states. [2018-04-11 13:24:22,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:24:22,830 INFO L93 Difference]: Finished difference Result 1539 states and 1960 transitions. [2018-04-11 13:24:22,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 13:24:22,830 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2018-04-11 13:24:22,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:24:22,831 INFO L225 Difference]: With dead ends: 1539 [2018-04-11 13:24:22,831 INFO L226 Difference]: Without dead ends: 1539 [2018-04-11 13:24:22,831 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-04-11 13:24:22,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2018-04-11 13:24:22,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1304. [2018-04-11 13:24:22,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1304 states. [2018-04-11 13:24:22,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1683 transitions. [2018-04-11 13:24:22,838 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1683 transitions. Word has length 76 [2018-04-11 13:24:22,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:24:22,838 INFO L459 AbstractCegarLoop]: Abstraction has 1304 states and 1683 transitions. [2018-04-11 13:24:22,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 13:24:22,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1683 transitions. [2018-04-11 13:24:22,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-04-11 13:24:22,839 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:24:22,839 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:24:22,839 INFO L408 AbstractCegarLoop]: === Iteration 102 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:24:22,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1101368683, now seen corresponding path program 1 times [2018-04-11 13:24:22,840 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:24:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:24:22,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:24:23,510 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:23,510 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:24:23,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 13:24:23,510 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:24:23,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:23,510 INFO L182 omatonBuilderFactory]: Interpolants [160398#true, 160399#false, 160402#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 160403#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 main_~tree~0.offset)), 160400#(= 0 |main_#t~malloc0.offset|), 160401#(= 0 main_~tree~0.offset), 160406#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 160407#(and (= main_~tree~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) |main_#t~mem10.base|) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= |main_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= (select |#valid| main_~tmp~0.base) 1)), 160404#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 160405#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 160410#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tmp~0.base |main_#t~malloc23.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 160411#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tmp~0.base main_~newNode~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 160408#(and (= main_~tree~0.offset 0) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (or |main_#t~short12| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= main_~tmp~0.offset main_~tree~0.offset))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 160409#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 160414#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 160415#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 160412#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 160413#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 160418#(and (= main_~tree~0.offset 0) (or (not (= main_~tree~0.base main_~tmpList~0.base)) (= 4 (select |#length| main_~tmpList~0.base))) (or (= main_~tree~0.base main_~tmpList~0.base) (and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))))), 160419#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 160416#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 160417#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 4 (select |#length| |main_#t~malloc29.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 160422#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 160423#(and (= |main_#t~mem10.offset| 0) (= 0 |main_#t~mem10.base|)), 160420#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~mem32.base|)) (not (= main_~tree~0.base main_~tmpList~0.base))), 160421#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 160424#(not |main_#t~short12|)] [2018-04-11 13:24:23,511 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:23,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 13:24:23,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 13:24:23,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2018-04-11 13:24:23,511 INFO L87 Difference]: Start difference. First operand 1304 states and 1683 transitions. Second operand 27 states. [2018-04-11 13:24:26,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:24:26,358 INFO L93 Difference]: Finished difference Result 2497 states and 3234 transitions. [2018-04-11 13:24:26,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-11 13:24:26,358 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 76 [2018-04-11 13:24:26,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:24:26,359 INFO L225 Difference]: With dead ends: 2497 [2018-04-11 13:24:26,360 INFO L226 Difference]: Without dead ends: 2497 [2018-04-11 13:24:26,360 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1283 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1521, Invalid=4179, Unknown=0, NotChecked=0, Total=5700 [2018-04-11 13:24:26,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2497 states. [2018-04-11 13:24:26,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2497 to 1401. [2018-04-11 13:24:26,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2018-04-11 13:24:26,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1801 transitions. [2018-04-11 13:24:26,370 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1801 transitions. Word has length 76 [2018-04-11 13:24:26,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:24:26,371 INFO L459 AbstractCegarLoop]: Abstraction has 1401 states and 1801 transitions. [2018-04-11 13:24:26,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 13:24:26,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1801 transitions. [2018-04-11 13:24:26,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-11 13:24:26,371 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:24:26,371 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:24:26,371 INFO L408 AbstractCegarLoop]: === Iteration 103 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:24:26,371 INFO L82 PathProgramCache]: Analyzing trace with hash 340868188, now seen corresponding path program 1 times [2018-04-11 13:24:26,372 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:24:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:24:26,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:24:27,094 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:27,095 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:24:27,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-11 13:24:27,095 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:24:27,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-11 13:24:27,095 INFO L182 omatonBuilderFactory]: Interpolants [164422#false, 164423#(= 0 |main_#t~malloc0.offset|), 164421#true, 164426#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= |main_#t~malloc1.offset| main_~tree~0.offset) (= 0 main_~tree~0.offset)), 164427#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 164424#(= 0 main_~tree~0.offset), 164425#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 164430#(and (= main_~tree~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 164431#(and (= main_~tree~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset) (= |main_#t~mem10.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= |main_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= (select |#valid| main_~tmp~0.base) 1)), 164428#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 164429#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 164434#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset) (not (= main_~tmp~0.base |main_#t~malloc23.base|)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 164435#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 164432#(and (or |main_#t~short12| (and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset) (= main_~tmp~0.offset main_~tree~0.offset))) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 164433#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 164438#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 164439#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 164436#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 164437#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base |main_#t~malloc25.base|)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 164442#(and (= main_~tree~0.offset 0) (or (not (= main_~tree~0.base main_~tmpList~0.base)) (= 4 (select |#length| main_~tmpList~0.base))) (or (= main_~tree~0.base main_~tmpList~0.base) (and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)))), 164443#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base main_~tmpList~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 164440#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 164441#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 4 (select |#length| |main_#t~malloc29.base|)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 164446#(and (= main_~tree~0.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))))), 164447#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))), 164444#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 1 (select |#valid| main_~tmpList~0.base)) (not (= main_~tree~0.base main_~tmpList~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 164445#(and (or (and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))) (= main_~tree~0.base |main_#t~mem32.base|)) (= main_~tree~0.offset 0) (not (= main_~tree~0.base main_~tmpList~0.base)) (or (not (= main_~tree~0.base |main_#t~mem32.base|)) (and (= 1 (select |#valid| main_~tmpList~0.base)) (= |main_#t~mem32.offset| main_~tree~0.offset)))), 164450#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 164451#(= 1 (select |#valid| |main_#t~mem37.base|)), 164448#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))) (and (= |main_#t~mem33.base| 0) (= |main_#t~mem33.offset| 0))), 164449#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))) (not |main_#t~short35|)), 164452#(= 1 (select |#valid| main_~tmp~0.base))] [2018-04-11 13:24:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:27,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 13:24:27,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 13:24:27,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2018-04-11 13:24:27,096 INFO L87 Difference]: Start difference. First operand 1401 states and 1801 transitions. Second operand 32 states. [2018-04-11 13:24:31,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:24:31,341 INFO L93 Difference]: Finished difference Result 2475 states and 3181 transitions. [2018-04-11 13:24:31,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-11 13:24:31,341 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 77 [2018-04-11 13:24:31,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:24:31,343 INFO L225 Difference]: With dead ends: 2475 [2018-04-11 13:24:31,343 INFO L226 Difference]: Without dead ends: 2475 [2018-04-11 13:24:31,343 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3197 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2260, Invalid=8246, Unknown=0, NotChecked=0, Total=10506 [2018-04-11 13:24:31,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2018-04-11 13:24:31,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 1480. [2018-04-11 13:24:31,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-04-11 13:24:31,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1897 transitions. [2018-04-11 13:24:31,353 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1897 transitions. Word has length 77 [2018-04-11 13:24:31,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:24:31,354 INFO L459 AbstractCegarLoop]: Abstraction has 1480 states and 1897 transitions. [2018-04-11 13:24:31,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 13:24:31,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1897 transitions. [2018-04-11 13:24:31,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-11 13:24:31,354 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:24:31,354 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:24:31,354 INFO L408 AbstractCegarLoop]: === Iteration 104 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:24:31,354 INFO L82 PathProgramCache]: Analyzing trace with hash 340868189, now seen corresponding path program 1 times [2018-04-11 13:24:31,355 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:24:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:24:31,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:24:31,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:31,935 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:24:31,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 13:24:31,936 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:24:31,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:31,936 INFO L182 omatonBuilderFactory]: Interpolants [168576#(not |main_#t~short35|), 168550#true, 168551#false, 168554#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 168555#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 main_~tree~0.offset)), 168552#(= 0 |main_#t~malloc0.offset|), 168553#(= 0 main_~tree~0.offset), 168558#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 168559#(and (= main_~tree~0.offset 0) (= |main_#t~mem10.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= |main_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= (select |#valid| main_~tmp~0.base) 1)), 168556#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 168557#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 168562#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tmp~0.base |main_#t~malloc23.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 168563#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tmp~0.base main_~newNode~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 168560#(and (or (and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)) |main_#t~short12|) (= (select |#valid| main_~tmp~0.base) 1)), 168561#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 168566#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 168567#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 168564#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 168565#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 168570#(and (= main_~tree~0.offset 0) (or (not (= main_~tree~0.base main_~tmpList~0.base)) (= 4 (select |#length| main_~tmpList~0.base))) (or (= main_~tree~0.base main_~tmpList~0.base) (and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))))), 168571#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 168568#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 168569#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 4 (select |#length| |main_#t~malloc29.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 168574#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 168575#(and (= |main_#t~mem33.base| 0) (= |main_#t~mem33.offset| 0)), 168572#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~mem32.base|)) (not (= main_~tree~0.base main_~tmpList~0.base))), 168573#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)))] [2018-04-11 13:24:31,936 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:31,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 13:24:31,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 13:24:31,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2018-04-11 13:24:31,936 INFO L87 Difference]: Start difference. First operand 1480 states and 1897 transitions. Second operand 27 states. [2018-04-11 13:24:35,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:24:35,242 INFO L93 Difference]: Finished difference Result 2552 states and 3293 transitions. [2018-04-11 13:24:35,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-11 13:24:35,242 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 77 [2018-04-11 13:24:35,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:24:35,243 INFO L225 Difference]: With dead ends: 2552 [2018-04-11 13:24:35,243 INFO L226 Difference]: Without dead ends: 2552 [2018-04-11 13:24:35,244 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2102 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1946, Invalid=6244, Unknown=0, NotChecked=0, Total=8190 [2018-04-11 13:24:35,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2018-04-11 13:24:35,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 1399. [2018-04-11 13:24:35,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1399 states. [2018-04-11 13:24:35,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 1798 transitions. [2018-04-11 13:24:35,253 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 1798 transitions. Word has length 77 [2018-04-11 13:24:35,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:24:35,253 INFO L459 AbstractCegarLoop]: Abstraction has 1399 states and 1798 transitions. [2018-04-11 13:24:35,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 13:24:35,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1798 transitions. [2018-04-11 13:24:35,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-11 13:24:35,254 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:24:35,254 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:24:35,254 INFO L408 AbstractCegarLoop]: === Iteration 105 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:24:35,254 INFO L82 PathProgramCache]: Analyzing trace with hash -119150455, now seen corresponding path program 1 times [2018-04-11 13:24:35,254 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:24:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:24:35,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:24:35,570 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:35,570 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:24:35,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 13:24:35,571 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:24:35,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:35,571 INFO L182 omatonBuilderFactory]: Interpolants [172674#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) (+ 0 8))) (not (= main_~pred~0.base |main_#t~mem37.base|)) (= 0 |main_#t~mem37.offset|)), 172675#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (not (= main_~pred~0.base main_~tmp~0.base))), 172672#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8))) (= |main_#t~mem33.offset| 0) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))) (= |main_#t~mem33.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset))), 172673#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~pred~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))), 172676#(= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))), 172677#(= 0 |main_#t~mem47.offset|), 172658#(= 0 |main_#t~malloc0.offset|), 172659#(= main_~tree~0.offset 0), 172656#true, 172657#false, 172662#(and (= main_~tree~0.offset 0) (= 0 |main_#t~malloc19.offset|) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (not (= main_~tmp~0.base |main_#t~malloc19.base|))), 172663#(and (= main_~tree~0.offset 0) (= main_~tree~0.offset main_~newNode~0.offset) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 172660#(and (= main_~tree~0.offset 0) (= (select |#valid| main_~tree~0.base) 1)), 172661#(and (= main_~tree~0.offset 0) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 172666#(and (= 0 |main_#t~malloc25.offset|) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~tree~0.offset main_~newNode~0.offset) (not (= main_~newNode~0.base |main_#t~malloc25.base|)) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 172667#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (not (= main_~tree~0.base main_~newNode~0.base)) (not (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8))) (= main_~tree~0.offset main_~newNode~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 172664#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~tree~0.offset main_~newNode~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 172665#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~newNode~0.base) 1) (= main_~tree~0.offset main_~newNode~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 172670#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8)))), 172671#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))), 172668#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (not (= main_~tree~0.base main_~newNode~0.base)) (not (= |main_#t~mem26.base| main_~tree~0.base)) (not (= main_~newNode~0.base |main_#t~mem26.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8))) (= main_~tree~0.offset main_~newNode~0.offset)), 172669#(and (= main_~tree~0.offset 0) (not (= |main_#t~mem26.base| main_~tree~0.base)) (not (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8))))] [2018-04-11 13:24:35,571 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:35,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 13:24:35,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 13:24:35,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-04-11 13:24:35,571 INFO L87 Difference]: Start difference. First operand 1399 states and 1798 transitions. Second operand 22 states. [2018-04-11 13:24:37,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:24:37,393 INFO L93 Difference]: Finished difference Result 2322 states and 2948 transitions. [2018-04-11 13:24:37,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 13:24:37,431 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2018-04-11 13:24:37,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:24:37,432 INFO L225 Difference]: With dead ends: 2322 [2018-04-11 13:24:37,432 INFO L226 Difference]: Without dead ends: 2322 [2018-04-11 13:24:37,432 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=560, Invalid=2302, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 13:24:37,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2322 states. [2018-04-11 13:24:37,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2322 to 1402. [2018-04-11 13:24:37,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2018-04-11 13:24:37,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1802 transitions. [2018-04-11 13:24:37,441 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1802 transitions. Word has length 77 [2018-04-11 13:24:37,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:24:37,441 INFO L459 AbstractCegarLoop]: Abstraction has 1402 states and 1802 transitions. [2018-04-11 13:24:37,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 13:24:37,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1802 transitions. [2018-04-11 13:24:37,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-11 13:24:37,441 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:24:37,441 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:24:37,441 INFO L408 AbstractCegarLoop]: === Iteration 106 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:24:37,441 INFO L82 PathProgramCache]: Analyzing trace with hash -958669264, now seen corresponding path program 2 times [2018-04-11 13:24:37,442 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:24:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:24:37,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:24:37,903 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:37,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:24:37,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 13:24:37,903 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:24:37,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:37,904 INFO L182 omatonBuilderFactory]: Interpolants [176482#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (+ 0 4))) (= main_~tmp~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (+ 0 4)))), 176483#(and (= |main_#t~mem34.offset| 0) (= |main_#t~mem34.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (+ 0 4))) (= main_~tmp~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (+ 0 4)))), 176480#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (+ main_~tree~0.offset 4))) (not (= |main_#t~mem26.base| main_~tree~0.base)) (not (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset)), 176481#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset)), 176486#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))), 176487#(and (= 0 |main_#t~mem34.base|) (= |main_#t~mem34.offset| 0)), 176484#(and (= 0 |main_#t~mem38.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem38.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem38.base|) (+ 0 4)))), 176485#(or (<= (+ main_~tmp~0.offset 1) 0) (and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4))))), 176488#(not |main_#t~short35|), 176466#true, 176467#false, 176470#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 176471#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset) (= main_~tree~0.offset main_~tmp~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 176468#(= 0 |main_#t~malloc0.offset|), 176469#(= 0 main_~tree~0.offset), 176474#(and (= 1 (select |#valid| main_~tree~0.base)) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= 0 main_~tree~0.offset)), 176475#(and (= 1 (select |#valid| main_~tree~0.base)) (= 1 (select |#valid| main_~newNode~0.base)) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= 0 main_~tree~0.offset)), 176472#(and (not (= |main_#t~malloc23.base| main_~tmp~0.base)) (= 0 main_~tree~0.offset) (= main_~tmp~0.base main_~tree~0.base) (= main_~tree~0.offset main_~tmp~0.offset) (= 0 |main_#t~malloc23.offset|)), 176473#(and (= main_~newNode~0.offset 0) (= 0 main_~tree~0.offset) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tree~0.offset main_~tmp~0.offset)), 176478#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)) main_~newNode~0.base)) (= main_~newNode~0.offset 0) (= 0 main_~tree~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)) main_~tree~0.base))), 176479#(and (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base |main_#t~mem26.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (= main_~newNode~0.offset 0) (= 0 main_~tree~0.offset)), 176476#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (= 1 (select |#valid| main_~newNode~0.base)) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (= main_~newNode~0.offset 0) (= 0 main_~tree~0.offset)), 176477#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (= main_~newNode~0.offset 0) (= 0 main_~tree~0.offset) (not (= |main_#t~malloc25.base| main_~tree~0.base)) (not (= |main_#t~malloc25.base| main_~newNode~0.base)))] [2018-04-11 13:24:37,904 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:37,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 13:24:37,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 13:24:37,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-04-11 13:24:37,904 INFO L87 Difference]: Start difference. First operand 1402 states and 1802 transitions. Second operand 23 states. [2018-04-11 13:24:40,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:24:40,093 INFO L93 Difference]: Finished difference Result 2240 states and 2811 transitions. [2018-04-11 13:24:40,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-11 13:24:40,094 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 78 [2018-04-11 13:24:40,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:24:40,095 INFO L225 Difference]: With dead ends: 2240 [2018-04-11 13:24:40,095 INFO L226 Difference]: Without dead ends: 2240 [2018-04-11 13:24:40,095 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=861, Invalid=3429, Unknown=0, NotChecked=0, Total=4290 [2018-04-11 13:24:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2018-04-11 13:24:40,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 1396. [2018-04-11 13:24:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1396 states. [2018-04-11 13:24:40,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 1794 transitions. [2018-04-11 13:24:40,104 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 1794 transitions. Word has length 78 [2018-04-11 13:24:40,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:24:40,104 INFO L459 AbstractCegarLoop]: Abstraction has 1396 states and 1794 transitions. [2018-04-11 13:24:40,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 13:24:40,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1794 transitions. [2018-04-11 13:24:40,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-11 13:24:40,104 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:24:40,104 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:24:40,104 INFO L408 AbstractCegarLoop]: === Iteration 107 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:24:40,105 INFO L82 PathProgramCache]: Analyzing trace with hash 2036576946, now seen corresponding path program 1 times [2018-04-11 13:24:40,105 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:24:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:24:40,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:24:40,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:40,749 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:24:40,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 13:24:40,749 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:24:40,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:40,750 INFO L182 omatonBuilderFactory]: Interpolants [180226#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 180227#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= 0 |main_#t~malloc29.base|)) (= 4 (select |#length| |main_#t~malloc29.base|)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 180224#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 180225#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 180230#(and (or (not (= main_~tree~0.base main_~tmpList~0.base)) (and (= 4 (select |#length| main_~tmpList~0.base)) (= 0 main_~tree~0.offset))) (or (= main_~tree~0.base main_~tmpList~0.base) (and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))))), 180231#(and (or (not (= main_~tree~0.base main_~tmpList~0.base)) (and (= 4 (select |#length| main_~tmpList~0.base)) (= 0 main_~tree~0.offset))) (or (= main_~tree~0.base main_~tmpList~0.base) (and (or (and (= |main_#t~mem32.offset| main_~tree~0.offset) (not (= 0 main_~tmpList~0.base))) (not (= main_~tree~0.base |main_#t~mem32.base|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))))), 180228#(and (or (not (= main_~tree~0.base main_~tmpList~0.base)) (and (= 4 (select |#length| main_~tmpList~0.base)) (= 0 main_~tree~0.offset))) (or (= main_~tree~0.base main_~tmpList~0.base) (and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= 0 main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))))), 180229#(and (or (not (= main_~tree~0.base main_~tmpList~0.base)) (and (= 4 (select |#length| main_~tmpList~0.base)) (= 0 main_~tree~0.offset))) (or (= main_~tree~0.base main_~tmpList~0.base) (and (= |main_#t~mem30.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))))), 180234#(or (not (= 0 |main_#t~mem33.base|)) (and (= main_~tmp~0.offset 0) (= 4 (select |#length| main_~tmp~0.base))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 180235#(or (and (= main_~tmp~0.offset 0) (= 4 (select |#length| main_~tmp~0.base))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) |main_#t~short35|), 180232#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (and (= 0 main_~tree~0.offset) (= 4 (select |#length| main_~tree~0.base))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 180233#(or (and (= main_~tmp~0.offset 0) (= 4 (select |#length| main_~tmp~0.base))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 180238#(= 1 (select |#valid| |main_#t~mem40.base|)), 180236#(or (and (= main_~tmp~0.offset 0) (= 4 (select |#length| main_~tmp~0.base))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 180237#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 180211#true, 180214#(= 0 main_~tree~0.offset), 180215#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 180212#false, 180213#(= |main_#t~malloc0.offset| 0), 180218#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 180219#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 180216#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= main_~tree~0.offset |main_#t~malloc1.offset|) (= 0 main_~tree~0.offset)), 180217#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 180222#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 180223#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~newNode~0.base main_~tree~0.base)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 180220#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tmp~0.base |main_#t~malloc23.base|)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tree~0.base main_~tmp~0.base)), 180221#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base))] [2018-04-11 13:24:40,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:40,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 13:24:40,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 13:24:40,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2018-04-11 13:24:40,751 INFO L87 Difference]: Start difference. First operand 1396 states and 1794 transitions. Second operand 28 states. [2018-04-11 13:24:45,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:24:45,195 INFO L93 Difference]: Finished difference Result 1971 states and 2502 transitions. [2018-04-11 13:24:45,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-11 13:24:45,195 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 78 [2018-04-11 13:24:45,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:24:45,196 INFO L225 Difference]: With dead ends: 1971 [2018-04-11 13:24:45,197 INFO L226 Difference]: Without dead ends: 1971 [2018-04-11 13:24:45,197 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2087 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1806, Invalid=6566, Unknown=0, NotChecked=0, Total=8372 [2018-04-11 13:24:45,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2018-04-11 13:24:45,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1410. [2018-04-11 13:24:45,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1410 states. [2018-04-11 13:24:45,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 1810 transitions. [2018-04-11 13:24:45,205 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 1810 transitions. Word has length 78 [2018-04-11 13:24:45,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:24:45,205 INFO L459 AbstractCegarLoop]: Abstraction has 1410 states and 1810 transitions. [2018-04-11 13:24:45,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 13:24:45,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 1810 transitions. [2018-04-11 13:24:45,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-11 13:24:45,205 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:24:45,206 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:24:45,206 INFO L408 AbstractCegarLoop]: === Iteration 108 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:24:45,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2036576947, now seen corresponding path program 1 times [2018-04-11 13:24:45,206 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:24:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:24:45,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:24:45,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:45,782 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:24:45,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-11 13:24:45,783 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:24:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:45,783 INFO L182 omatonBuilderFactory]: Interpolants [183750#(= |main_#t~malloc0.offset| 0), 183751#(= 0 main_~tree~0.offset), 183748#true, 183749#false, 183754#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 183755#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 183752#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 183753#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= main_~tree~0.offset |main_#t~malloc1.offset|) (= 0 main_~tree~0.offset)), 183758#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tmp~0.base |main_#t~malloc23.base|)) (not (= 0 |main_#t~malloc23.base|)) (= 0 main_~tree~0.offset) (= main_~tree~0.offset main_~tmp~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 183759#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (not (= 0 main_~newNode~0.base)) (= 0 main_~tree~0.offset) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.offset main_~tmp~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 183756#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 183757#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= main_~tree~0.offset main_~tmp~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 183762#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 183763#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= |main_#t~mem26.base| main_~tree~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= 0 main_~tree~0.offset)), 183760#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (not (= main_~newNode~0.base main_~tree~0.base)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 183761#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (not (= main_~newNode~0.base main_~tree~0.base)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 183766#(or (and (= 0 main_~tree~0.offset) (= 4 (select |#length| main_~tree~0.base))) (and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (not (= 0 main_~tmpList~0.base)) (not (= main_~tmpList~0.base main_~tree~0.base)))), 183767#(or (and (= 0 main_~tree~0.offset) (= 4 (select |#length| main_~tree~0.base))) (and (= |main_#t~mem32.offset| main_~tree~0.offset) (not (= 0 main_~tmpList~0.base)) (= main_~tree~0.base |main_#t~mem32.base|)) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (not (= |main_#t~mem32.base| main_~tree~0.base)))), 183764#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= 0 main_~tree~0.offset)), 183765#(or (and (= 0 main_~tree~0.offset) (= 4 (select |#length| main_~tree~0.base))) (and (not (= main_~tree~0.base |main_#t~malloc29.base|)) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (not (= 0 |main_#t~malloc29.base|)))), 183770#(or (not (= 0 |main_#t~mem33.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))) (and (= main_~tmp~0.offset 0) (= 4 (select |#length| main_~tmp~0.base)))), 183771#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))) (and (= main_~tmp~0.offset 0) (= 4 (select |#length| main_~tmp~0.base))) |main_#t~short35|), 183768#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (and (= 0 main_~tree~0.offset) (= 4 (select |#length| main_~tree~0.base))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))))), 183769#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))) (and (= main_~tmp~0.offset 0) (= 4 (select |#length| main_~tmp~0.base))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))), 183774#(or (and (= main_~tmp~0.offset 0) (= 4 (select |#length| main_~tmp~0.base))) |main_#t~short35|), 183775#(and (= main_~tmp~0.offset 0) (= 4 (select |#length| main_~tmp~0.base))), 183772#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))) (and (= main_~tmp~0.offset 0) (= 4 (select |#length| main_~tmp~0.base)))), 183773#(or (and (= main_~tmp~0.offset 0) (= 4 (select |#length| main_~tmp~0.base))) (not (= 0 |main_#t~mem34.base|)))] [2018-04-11 13:24:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:45,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 13:24:45,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 13:24:45,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2018-04-11 13:24:45,783 INFO L87 Difference]: Start difference. First operand 1410 states and 1810 transitions. Second operand 28 states. [2018-04-11 13:24:47,456 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 88 DAG size of output 73 [2018-04-11 13:24:49,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:24:49,176 INFO L93 Difference]: Finished difference Result 1976 states and 2510 transitions. [2018-04-11 13:24:49,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-11 13:24:49,176 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 78 [2018-04-11 13:24:49,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:24:49,177 INFO L225 Difference]: With dead ends: 1976 [2018-04-11 13:24:49,177 INFO L226 Difference]: Without dead ends: 1972 [2018-04-11 13:24:49,177 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1134 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1364, Invalid=3892, Unknown=0, NotChecked=0, Total=5256 [2018-04-11 13:24:49,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2018-04-11 13:24:49,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1405. [2018-04-11 13:24:49,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1405 states. [2018-04-11 13:24:49,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1803 transitions. [2018-04-11 13:24:49,185 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1803 transitions. Word has length 78 [2018-04-11 13:24:49,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:24:49,185 INFO L459 AbstractCegarLoop]: Abstraction has 1405 states and 1803 transitions. [2018-04-11 13:24:49,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 13:24:49,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1803 transitions. [2018-04-11 13:24:49,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-11 13:24:49,186 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:24:49,186 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:24:49,186 INFO L408 AbstractCegarLoop]: === Iteration 109 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:24:49,186 INFO L82 PathProgramCache]: Analyzing trace with hash -662723171, now seen corresponding path program 1 times [2018-04-11 13:24:49,186 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:24:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:24:49,195 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:24:50,021 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:50,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:24:50,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-11 13:24:50,021 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:24:50,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:50,022 INFO L182 omatonBuilderFactory]: Interpolants [187266#(and (= main_~tree~0.offset 0) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (or (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))))), 187267#(and (= main_~tree~0.offset 0) (or (and (not (= main_~tree~0.base |main_#t~malloc29.base|)) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (or (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= |main_#t~malloc29.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (not (= 0 |main_#t~malloc29.base|))) (= 4 (select |#length| main_~tree~0.base)))), 187264#(and (= main_~tree~0.offset 0) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 1 (select |#valid| main_~newNode~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (or (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))))), 187265#(and (= main_~tree~0.offset 0) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (or (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))))), 187270#(and (= main_~tree~0.offset 0) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= 0 main_~tmpList~0.base)) (or (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))))), 187271#(and (= main_~tree~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (or (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))))) (= main_~tree~0.base |main_#t~mem32.base|)) (or (and (= |main_#t~mem32.offset| main_~tree~0.offset) (not (= 0 main_~tmpList~0.base))) (not (= main_~tree~0.base |main_#t~mem32.base|)))), 187268#(and (= main_~tree~0.offset 0) (or (and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= 0 main_~tmpList~0.base)) (not (= main_~tmpList~0.base main_~tree~0.base)) (or (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))))) (= 4 (select |#length| main_~tree~0.base)))), 187269#(and (= main_~tree~0.offset 0) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= 0 main_~tmpList~0.base)) (not (= main_~tmpList~0.base main_~tree~0.base)) (or (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))))), 187274#(or (and (= |main_#t~mem34.offset| 0) (or (= 0 |main_#t~mem34.base|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))), 187275#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))) (not |main_#t~short35|)), 187272#(and (= main_~tree~0.offset 0) (or (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (or (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))))))), 187273#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))) (and (or (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4))))), 187278#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))), 187279#(= 1 (select |#valid| |main_#t~mem38.base|)), 187276#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))), 187277#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))) (not (= 0 |main_#t~mem36.base|))), 187280#(= 1 (select |#valid| main_~tmp~0.base)), 187247#true, 187250#(= 0 main_~tree~0.offset), 187251#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 187248#false, 187249#(= |main_#t~malloc0.offset| 0), 187254#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 187255#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 187252#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 187253#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= main_~tree~0.offset |main_#t~malloc1.offset|) (= 0 main_~tree~0.offset)), 187258#(and (= main_~tree~0.offset 0) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (or (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tree~0.offset main_~tmp~0.offset)) (= main_~tree~0.base main_~tmp~0.base) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tree~0.offset main_~tmp~0.offset)) (= (select |#valid| main_~tmp~0.base) 1)), 187259#(and (= main_~tree~0.offset 0) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (or (not (= main_~tree~0.offset main_~tmp~0.offset)) (= 0 |main_#t~malloc23.offset|)) (not (= main_~tmp~0.base |main_#t~malloc23.base|)) (or (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tree~0.offset main_~tmp~0.offset)) (= main_~tree~0.base main_~tmp~0.base) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tree~0.offset main_~tmp~0.offset))), 187256#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 187257#(and (= main_~tree~0.offset 0) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 187262#(and (= main_~tree~0.offset 0) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (or (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 187263#(and (= main_~tree~0.offset 0) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| main_~newNode~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (or (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 187260#(and (= main_~tree~0.offset 0) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (not (= main_~tmp~0.base main_~newNode~0.base)) (or (= 0 main_~newNode~0.offset) (not (= main_~tree~0.offset main_~tmp~0.offset))) (or (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tree~0.offset main_~tmp~0.offset)) (= main_~tree~0.base main_~tmp~0.base) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tree~0.offset main_~tmp~0.offset))), 187261#(and (= main_~tree~0.offset 0) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (or (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1))] [2018-04-11 13:24:50,022 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:50,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-11 13:24:50,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-11 13:24:50,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=991, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 13:24:50,022 INFO L87 Difference]: Start difference. First operand 1405 states and 1803 transitions. Second operand 34 states. [2018-04-11 13:24:55,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:24:55,917 INFO L93 Difference]: Finished difference Result 2134 states and 2730 transitions. [2018-04-11 13:24:55,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-11 13:24:55,917 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 79 [2018-04-11 13:24:55,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:24:55,918 INFO L225 Difference]: With dead ends: 2134 [2018-04-11 13:24:55,918 INFO L226 Difference]: Without dead ends: 2134 [2018-04-11 13:24:55,919 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3317 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1995, Invalid=9135, Unknown=0, NotChecked=0, Total=11130 [2018-04-11 13:24:55,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2018-04-11 13:24:55,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 1411. [2018-04-11 13:24:55,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2018-04-11 13:24:55,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1810 transitions. [2018-04-11 13:24:55,926 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1810 transitions. Word has length 79 [2018-04-11 13:24:55,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:24:55,926 INFO L459 AbstractCegarLoop]: Abstraction has 1411 states and 1810 transitions. [2018-04-11 13:24:55,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-11 13:24:55,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1810 transitions. [2018-04-11 13:24:55,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-11 13:24:55,927 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:24:55,927 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:24:55,927 INFO L408 AbstractCegarLoop]: === Iteration 110 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:24:55,927 INFO L82 PathProgramCache]: Analyzing trace with hash -662723170, now seen corresponding path program 1 times [2018-04-11 13:24:55,927 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:24:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:24:55,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:24:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:56,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:24:56,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-11 13:24:56,868 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:24:56,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:56,868 INFO L182 omatonBuilderFactory]: Interpolants [190978#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 190979#(and (= main_~tree~0.offset 0) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1) (= main_~tree~0.offset main_~tmp~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 190976#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 190977#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 190982#(and (or (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)) (= main_~tree~0.offset 0) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~tree~0.base) 1)), 190983#(and (= main_~tree~0.offset 0) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (or (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~malloc25.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 190980#(and (= main_~tree~0.offset 0) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tmp~0.base |main_#t~malloc23.base|)) (= main_~tree~0.offset main_~tmp~0.offset) (= 0 |main_#t~malloc23.offset|) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) 1) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)) |main_#t~malloc23.base|)) (= main_~tree~0.base main_~tmp~0.base)), 190981#(and (= main_~tree~0.offset 0) (or (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) 1)) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= main_~newNode~0.offset 0) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.offset main_~tmp~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 190986#(and (= main_~tree~0.offset 0) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) 1) (or (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1))), 190987#(and (= main_~tree~0.offset 0) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 190984#(and (= main_~tree~0.offset 0) (or (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (<= (+ main_~newNode~0.offset 12) (select |#length| main_~newNode~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 190985#(and (= main_~tree~0.offset 0) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (<= (+ main_~newNode~0.offset 12) (select |#length| main_~newNode~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (or (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1))), 190990#(and (= main_~tree~0.offset 0) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= |main_#t~mem30.base| main_~tmpList~0.base)) (not (= 0 main_~tmpList~0.base)) (= |main_#t~mem30.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 190991#(and (not (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= main_~tree~0.offset 0) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (not (= 0 main_~tmpList~0.base)) (not (= main_~tree~0.base main_~tmpList~0.base))), 190988#(and (= main_~tree~0.offset 0) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~malloc29.base|)) (not (= 0 |main_#t~malloc29.base|)) (= 4 (select |#length| |main_#t~malloc29.base|))), 190989#(and (= main_~tree~0.offset 0) (or (= main_~tree~0.base main_~tmpList~0.base) (and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (not (= 0 main_~tmpList~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tmpList~0.base)))) (or (not (= main_~tree~0.base main_~tmpList~0.base)) (= 4 (select |#length| main_~tmpList~0.base)))), 190994#(and (= main_~tree~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))))), 190995#(or (and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))), 190992#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= 0 main_~tmpList~0.base)) (or (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.base)) (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (+ main_~tree~0.offset 8))))), 190993#(and (= main_~tree~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))))) (= main_~tree~0.base |main_#t~mem32.base|)) (not (= main_~tree~0.base main_~tmpList~0.base)) (or (and (= |main_#t~mem32.offset| main_~tree~0.offset) (not (= 0 main_~tmpList~0.base))) (not (= main_~tree~0.base |main_#t~mem32.base|)))), 190998#(and (= 0 |main_#t~mem38.offset|) (<= 12 (select |#length| |main_#t~mem38.base|))), 190999#(and (<= 12 (select |#length| main_~tmp~0.base)) (= main_~tmp~0.offset 0)), 190996#(or (and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))) (not (= 0 |main_#t~mem36.base|))), 190997#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))), 190970#true, 190971#false, 190974#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 190975#(and (= (select |#valid| |main_#t~malloc1.base|) 1) (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= main_~tree~0.offset |main_#t~malloc1.offset|) (= 0 main_~tree~0.offset)), 190972#(= |main_#t~malloc0.offset| 0), 190973#(= 0 main_~tree~0.offset)] [2018-04-11 13:24:56,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:24:56,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 13:24:56,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 13:24:56,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2018-04-11 13:24:56,868 INFO L87 Difference]: Start difference. First operand 1411 states and 1810 transitions. Second operand 30 states. [2018-04-11 13:25:01,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:25:01,837 INFO L93 Difference]: Finished difference Result 2025 states and 2576 transitions. [2018-04-11 13:25:01,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-11 13:25:01,837 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 79 [2018-04-11 13:25:01,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:25:01,838 INFO L225 Difference]: With dead ends: 2025 [2018-04-11 13:25:01,838 INFO L226 Difference]: Without dead ends: 2025 [2018-04-11 13:25:01,838 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1149 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1420, Invalid=4432, Unknown=0, NotChecked=0, Total=5852 [2018-04-11 13:25:01,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2025 states. [2018-04-11 13:25:01,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2025 to 1439. [2018-04-11 13:25:01,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1439 states. [2018-04-11 13:25:01,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 1843 transitions. [2018-04-11 13:25:01,846 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 1843 transitions. Word has length 79 [2018-04-11 13:25:01,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:25:01,846 INFO L459 AbstractCegarLoop]: Abstraction has 1439 states and 1843 transitions. [2018-04-11 13:25:01,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 13:25:01,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1843 transitions. [2018-04-11 13:25:01,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-11 13:25:01,846 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:25:01,846 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:25:01,846 INFO L408 AbstractCegarLoop]: === Iteration 111 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:25:01,847 INFO L82 PathProgramCache]: Analyzing trace with hash -470253019, now seen corresponding path program 1 times [2018-04-11 13:25:01,847 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:25:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:25:01,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:25:02,818 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:25:02,818 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:25:02,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-11 13:25:02,819 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:25:02,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:25:02,819 INFO L182 omatonBuilderFactory]: Interpolants [194562#(and (= main_~tree~0.offset 0) (= (select |#valid| main_~tree~0.base) 1)), 194563#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= (select |#valid| main_~tree~0.base) 1)), 194560#(= 0 |main_#t~malloc0.offset|), 194561#(= main_~tree~0.offset 0), 194566#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= (select |#valid| main_~tree~0.base) 1)), 194567#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= main_~tree~0.offset main_~tmp~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 194564#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~malloc1.base|))), 194565#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 194570#(and (= main_~tree~0.offset 0) (= main_~newNode~0.offset 0) (not (= main_~tmp~0.base main_~newNode~0.base)) (= 12 (select |#length| main_~newNode~0.base)) (= main_~tree~0.offset main_~tmp~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 194571#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= 12 (select |#length| main_~newNode~0.base)) (= (select |#valid| main_~tree~0.base) 1)), 194568#(and (= main_~tree~0.offset 0) (= main_~tmp~0.base main_~tree~0.base) (= main_~tree~0.offset main_~tmp~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 194569#(and (= main_~tree~0.offset 0) (= 12 (select |#length| |main_#t~malloc23.base|)) (not (= main_~tmp~0.base |main_#t~malloc23.base|)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tree~0.offset main_~tmp~0.offset) (= 0 |main_#t~malloc23.offset|)), 194574#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= main_~newNode~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (and (not (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))))) (= 12 (select |#length| main_~newNode~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 194575#(and (= main_~tree~0.offset 0) (not (= |main_#t~mem26.base| main_~tree~0.base)) (or (and (not (= main_~newNode~0.base |main_#t~mem26.base|)) (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= main_~newNode~0.offset 0) (= 12 (select |#length| main_~newNode~0.base))), 194572#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (= 12 (select |#length| main_~newNode~0.base)) (= (select |#valid| main_~tree~0.base) 1)), 194573#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (not (= main_~newNode~0.base |main_#t~malloc25.base|)) (= 12 (select |#length| main_~newNode~0.base)) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 194578#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))) (or (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (+ 0 8)))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))))))), 194579#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))) (= |main_#t~mem34.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (or (= 0 |main_#t~mem34.base|) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (+ 0 8)))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))))))), 194576#(and (= main_~tree~0.offset 0) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (or (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (and (not (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))))))), 194577#(and (= main_~tree~0.offset 0) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))))), 194582#(and (= 12 (select |#length| |main_#t~mem38.base|)) (or (and (not (= main_~pred~0.base |main_#t~mem38.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem38.base|) (+ 0 8))))) (not (= |main_#t~mem38.offset| 0)))), 194583#(and (= 12 (select |#length| main_~tmp~0.base)) (or (not (= main_~tmp~0.offset 0)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmp~0.base main_~pred~0.base))))), 194580#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))) (or (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)) 0)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (+ 0 8)))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))))) (not |main_#t~short35|))), 194581#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))) (or (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)) 0)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (+ 0 8)))) (not (= main_~pred~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))))))), 194586#(and (= main_~tmp~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 194587#(= 1 (select |#valid| |main_#t~mem40.base|)), 194584#(and (= 12 (select |#length| main_~tmp~0.base)) (or (not (= main_~tmp~0.offset 0)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmp~0.base main_~pred~0.base)))) (<= 0 main_~tmp~0.offset)), 194585#(and (= 12 (select |#length| main_~tmp~0.base)) (or (not (= main_~tmp~0.offset 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (<= 0 main_~tmp~0.offset)), 194558#true, 194559#false] [2018-04-11 13:25:02,819 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:25:02,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 13:25:02,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 13:25:02,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2018-04-11 13:25:02,820 INFO L87 Difference]: Start difference. First operand 1439 states and 1843 transitions. Second operand 30 states. [2018-04-11 13:25:06,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:25:06,094 INFO L93 Difference]: Finished difference Result 2052 states and 2583 transitions. [2018-04-11 13:25:06,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-11 13:25:06,094 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 80 [2018-04-11 13:25:06,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:25:06,095 INFO L225 Difference]: With dead ends: 2052 [2018-04-11 13:25:06,095 INFO L226 Difference]: Without dead ends: 2052 [2018-04-11 13:25:06,096 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1194 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=728, Invalid=4528, Unknown=0, NotChecked=0, Total=5256 [2018-04-11 13:25:06,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2018-04-11 13:25:06,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 1439. [2018-04-11 13:25:06,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1439 states. [2018-04-11 13:25:06,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 1841 transitions. [2018-04-11 13:25:06,103 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 1841 transitions. Word has length 80 [2018-04-11 13:25:06,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:25:06,103 INFO L459 AbstractCegarLoop]: Abstraction has 1439 states and 1841 transitions. [2018-04-11 13:25:06,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 13:25:06,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1841 transitions. [2018-04-11 13:25:06,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-11 13:25:06,104 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:25:06,104 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:25:06,104 INFO L408 AbstractCegarLoop]: === Iteration 112 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:25:06,104 INFO L82 PathProgramCache]: Analyzing trace with hash -470253018, now seen corresponding path program 1 times [2018-04-11 13:25:06,104 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:25:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:25:06,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:25:06,964 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:25:06,964 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:25:06,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-11 13:25:06,964 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:25:06,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-11 13:25:06,965 INFO L182 omatonBuilderFactory]: Interpolants [198167#(= 0 |main_#t~malloc0.offset|), 198166#false, 198165#true, 198171#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~malloc1.base|))), 198170#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= (select |#valid| main_~tree~0.base) 1)), 198169#(and (= main_~tree~0.offset 0) (= (select |#valid| main_~tree~0.base) 1)), 198168#(= main_~tree~0.offset 0), 198175#(and (= main_~tree~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)) |main_#t~mem20.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= (select |#valid| main_~tree~0.base) 1) (or (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tree~0.offset main_~tmp~0.offset)) (= main_~tree~0.base main_~tmp~0.base)), 198174#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= (select |#valid| main_~tree~0.base) 1) (= main_~tree~0.base main_~tmp~0.base)), 198173#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= (select |#valid| main_~tree~0.base) 1)), 198172#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 198179#(and (= main_~tree~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)) main_~newNode~0.offset) (= main_~newNode~0.offset 0) (not (= main_~tmp~0.base main_~newNode~0.base)) (or (and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4)))) (= main_~tree~0.offset main_~tmp~0.offset)) (= main_~tree~0.base main_~tmp~0.base)), 198178#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base |main_#t~malloc23.base|)) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)) |main_#t~malloc23.offset|) (or (and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4)))) (= main_~tree~0.offset main_~tmp~0.offset)) (= 0 |main_#t~malloc23.offset|) (= main_~tree~0.base main_~tmp~0.base)), 198177#(and (= main_~tree~0.offset 0) (= (select |#valid| main_~tree~0.base) 1) (or (and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4)))) (= main_~tree~0.offset main_~tmp~0.offset)) (= main_~tree~0.base main_~tmp~0.base) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)) 0)), 198176#(and (= main_~tree~0.offset 0) (or (and (or (and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4)))) (= main_~tree~0.offset main_~tmp~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)) 0)) (not |main_#t~short22|)) (= (select |#valid| main_~tree~0.base) 1) (= main_~tree~0.base main_~tmp~0.base)), 198183#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= main_~newNode~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (and (= (+ main_~tree~0.offset 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 198182#(and (= main_~tree~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (and (= 0 |main_#t~malloc25.offset|) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= (+ main_~tree~0.offset 4) (select |#length| |main_#t~malloc25.base|)) (not (= main_~newNode~0.base |main_#t~malloc25.base|)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 198181#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (or (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= (select |#valid| main_~newNode~0.base) 1))) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~tree~0.base) 1)), 198180#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (or (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~tree~0.base) 1)), 198187#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (or (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (+ 0 8)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (+ 0 8))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))))))), 198186#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (+ main_~tree~0.offset 8))) (= (+ main_~tree~0.offset 4) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))))), 198185#(and (= main_~tree~0.offset 0) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (or (and (not (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (+ main_~tree~0.offset 8))) (= (+ main_~tree~0.offset 4) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))))), 198184#(and (= main_~tree~0.offset 0) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= main_~newNode~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (and (= (+ main_~tree~0.offset 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (not (= main_~newNode~0.base |main_#t~mem26.base|)) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))))))), 198191#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem38.base|) (+ 0 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem38.base|) (+ 0 8)))) (not (= main_~pred~0.base |main_#t~mem38.base|)) (= 0 |main_#t~mem38.offset|)), 198190#(and (not (= main_~pred~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (+ 0 8)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (+ 0 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))), 198189#(and (or (and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (+ 0 8)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (+ 0 8))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))))) (not |main_#t~short35|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))), 198188#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (or (and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (+ 0 8)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (+ 0 8))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))))) (and (= 0 |main_#t~mem34.base|) (= |main_#t~mem34.offset| 0)))), 198194#(and (<= 4 (select |#length| |main_#t~mem40.base|)) (= |main_#t~mem40.offset| 0)), 198193#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 198192#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmp~0.base main_~pred~0.base)))] [2018-04-11 13:25:06,965 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:25:06,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 13:25:06,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 13:25:06,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=771, Unknown=0, NotChecked=0, Total=870 [2018-04-11 13:25:06,965 INFO L87 Difference]: Start difference. First operand 1439 states and 1841 transitions. Second operand 30 states. [2018-04-11 13:25:08,733 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 104 DAG size of output 90 [2018-04-11 13:25:08,909 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 107 DAG size of output 92 [2018-04-11 13:25:09,221 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 119 DAG size of output 104 [2018-04-11 13:25:11,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:25:11,110 INFO L93 Difference]: Finished difference Result 1904 states and 2431 transitions. [2018-04-11 13:25:11,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-11 13:25:11,110 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 80 [2018-04-11 13:25:11,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:25:11,111 INFO L225 Difference]: With dead ends: 1904 [2018-04-11 13:25:11,111 INFO L226 Difference]: Without dead ends: 1904 [2018-04-11 13:25:11,111 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1266 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=873, Invalid=4529, Unknown=0, NotChecked=0, Total=5402 [2018-04-11 13:25:11,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2018-04-11 13:25:11,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1468. [2018-04-11 13:25:11,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1468 states. [2018-04-11 13:25:11,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 1871 transitions. [2018-04-11 13:25:11,119 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 1871 transitions. Word has length 80 [2018-04-11 13:25:11,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:25:11,119 INFO L459 AbstractCegarLoop]: Abstraction has 1468 states and 1871 transitions. [2018-04-11 13:25:11,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 13:25:11,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1871 transitions. [2018-04-11 13:25:11,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-11 13:25:11,120 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:25:11,120 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:25:11,120 INFO L408 AbstractCegarLoop]: === Iteration 113 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:25:11,120 INFO L82 PathProgramCache]: Analyzing trace with hash 56477507, now seen corresponding path program 1 times [2018-04-11 13:25:11,120 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:25:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:25:11,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:25:11,713 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 13:25:11,713 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:25:11,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 13:25:11,713 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:25:11,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:25:11,713 INFO L182 omatonBuilderFactory]: Interpolants [201667#(and (= main_~tree~0.offset 0) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 201666#(and (= main_~tree~0.offset 0) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) 1) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base)), 201665#(and (= main_~tree~0.offset 0) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) 1) (not (= main_~tmp~0.base |main_#t~malloc23.base|)) (= main_~tmp~0.base main_~tree~0.base)), 201664#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 0 main_~tree~0.offset) (= main_~tmp~0.base main_~tree~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tmp~0.base) 1)), 201671#(and (= main_~tree~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 201670#(and (= main_~tree~0.offset 0) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 201669#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 201668#(and (= main_~tree~0.offset 0) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base |main_#t~malloc25.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 201675#(and (= main_~tree~0.offset 0) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (not (= main_~tmp~0.base main_~newNode~0.base)) (or (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))))) (= main_~tree~0.base main_~tmp~0.base)), 201674#(and (= main_~tree~0.offset 0) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~malloc19.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc19.base|)) (= main_~tree~0.base main_~tmp~0.base)), 201673#(and (= main_~tree~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= (select |#valid| main_~tree~0.base) 1) (= main_~tree~0.base main_~tmp~0.base)), 201672#(and (= main_~tree~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= main_~tree~0.base main_~tmp~0.base)), 201679#(and (= main_~tree~0.offset 0) (not (= |main_#t~mem26.base| main_~tree~0.base)) (or (and (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))), 201678#(and (= main_~tree~0.offset 0) (or (= (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 201677#(and (= main_~tree~0.offset 0) (not (= main_~newNode~0.base main_~tree~0.base)) (or (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~malloc25.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 201676#(and (= main_~tree~0.offset 0) (or (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1)), 201681#(= 1 (select |#valid| |main_#t~mem30.base|)), 201680#(and (= main_~tree~0.offset 0) (not (= |main_#t~mem26.base| main_~tree~0.base)) (or (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))), 201655#true, 201659#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 201658#(= 0 main_~tree~0.offset), 201657#(= 0 |main_#t~malloc0.offset|), 201656#false, 201663#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 201662#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 201661#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 201660#(and (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 main_~tree~0.offset) (= 1 (select |#valid| |main_#t~malloc1.base|)))] [2018-04-11 13:25:11,714 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 13:25:11,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 13:25:11,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 13:25:11,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2018-04-11 13:25:11,714 INFO L87 Difference]: Start difference. First operand 1468 states and 1871 transitions. Second operand 27 states. [2018-04-11 13:25:13,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:25:13,938 INFO L93 Difference]: Finished difference Result 2727 states and 3422 transitions. [2018-04-11 13:25:13,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 13:25:13,938 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 80 [2018-04-11 13:25:13,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:25:13,939 INFO L225 Difference]: With dead ends: 2727 [2018-04-11 13:25:13,940 INFO L226 Difference]: Without dead ends: 2727 [2018-04-11 13:25:13,940 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=829, Invalid=2251, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 13:25:13,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2018-04-11 13:25:13,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 1684. [2018-04-11 13:25:13,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1684 states. [2018-04-11 13:25:13,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2155 transitions. [2018-04-11 13:25:13,951 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2155 transitions. Word has length 80 [2018-04-11 13:25:13,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:25:13,951 INFO L459 AbstractCegarLoop]: Abstraction has 1684 states and 2155 transitions. [2018-04-11 13:25:13,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 13:25:13,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2155 transitions. [2018-04-11 13:25:13,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-11 13:25:13,951 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:25:13,951 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:25:13,952 INFO L408 AbstractCegarLoop]: === Iteration 114 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:25:13,952 INFO L82 PathProgramCache]: Analyzing trace with hash 56477508, now seen corresponding path program 1 times [2018-04-11 13:25:13,952 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:25:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:25:13,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:25:14,722 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:25:14,722 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:25:14,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 13:25:14,722 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:25:14,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:25:14,723 INFO L182 omatonBuilderFactory]: Interpolants [206151#true, 206155#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 206154#(= 0 main_~tree~0.offset), 206153#(= 0 |main_#t~malloc0.offset|), 206152#false, 206159#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 206158#(and (not (= main_~tree~0.base |main_#t~mem2.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~mem2.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 206157#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 206156#(and (= 4 (select |#length| |main_#t~malloc1.base|)) (not (= main_~tree~0.base |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|) (= 0 main_~tree~0.offset)), 206163#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.offset 0) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1)), 206162#(and (= main_~tree~0.offset 0) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))))), 206161#(and (= main_~tree~0.offset 0) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tmp~0.base |main_#t~malloc23.base|)) (= main_~tmp~0.base main_~tree~0.base) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))))), 206160#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 0 main_~tree~0.offset) (= main_~tmp~0.base main_~tree~0.base) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1) (= (select |#valid| main_~tmp~0.base) 1)), 206167#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 206166#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.offset 0) (not (= |main_#t~mem26.base| main_~tree~0.base)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 206165#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 206164#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 206171#(and (= main_~tree~0.offset 0) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (or (and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= main_~newNode~0.offset 0)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 206170#(and (= main_~tree~0.offset 0) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (or (and (= 0 |main_#t~malloc19.offset|) (= |main_#t~malloc19.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))))) (= main_~tree~0.base main_~tmp~0.base) (not (= main_~tmp~0.base |main_#t~malloc19.base|))), 206169#(and (= main_~tree~0.offset 0) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.base main_~tmp~0.base) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tmp~0.base) 1)), 206168#(and (= main_~tree~0.offset 0) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.base main_~tmp~0.base) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))))), 206175#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= |main_#t~mem26.base| main_~tree~0.base)) (or (and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= (+ main_~newNode~0.offset 12) (select |#length| main_~newNode~0.base)) (= main_~newNode~0.offset 0)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))), 206174#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.offset 0) (or (and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= (+ main_~newNode~0.offset 12) (select |#length| main_~newNode~0.base)) (= main_~newNode~0.offset 0)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 206173#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.offset 0) (or (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~newNode~0.offset 0))) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 206172#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.offset 0) (or (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~newNode~0.offset 0))) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1)), 206178#(and (= |main_#t~mem30.offset| 0) (or (= 4 (select |#length| |main_#t~mem30.base|)) (<= 12 (select |#length| |main_#t~mem30.base|)))), 206177#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (or (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))), 206176#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= |main_#t~mem26.base| main_~tree~0.base)) (or (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))))] [2018-04-11 13:25:14,723 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:25:14,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 13:25:14,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 13:25:14,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2018-04-11 13:25:14,723 INFO L87 Difference]: Start difference. First operand 1684 states and 2155 transitions. Second operand 28 states. [2018-04-11 13:25:17,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:25:17,507 INFO L93 Difference]: Finished difference Result 2729 states and 3424 transitions. [2018-04-11 13:25:17,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 13:25:17,508 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 80 [2018-04-11 13:25:17,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:25:17,509 INFO L225 Difference]: With dead ends: 2729 [2018-04-11 13:25:17,509 INFO L226 Difference]: Without dead ends: 2729 [2018-04-11 13:25:17,509 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=883, Invalid=2777, Unknown=0, NotChecked=0, Total=3660 [2018-04-11 13:25:17,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2018-04-11 13:25:17,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 1680. [2018-04-11 13:25:17,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1680 states. [2018-04-11 13:25:17,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2150 transitions. [2018-04-11 13:25:17,519 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2150 transitions. Word has length 80 [2018-04-11 13:25:17,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:25:17,519 INFO L459 AbstractCegarLoop]: Abstraction has 1680 states and 2150 transitions. [2018-04-11 13:25:17,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 13:25:17,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2150 transitions. [2018-04-11 13:25:17,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-11 13:25:17,520 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:25:17,520 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:25:17,520 INFO L408 AbstractCegarLoop]: === Iteration 115 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:25:17,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1934490999, now seen corresponding path program 1 times [2018-04-11 13:25:17,520 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:25:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:25:17,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:25:18,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:25:18,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:25:18,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 13:25:18,099 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:25:18,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:25:18,099 INFO L182 omatonBuilderFactory]: Interpolants [210655#false, 210654#true, 210659#(and (= main_~tree~0.offset 0) (= (select |#valid| main_~tree~0.base) 1) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 210658#(and (= main_~tree~0.offset 0) (= (select |#valid| main_~tree~0.base) 1)), 210657#(= main_~tree~0.offset 0), 210656#(= 0 |main_#t~malloc0.offset|), 210663#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (= (select |#valid| main_~tree~0.base) 1)), 210662#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~tree~0.base) 1)), 210661#(and (= main_~tree~0.offset 0) (= main_~newNode~0.offset 0) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 210660#(and (= main_~tree~0.offset 0) (= 0 |main_#t~malloc19.offset|) (not (= main_~tree~0.base |main_#t~malloc19.base|)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 210667#(and (= main_~tree~0.offset 0) (not (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= |main_#t~mem26.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8)) |main_#t~mem27.base|) (not (= main_~tree~0.base |main_#t~mem26.base|))), 210666#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base main_~newNode~0.base)) (not (= |main_#t~mem26.base| main_~tree~0.base)) (not (= main_~newNode~0.base |main_#t~mem26.base|)) (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= |main_#t~mem26.offset| (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8))) (= main_~newNode~0.offset 0)), 210665#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base main_~newNode~0.base)) (not (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= main_~newNode~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 210664#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (not (= main_~newNode~0.base |main_#t~malloc25.base|)) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 210671#(and (= (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 8))) (select (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) (+ 0 8)))) (not (= main_~pred~0.base |main_#t~mem37.base|)) (not (= main_~pred~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 8)))) (= 0 |main_#t~mem37.offset|)), 210670#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~pred~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))) (not (= main_~pred~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8))))), 210669#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8)))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))), 210668#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8))))), 210675#(and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 210674#(= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 210673#(and (not (= main_~pred~0.base main_~tmp~0.base)) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~pred~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 210672#(and (not (= main_~pred~0.base main_~tmp~0.base)) (or (<= (+ main_~tmp~0.offset 1) 0) (and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~pred~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))))), 210679#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem43.base|) |main_#t~mem43.offset|))), 210678#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 210677#(and (= 1 (select |#valid| |main_#t~mem41.base|)) (= |main_#t~mem42.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem42.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 210676#(and (= |main_#t~mem40.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| |main_#t~mem40.base|) |main_#t~mem40.offset|)) (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem40.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 210681#(= 1 (select |#valid| main_~tmpList~0.base)), 210680#(= 1 (select |#valid| |main_#t~mem44.base|))] [2018-04-11 13:25:18,099 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:25:18,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 13:25:18,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 13:25:18,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2018-04-11 13:25:18,100 INFO L87 Difference]: Start difference. First operand 1680 states and 2150 transitions. Second operand 28 states. [2018-04-11 13:25:22,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 13:25:22,703 INFO L93 Difference]: Finished difference Result 3627 states and 4555 transitions. [2018-04-11 13:25:22,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-11 13:25:22,704 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 80 [2018-04-11 13:25:22,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 13:25:22,713 INFO L225 Difference]: With dead ends: 3627 [2018-04-11 13:25:22,713 INFO L226 Difference]: Without dead ends: 3627 [2018-04-11 13:25:22,713 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2309 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1473, Invalid=7457, Unknown=0, NotChecked=0, Total=8930 [2018-04-11 13:25:22,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3627 states. [2018-04-11 13:25:22,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3627 to 1685. [2018-04-11 13:25:22,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1685 states. [2018-04-11 13:25:22,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 2156 transitions. [2018-04-11 13:25:22,726 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 2156 transitions. Word has length 80 [2018-04-11 13:25:22,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 13:25:22,726 INFO L459 AbstractCegarLoop]: Abstraction has 1685 states and 2156 transitions. [2018-04-11 13:25:22,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 13:25:22,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 2156 transitions. [2018-04-11 13:25:22,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-11 13:25:22,727 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 13:25:22,727 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 13:25:22,727 INFO L408 AbstractCegarLoop]: === Iteration 116 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 13:25:22,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1934490998, now seen corresponding path program 1 times [2018-04-11 13:25:22,727 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 13:25:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 13:25:22,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 13:25:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:25:23,253 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 13:25:23,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 13:25:23,254 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 13:25:23,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:25:23,254 INFO L182 omatonBuilderFactory]: Interpolants [216131#(= main_~tree~0.offset 0), 216130#(= 0 |main_#t~malloc0.offset|), 216129#false, 216128#true, 216135#(and (= main_~tree~0.offset 0) (= main_~newNode~0.offset 0) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 216134#(and (= main_~tree~0.offset 0) (= 0 |main_#t~malloc19.offset|) (not (= main_~tree~0.base |main_#t~malloc19.base|)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 216133#(and (= main_~tree~0.offset 0) (= (select |#valid| main_~tree~0.base) 1) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 216132#(and (= main_~tree~0.offset 0) (= (select |#valid| main_~tree~0.base) 1)), 216139#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (not (= main_~tree~0.base main_~newNode~0.base)) (not (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= main_~newNode~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 216138#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (not (= main_~newNode~0.base |main_#t~malloc25.base|)) (not (= main_~tree~0.base |main_#t~malloc25.base|))), 216137#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (= (select |#valid| main_~tree~0.base) 1)), 216136#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~tree~0.base) 1)), 216143#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8)))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8)))), 216142#(and (= main_~tree~0.offset 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8))))), 216141#(and (= main_~tree~0.offset 0) (not (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= |main_#t~mem26.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8)) |main_#t~mem27.base|) (not (= main_~tree~0.base |main_#t~mem26.base|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8)))), 216140#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base main_~newNode~0.base)) (not (= main_~newNode~0.base |main_#t~mem26.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))) (= |main_#t~mem26.offset| (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8))) (= main_~newNode~0.offset 0) (not (= main_~tree~0.base |main_#t~mem26.base|))), 216147#(and (not (= main_~pred~0.base main_~tmp~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~pred~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 216146#(or (and (not (= main_~pred~0.base main_~tmp~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~pred~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (<= (+ main_~tmp~0.offset 1) 0)), 216145#(and (= (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 8))) (select (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) (+ 0 8)))) (not (= main_~pred~0.base |main_#t~mem37.base|)) (not (= main_~pred~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 8)))) (= 0 |main_#t~mem37.offset|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 8))) (select (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) (+ 0 8))) (select (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) (+ 0 8)))), 216144#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~pred~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))) (not (= main_~pred~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8)))), 216151#(and (= |main_#t~mem42.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem41.offset| |main_#t~mem42.offset|)), 216150#(and (= |main_#t~mem41.offset| (select (select |#memory_$Pointer$.offset| |main_#t~mem40.base|) |main_#t~mem40.offset|)) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| |main_#t~mem40.base|) |main_#t~mem40.offset|)) (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 216149#(and (= |main_#t~mem41.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= |main_#t~mem41.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 216148#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))] [2018-04-11 13:25:23,254 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 13:25:23,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 13:25:23,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 13:25:23,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2018-04-11 13:25:23,255 INFO L87 Difference]: Start difference. First operand 1685 states and 2156 transitions. Second operand 24 states. Received shutdown request... [2018-04-11 13:25:24,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 13:25:24,637 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 13:25:24,642 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 13:25:24,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 01:25:24 BoogieIcfgContainer [2018-04-11 13:25:24,643 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 13:25:24,643 INFO L168 Benchmark]: Toolchain (without parser) took 177689.76 ms. Allocated memory was 404.2 MB in the beginning and 815.8 MB in the end (delta: 411.6 MB). Free memory was 336.3 MB in the beginning and 642.5 MB in the end (delta: -306.2 MB). Peak memory consumption was 105.3 MB. Max. memory is 5.3 GB. [2018-04-11 13:25:24,644 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 404.2 MB. Free memory is still 362.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 13:25:24,644 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.86 ms. Allocated memory is still 404.2 MB. Free memory was 335.6 MB in the beginning and 309.2 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. [2018-04-11 13:25:24,644 INFO L168 Benchmark]: Boogie Preprocessor took 44.97 ms. Allocated memory is still 404.2 MB. Free memory was 309.2 MB in the beginning and 306.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 13:25:24,645 INFO L168 Benchmark]: RCFGBuilder took 653.94 ms. Allocated memory was 404.2 MB in the beginning and 578.8 MB in the end (delta: 174.6 MB). Free memory was 306.5 MB in the beginning and 479.9 MB in the end (delta: -173.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 5.3 GB. [2018-04-11 13:25:24,645 INFO L168 Benchmark]: TraceAbstraction took 176714.34 ms. Allocated memory was 578.8 MB in the beginning and 815.8 MB in the end (delta: 237.0 MB). Free memory was 479.9 MB in the beginning and 642.5 MB in the end (delta: -162.5 MB). Peak memory consumption was 74.4 MB. Max. memory is 5.3 GB. [2018-04-11 13:25:24,646 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.18 ms. Allocated memory is still 404.2 MB. Free memory is still 362.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 273.86 ms. Allocated memory is still 404.2 MB. Free memory was 335.6 MB in the beginning and 309.2 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.97 ms. Allocated memory is still 404.2 MB. Free memory was 309.2 MB in the beginning and 306.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 653.94 ms. Allocated memory was 404.2 MB in the beginning and 578.8 MB in the end (delta: 174.6 MB). Free memory was 306.5 MB in the beginning and 479.9 MB in the end (delta: -173.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 176714.34 ms. Allocated memory was 578.8 MB in the beginning and 815.8 MB in the end (delta: 237.0 MB). Free memory was 479.9 MB in the beginning and 642.5 MB in the end (delta: -162.5 MB). Peak memory consumption was 74.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 698]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 694]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 718]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 709]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 709). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 656]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 682]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 703]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 723]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 723). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 718]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 689]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 668]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 718]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 689]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 722]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 722). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 682]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 674]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 722]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 722). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 720]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 720). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 689]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 722]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 722). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 722]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 722). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 674]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 635]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 689]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 720]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 720). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 723]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 723). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 692]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 703]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 682]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 718]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 668]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 682]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 656]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 692]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 705]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 698]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 709]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 709). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 635]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 694]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 705]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (1685states) and interpolant automaton (currently 21 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (363 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 226 locations, 101 error locations. TIMEOUT Result, 176.6s OverallTime, 116 OverallIterations, 3 TraceHistogramMax, 143.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 21829 SDtfs, 119395 SDslu, 148076 SDs, 0 SdLazy, 162156 SolverSat, 11423 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 63.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4188 GetRequests, 337 SyntacticMatches, 128 SemanticMatches, 3723 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46869 ImplicationChecksByTransitivity, 91.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1685occurred in iteration=115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 134/550 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 115 MinimizatonAttempts, 45710 StatesRemovedByMinimization, 106 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 30.9s InterpolantComputationTime, 6136 NumberOfCodeBlocks, 6136 NumberOfCodeBlocksAsserted, 116 NumberOfCheckSat, 6020 ConstructedInterpolants, 0 QuantifiedInterpolants, 7042299 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 116 InterpolantComputations, 51 PerfectInterpolantSequences, 134/550 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_13-25-24-652.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_13-25-24-652.csv Completed graceful shutdown