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 -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test01_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 15:54:32,465 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 15:54:32,466 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 15:54:32,479 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 15:54:32,479 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 15:54:32,480 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 15:54:32,481 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 15:54:32,482 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 15:54:32,484 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 15:54:32,484 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 15:54:32,485 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 15:54:32,485 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 15:54:32,486 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 15:54:32,487 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 15:54:32,487 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 15:54:32,489 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 15:54:32,490 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 15:54:32,491 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 15:54:32,492 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 15:54:32,493 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 15:54:32,495 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 15:54:32,495 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 15:54:32,495 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 15:54:32,496 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 15:54:32,496 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 15:54:32,497 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 15:54:32,497 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 15:54:32,498 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 15:54:32,498 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 15:54:32,499 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 15:54:32,499 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 15:54:32,499 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-10 15:54:32,515 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 15:54:32,515 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 15:54:32,516 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 15:54:32,516 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 15:54:32,516 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 15:54:32,516 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 15:54:32,517 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 15:54:32,517 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 15:54:32,517 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 15:54:32,517 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 15:54:32,517 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 15:54:32,517 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 15:54:32,517 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 15:54:32,517 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 15:54:32,517 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 15:54:32,517 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 15:54:32,518 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 15:54:32,518 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 15:54:32,518 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 15:54:32,518 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 15:54:32,518 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 15:54:32,518 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 15:54:32,518 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 15:54:32,518 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-04-10 15:54:32,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 15:54:32,555 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 15:54:32,558 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 15:54:32,560 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 15:54:32,560 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 15:54:32,561 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,837 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG3fdb354eb [2018-04-10 15:54:32,978 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 15:54:32,979 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 15:54:32,979 INFO L168 CDTParser]: Scanning complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,989 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 15:54:32,989 INFO L215 ultiparseSymbolTable]: [2018-04-10 15:54:32,989 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 15:54:32,989 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data ('create_data') in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,989 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeData ('freeData') in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,989 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__append ('append') in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,989 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____bswap_32 ('__bswap_32') in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,989 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,990 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____bswap_64 ('__bswap_64') in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,990 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 15:54:32,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____loff_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__suseconds_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__fd_mask in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__ushort in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pthread_cond_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__int64_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____ino_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____pid_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,990 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____syscall_slong_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__quad_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____sigset_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____ino64_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____key_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____fsid_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____uint8_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____off_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pthread_barrier_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____u_quad_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__u_long in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,991 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____useconds_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____u_int in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__id_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__uint in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__u_char in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____clockid_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__u_int16_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__blkcnt_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pthread_spinlock_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____int16_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__dev_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,992 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____blkcnt_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____u_long in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pthread_once_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__u_quad_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pthread_barrierattr_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____int64_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__ulong in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__register_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____caddr_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__fd_set in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__ldiv_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,993 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__loff_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pthread_condattr_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____rlim64_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__u_int64_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__clock_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__daddr_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____uint16_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____dev_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____daddr_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____clock_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,994 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____int8_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____qaddr_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____blksize_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__fsid_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__key_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____fsfilcnt_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pthread_mutex_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____u_short in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__u_int in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____time_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pthread_mutexattr_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__caddr_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,995 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__int8_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____suseconds_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__mode_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____rlim_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__fsfilcnt_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__ino_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pid_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____uint32_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____fsfilcnt64_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__gid_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pthread_rwlock_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__off_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____socklen_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__lldiv_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__u_short in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__int16_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____fsblkcnt_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__uid_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__Data in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pthread_key_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____intptr_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____mode_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__time_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__blksize_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,997 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__size_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__div_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__ssize_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____uint64_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____fsblkcnt64_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__sigset_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__u_int32_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____sig_atomic_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__timer_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____u_char in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____off64_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__nlink_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pthread_attr_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____uid_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__wchar_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pthread_rwlockattr_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____blkcnt64_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____fsword_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__u_int8_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__int32_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____quad_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____nlink_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____ssize_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____int32_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__clockid_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____syscall_ulong_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____pthread_slist_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____gid_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:32,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____fd_mask in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:33,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____id_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:33,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__fsblkcnt_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:33,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____timer_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:33,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__pthread_t in complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:33,017 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG3fdb354eb [2018-04-10 15:54:33,020 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 15:54:33,021 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 15:54:33,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 15:54:33,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 15:54:33,027 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 15:54:33,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 03:54:33" (1/1) ... [2018-04-10 15:54:33,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24eab92f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:54:33, skipping insertion in model container [2018-04-10 15:54:33,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 03:54:33" (1/1) ... [2018-04-10 15:54:33,041 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 15:54:33,063 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 15:54:33,213 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 15:54:33,256 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 15:54:33,265 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 120 non ball SCCs. Number of states in SCCs 120. [2018-04-10 15:54:33,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:54:33 WrapperNode [2018-04-10 15:54:33,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 15:54:33,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 15:54:33,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 15:54:33,312 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 15:54:33,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:54:33" (1/1) ... [2018-04-10 15:54:33,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:54:33" (1/1) ... [2018-04-10 15:54:33,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:54:33" (1/1) ... [2018-04-10 15:54:33,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:54:33" (1/1) ... [2018-04-10 15:54:33,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:54:33" (1/1) ... [2018-04-10 15:54:33,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:54:33" (1/1) ... [2018-04-10 15:54:33,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:54:33" (1/1) ... [2018-04-10 15:54:33,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 15:54:33,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 15:54:33,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 15:54:33,358 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 15:54:33,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:54:33" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 15:54:33,448 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 15:54:33,449 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 15:54:33,449 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____bswap_32 [2018-04-10 15:54:33,449 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____bswap_64 [2018-04-10 15:54:33,449 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data [2018-04-10 15:54:33,449 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeData [2018-04-10 15:54:33,449 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__append [2018-04-10 15:54:33,449 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 15:54:33,449 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 15:54:33,449 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-10 15:54:33,449 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-10 15:54:33,449 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-10 15:54:33,450 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-10 15:54:33,450 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-10 15:54:33,450 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-10 15:54:33,450 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-10 15:54:33,450 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-10 15:54:33,450 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-10 15:54:33,450 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-10 15:54:33,450 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-10 15:54:33,451 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-10 15:54:33,451 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-10 15:54:33,451 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-10 15:54:33,451 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-10 15:54:33,451 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-10 15:54:33,451 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____bswap_32 [2018-04-10 15:54:33,451 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i____bswap_64 [2018-04-10 15:54:33,451 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-10 15:54:33,452 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-10 15:54:33,452 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-10 15:54:33,452 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-10 15:54:33,452 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-10 15:54:33,452 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-10 15:54:33,452 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-10 15:54:33,452 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-10 15:54:33,452 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-10 15:54:33,453 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-10 15:54:33,453 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-10 15:54:33,453 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-10 15:54:33,453 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-10 15:54:33,453 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-10 15:54:33,453 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-10 15:54:33,453 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-10 15:54:33,453 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-10 15:54:33,453 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-10 15:54:33,453 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-10 15:54:33,454 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-10 15:54:33,454 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-10 15:54:33,454 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-10 15:54:33,454 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-10 15:54:33,454 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-10 15:54:33,454 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-10 15:54:33,454 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-10 15:54:33,454 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-10 15:54:33,455 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-10 15:54:33,455 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-10 15:54:33,455 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-10 15:54:33,455 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-10 15:54:33,455 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-10 15:54:33,455 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-10 15:54:33,455 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-10 15:54:33,455 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-10 15:54:33,455 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-10 15:54:33,455 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-10 15:54:33,456 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-10 15:54:33,456 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-10 15:54:33,456 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-10 15:54:33,456 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-10 15:54:33,456 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-10 15:54:33,456 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-10 15:54:33,456 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-10 15:54:33,456 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-10 15:54:33,456 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-10 15:54:33,456 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-10 15:54:33,457 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-10 15:54:33,457 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-10 15:54:33,457 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-10 15:54:33,457 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-10 15:54:33,457 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-10 15:54:33,457 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-10 15:54:33,457 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-10 15:54:33,457 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-10 15:54:33,457 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-10 15:54:33,457 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-10 15:54:33,458 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-10 15:54:33,458 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-10 15:54:33,458 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-10 15:54:33,458 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-10 15:54:33,458 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-10 15:54:33,458 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-10 15:54:33,458 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-10 15:54:33,458 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-10 15:54:33,458 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-10 15:54:33,459 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-10 15:54:33,459 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-10 15:54:33,459 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-10 15:54:33,459 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-10 15:54:33,459 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-10 15:54:33,459 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-10 15:54:33,459 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-10 15:54:33,459 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-10 15:54:33,459 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-10 15:54:33,459 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-10 15:54:33,459 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-10 15:54:33,460 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-10 15:54:33,460 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-10 15:54:33,460 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-10 15:54:33,460 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-10 15:54:33,460 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-10 15:54:33,460 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-10 15:54:33,460 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-10 15:54:33,460 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-10 15:54:33,460 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-10 15:54:33,460 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-10 15:54:33,461 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 15:54:33,461 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data [2018-04-10 15:54:33,461 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 15:54:33,461 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 15:54:33,461 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-10 15:54:33,461 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-10 15:54:33,461 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 15:54:33,461 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeData [2018-04-10 15:54:33,461 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 15:54:33,461 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__append [2018-04-10 15:54:33,462 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 15:54:33,462 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 15:54:33,462 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 15:54:33,462 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 15:54:33,928 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 15:54:33,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 03:54:33 BoogieIcfgContainer [2018-04-10 15:54:33,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 15:54:33,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 15:54:33,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 15:54:33,932 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 15:54:33,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 03:54:33" (1/3) ... [2018-04-10 15:54:33,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ccbb526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 03:54:33, skipping insertion in model container [2018-04-10 15:54:33,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:54:33" (2/3) ... [2018-04-10 15:54:33,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ccbb526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 03:54:33, skipping insertion in model container [2018-04-10 15:54:33,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 03:54:33" (3/3) ... [2018-04-10 15:54:33,935 INFO L107 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01_false-valid-memtrack.i [2018-04-10 15:54:33,944 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 15:54:33,951 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 91 error locations. [2018-04-10 15:54:33,985 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 15:54:33,985 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 15:54:33,985 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 15:54:33,985 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 15:54:33,985 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 15:54:33,986 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 15:54:33,986 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 15:54:33,986 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 15:54:33,986 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 15:54:33,986 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 15:54:34,001 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states. [2018-04-10 15:54:34,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-04-10 15:54:34,008 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:34,008 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:54:34,008 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:34,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1735745738, now seen corresponding path program 1 times [2018-04-10 15:54:34,014 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:34,014 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:34,046 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:34,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:34,046 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:34,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:34,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:34,140 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:34,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 15:54:34,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 15:54:34,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 15:54:34,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 15:54:34,152 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 3 states. [2018-04-10 15:54:34,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:34,301 INFO L93 Difference]: Finished difference Result 220 states and 233 transitions. [2018-04-10 15:54:34,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 15:54:34,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-04-10 15:54:34,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:34,314 INFO L225 Difference]: With dead ends: 220 [2018-04-10 15:54:34,314 INFO L226 Difference]: Without dead ends: 217 [2018-04-10 15:54:34,316 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 15:54:34,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-10 15:54:34,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2018-04-10 15:54:34,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-04-10 15:54:34,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 227 transitions. [2018-04-10 15:54:34,359 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 227 transitions. Word has length 7 [2018-04-10 15:54:34,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:34,359 INFO L459 AbstractCegarLoop]: Abstraction has 215 states and 227 transitions. [2018-04-10 15:54:34,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 15:54:34,359 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 227 transitions. [2018-04-10 15:54:34,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-04-10 15:54:34,360 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:34,360 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:54:34,360 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:34,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1735745739, now seen corresponding path program 1 times [2018-04-10 15:54:34,360 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:34,360 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:34,361 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:34,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:34,361 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:34,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:34,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:34,385 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:34,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 15:54:34,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 15:54:34,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 15:54:34,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 15:54:34,388 INFO L87 Difference]: Start difference. First operand 215 states and 227 transitions. Second operand 3 states. [2018-04-10 15:54:34,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:34,494 INFO L93 Difference]: Finished difference Result 210 states and 222 transitions. [2018-04-10 15:54:34,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 15:54:34,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-04-10 15:54:34,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:34,496 INFO L225 Difference]: With dead ends: 210 [2018-04-10 15:54:34,496 INFO L226 Difference]: Without dead ends: 210 [2018-04-10 15:54:34,496 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 15:54:34,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-04-10 15:54:34,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-04-10 15:54:34,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-10 15:54:34,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 222 transitions. [2018-04-10 15:54:34,504 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 222 transitions. Word has length 7 [2018-04-10 15:54:34,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:34,505 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 222 transitions. [2018-04-10 15:54:34,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 15:54:34,505 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 222 transitions. [2018-04-10 15:54:34,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-10 15:54:34,505 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:34,506 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:54:34,506 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:34,506 INFO L82 PathProgramCache]: Analyzing trace with hash -66375595, now seen corresponding path program 1 times [2018-04-10 15:54:34,506 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:34,506 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:34,507 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:34,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:34,507 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:34,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:34,526 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:54:34,526 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:34,526 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:34,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:34,558 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:34,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:54:34,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:34,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:34,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 15:54:34,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:34,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:34,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-10 15:54:34,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:34,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:54:34,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-10 15:54:34,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:34,649 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:34,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 15:54:34,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 15:54:34,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 15:54:34,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:54:34,650 INFO L87 Difference]: Start difference. First operand 210 states and 222 transitions. Second operand 6 states. [2018-04-10 15:54:34,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:34,844 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2018-04-10 15:54:34,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 15:54:34,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-04-10 15:54:34,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:34,845 INFO L225 Difference]: With dead ends: 208 [2018-04-10 15:54:34,845 INFO L226 Difference]: Without dead ends: 208 [2018-04-10 15:54:34,845 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-04-10 15:54:34,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-04-10 15:54:34,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-04-10 15:54:34,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-10 15:54:34,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 220 transitions. [2018-04-10 15:54:34,851 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 220 transitions. Word has length 14 [2018-04-10 15:54:34,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:34,851 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 220 transitions. [2018-04-10 15:54:34,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 15:54:34,851 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 220 transitions. [2018-04-10 15:54:34,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-10 15:54:34,851 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:34,851 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:54:34,851 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:34,852 INFO L82 PathProgramCache]: Analyzing trace with hash -66375594, now seen corresponding path program 1 times [2018-04-10 15:54:34,852 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:34,852 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:34,852 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:34,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:34,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:34,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:34,867 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:54:34,867 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:34,867 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:34,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:34,891 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:34,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:54:34,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:34,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:54:34,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:34,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:34,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 15:54:34,926 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:34,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:34,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 15:54:34,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:34,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:34,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-10 15:54:34,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:34,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:54:34,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-04-10 15:54:34,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:34,951 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:34,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 15:54:34,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 15:54:34,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 15:54:34,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:54:34,952 INFO L87 Difference]: Start difference. First operand 208 states and 220 transitions. Second operand 6 states. [2018-04-10 15:54:35,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:35,271 INFO L93 Difference]: Finished difference Result 228 states and 244 transitions. [2018-04-10 15:54:35,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:54:35,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-04-10 15:54:35,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:35,272 INFO L225 Difference]: With dead ends: 228 [2018-04-10 15:54:35,273 INFO L226 Difference]: Without dead ends: 228 [2018-04-10 15:54:35,273 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-10 15:54:35,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-04-10 15:54:35,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 217. [2018-04-10 15:54:35,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-04-10 15:54:35,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 232 transitions. [2018-04-10 15:54:35,282 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 232 transitions. Word has length 14 [2018-04-10 15:54:35,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:35,283 INFO L459 AbstractCegarLoop]: Abstraction has 217 states and 232 transitions. [2018-04-10 15:54:35,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 15:54:35,283 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 232 transitions. [2018-04-10 15:54:35,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-10 15:54:35,283 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:35,283 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:54:35,284 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:35,284 INFO L82 PathProgramCache]: Analyzing trace with hash -2057643215, now seen corresponding path program 1 times [2018-04-10 15:54:35,284 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:35,284 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:35,285 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:35,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:35,285 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:35,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:35,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:35,318 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:35,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 15:54:35,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:54:35,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:54:35,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:54:35,319 INFO L87 Difference]: Start difference. First operand 217 states and 232 transitions. Second operand 4 states. [2018-04-10 15:54:35,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:35,420 INFO L93 Difference]: Finished difference Result 215 states and 229 transitions. [2018-04-10 15:54:35,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 15:54:35,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-10 15:54:35,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:35,421 INFO L225 Difference]: With dead ends: 215 [2018-04-10 15:54:35,422 INFO L226 Difference]: Without dead ends: 215 [2018-04-10 15:54:35,422 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-10 15:54:35,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-04-10 15:54:35,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-04-10 15:54:35,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-04-10 15:54:35,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 229 transitions. [2018-04-10 15:54:35,429 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 229 transitions. Word has length 15 [2018-04-10 15:54:35,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:35,429 INFO L459 AbstractCegarLoop]: Abstraction has 215 states and 229 transitions. [2018-04-10 15:54:35,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:54:35,429 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 229 transitions. [2018-04-10 15:54:35,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-10 15:54:35,430 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:35,430 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:54:35,430 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:35,430 INFO L82 PathProgramCache]: Analyzing trace with hash -2057643214, now seen corresponding path program 1 times [2018-04-10 15:54:35,430 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:35,431 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:35,431 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:35,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:35,431 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:35,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:35,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:35,465 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:35,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 15:54:35,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:54:35,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:54:35,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:54:35,466 INFO L87 Difference]: Start difference. First operand 215 states and 229 transitions. Second operand 4 states. [2018-04-10 15:54:35,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:35,587 INFO L93 Difference]: Finished difference Result 213 states and 226 transitions. [2018-04-10 15:54:35,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 15:54:35,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-10 15:54:35,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:35,588 INFO L225 Difference]: With dead ends: 213 [2018-04-10 15:54:35,588 INFO L226 Difference]: Without dead ends: 213 [2018-04-10 15:54:35,589 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-10 15:54:35,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-04-10 15:54:35,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-04-10 15:54:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-10 15:54:35,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 226 transitions. [2018-04-10 15:54:35,595 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 226 transitions. Word has length 15 [2018-04-10 15:54:35,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:35,595 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 226 transitions. [2018-04-10 15:54:35,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:54:35,595 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 226 transitions. [2018-04-10 15:54:35,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-10 15:54:35,596 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:35,596 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:54:35,596 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:35,596 INFO L82 PathProgramCache]: Analyzing trace with hash -652936953, now seen corresponding path program 1 times [2018-04-10 15:54:35,596 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:35,596 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:35,597 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:35,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:35,598 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:35,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:35,617 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:54:35,617 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:35,617 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:35,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:35,658 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:35,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:54:35,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:35,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:35,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 15:54:35,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:54:35,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:54:35,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:35,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:35,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:54:35,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:54:35,684 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:35,685 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:35,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:35,689 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-04-10 15:54:35,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:35,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:35,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 15:54:35,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:35,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:35,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2018-04-10 15:54:35,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-10 15:54:35,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 15:54:35,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:35,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:35,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-10 15:54:35,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 15:54:35,785 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:35,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:35,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:35,795 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:51, output treesize:21 [2018-04-10 15:54:35,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 15:54:35,815 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:54:35,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 15:54:35,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:35,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:35,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 15:54:35,825 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:54:35,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 15:54:35,825 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:35,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:35,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:35,831 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-04-10 15:54:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:35,839 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:35,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-10 15:54:35,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 15:54:35,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 15:54:35,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-04-10 15:54:35,840 INFO L87 Difference]: Start difference. First operand 213 states and 226 transitions. Second operand 11 states. [2018-04-10 15:54:36,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:36,212 INFO L93 Difference]: Finished difference Result 215 states and 229 transitions. [2018-04-10 15:54:36,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 15:54:36,213 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-04-10 15:54:36,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:36,214 INFO L225 Difference]: With dead ends: 215 [2018-04-10 15:54:36,214 INFO L226 Difference]: Without dead ends: 215 [2018-04-10 15:54:36,215 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-04-10 15:54:36,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-04-10 15:54:36,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2018-04-10 15:54:36,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-04-10 15:54:36,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 227 transitions. [2018-04-10 15:54:36,220 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 227 transitions. Word has length 20 [2018-04-10 15:54:36,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:36,221 INFO L459 AbstractCegarLoop]: Abstraction has 214 states and 227 transitions. [2018-04-10 15:54:36,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 15:54:36,221 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 227 transitions. [2018-04-10 15:54:36,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 15:54:36,221 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:36,221 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:54:36,221 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:36,222 INFO L82 PathProgramCache]: Analyzing trace with hash -413176432, now seen corresponding path program 1 times [2018-04-10 15:54:36,222 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:36,222 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:36,222 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:36,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:36,225 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:36,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:36,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:36,280 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:36,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:54:36,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:54:36,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:54:36,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:54:36,281 INFO L87 Difference]: Start difference. First operand 214 states and 227 transitions. Second operand 4 states. [2018-04-10 15:54:36,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:36,303 INFO L93 Difference]: Finished difference Result 300 states and 317 transitions. [2018-04-10 15:54:36,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 15:54:36,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-04-10 15:54:36,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:36,304 INFO L225 Difference]: With dead ends: 300 [2018-04-10 15:54:36,304 INFO L226 Difference]: Without dead ends: 300 [2018-04-10 15:54:36,305 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-10 15:54:36,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-04-10 15:54:36,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 264. [2018-04-10 15:54:36,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-04-10 15:54:36,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 317 transitions. [2018-04-10 15:54:36,312 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 317 transitions. Word has length 22 [2018-04-10 15:54:36,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:36,313 INFO L459 AbstractCegarLoop]: Abstraction has 264 states and 317 transitions. [2018-04-10 15:54:36,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:54:36,313 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 317 transitions. [2018-04-10 15:54:36,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-10 15:54:36,313 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:36,313 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-10 15:54:36,313 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:36,314 INFO L82 PathProgramCache]: Analyzing trace with hash 852188058, now seen corresponding path program 1 times [2018-04-10 15:54:36,314 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:36,314 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:36,315 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:36,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:36,315 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:36,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:36,332 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:54:36,332 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:36,332 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:36,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:36,373 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:36,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:54:36,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:36,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:36,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 15:54:36,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 15:54:36,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:36,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:54:36,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-10 15:54:36,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:36,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:36,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 15:54:36,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:54:36,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:54:36,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:54:36,397 INFO L87 Difference]: Start difference. First operand 264 states and 317 transitions. Second operand 4 states. [2018-04-10 15:54:36,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:36,517 INFO L93 Difference]: Finished difference Result 251 states and 289 transitions. [2018-04-10 15:54:36,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 15:54:36,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-04-10 15:54:36,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:36,519 INFO L225 Difference]: With dead ends: 251 [2018-04-10 15:54:36,519 INFO L226 Difference]: Without dead ends: 251 [2018-04-10 15:54:36,519 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:54:36,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-04-10 15:54:36,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2018-04-10 15:54:36,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-04-10 15:54:36,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 287 transitions. [2018-04-10 15:54:36,523 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 287 transitions. Word has length 26 [2018-04-10 15:54:36,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:36,524 INFO L459 AbstractCegarLoop]: Abstraction has 249 states and 287 transitions. [2018-04-10 15:54:36,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:54:36,524 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 287 transitions. [2018-04-10 15:54:36,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-10 15:54:36,524 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:36,524 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-10 15:54:36,525 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:36,525 INFO L82 PathProgramCache]: Analyzing trace with hash 852188059, now seen corresponding path program 1 times [2018-04-10 15:54:36,525 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:36,525 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:36,526 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:36,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:36,526 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:36,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:36,538 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:54:36,539 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:36,539 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:36,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:36,563 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:36,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:54:36,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:36,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:54:36,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:36,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:36,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 15:54:36,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:36,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:36,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-10 15:54:36,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:36,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:36,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:36,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 15:54:36,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:36,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:54:36,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-04-10 15:54:36,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:36,625 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:36,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:54:36,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:54:36,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:54:36,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:54:36,626 INFO L87 Difference]: Start difference. First operand 249 states and 287 transitions. Second operand 5 states. [2018-04-10 15:54:36,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:36,834 INFO L93 Difference]: Finished difference Result 242 states and 265 transitions. [2018-04-10 15:54:36,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 15:54:36,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-04-10 15:54:36,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:36,835 INFO L225 Difference]: With dead ends: 242 [2018-04-10 15:54:36,835 INFO L226 Difference]: Without dead ends: 242 [2018-04-10 15:54:36,835 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:54:36,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-10 15:54:36,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 234. [2018-04-10 15:54:36,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-10 15:54:36,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 257 transitions. [2018-04-10 15:54:36,841 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 257 transitions. Word has length 26 [2018-04-10 15:54:36,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:36,841 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 257 transitions. [2018-04-10 15:54:36,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:54:36,841 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 257 transitions. [2018-04-10 15:54:36,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-10 15:54:36,841 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:36,841 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-10 15:54:36,841 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:36,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1334203072, now seen corresponding path program 1 times [2018-04-10 15:54:36,842 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:36,842 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:36,842 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:36,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:36,842 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:36,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:36,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:36,876 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:36,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:54:36,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:54:36,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:54:36,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:54:36,876 INFO L87 Difference]: Start difference. First operand 234 states and 257 transitions. Second operand 5 states. [2018-04-10 15:54:37,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:37,031 INFO L93 Difference]: Finished difference Result 241 states and 263 transitions. [2018-04-10 15:54:37,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 15:54:37,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-04-10 15:54:37,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:37,032 INFO L225 Difference]: With dead ends: 241 [2018-04-10 15:54:37,032 INFO L226 Difference]: Without dead ends: 241 [2018-04-10 15:54:37,032 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:54:37,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-04-10 15:54:37,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 233. [2018-04-10 15:54:37,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-10 15:54:37,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 255 transitions. [2018-04-10 15:54:37,037 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 255 transitions. Word has length 32 [2018-04-10 15:54:37,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:37,038 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 255 transitions. [2018-04-10 15:54:37,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:54:37,038 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 255 transitions. [2018-04-10 15:54:37,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-10 15:54:37,038 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:37,039 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-10 15:54:37,039 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:37,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1334203073, now seen corresponding path program 1 times [2018-04-10 15:54:37,039 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:37,039 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:37,040 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:37,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:37,040 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:37,050 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:37,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-10 15:54:37,121 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:37,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 15:54:37,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 15:54:37,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 15:54:37,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:54:37,122 INFO L87 Difference]: Start difference. First operand 233 states and 255 transitions. Second operand 6 states. [2018-04-10 15:54:37,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:37,258 INFO L93 Difference]: Finished difference Result 253 states and 275 transitions. [2018-04-10 15:54:37,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:54:37,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-04-10 15:54:37,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:37,259 INFO L225 Difference]: With dead ends: 253 [2018-04-10 15:54:37,259 INFO L226 Difference]: Without dead ends: 253 [2018-04-10 15:54:37,259 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-04-10 15:54:37,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-10 15:54:37,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 243. [2018-04-10 15:54:37,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-10 15:54:37,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 265 transitions. [2018-04-10 15:54:37,263 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 265 transitions. Word has length 32 [2018-04-10 15:54:37,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:37,263 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 265 transitions. [2018-04-10 15:54:37,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 15:54:37,263 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 265 transitions. [2018-04-10 15:54:37,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-10 15:54:37,264 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:37,264 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] [2018-04-10 15:54:37,264 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:37,264 INFO L82 PathProgramCache]: Analyzing trace with hash -375553344, now seen corresponding path program 1 times [2018-04-10 15:54:37,264 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:37,265 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:37,265 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:37,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:37,265 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:37,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:37,427 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-10 15:54:37,427 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:37,427 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:37,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:37,482 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:37,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:54:37,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:37,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:37,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 15:54:37,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 15:54:37,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 15:54:37,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:37,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:37,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 15:54:37,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 15:54:37,522 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:37,523 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:37,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:37,527 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:21 [2018-04-10 15:54:37,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-10 15:54:37,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-04-10 15:54:37,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:37,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:37,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-04-10 15:54:37,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-10 15:54:37,649 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:37,653 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:37,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:37,657 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:19 [2018-04-10 15:54:37,670 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:37,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:54:37,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-04-10 15:54:37,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 15:54:37,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 15:54:37,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-04-10 15:54:37,671 INFO L87 Difference]: Start difference. First operand 243 states and 265 transitions. Second operand 16 states. [2018-04-10 15:54:38,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:38,055 INFO L93 Difference]: Finished difference Result 270 states and 291 transitions. [2018-04-10 15:54:38,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 15:54:38,056 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-04-10 15:54:38,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:38,057 INFO L225 Difference]: With dead ends: 270 [2018-04-10 15:54:38,057 INFO L226 Difference]: Without dead ends: 270 [2018-04-10 15:54:38,058 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2018-04-10 15:54:38,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-04-10 15:54:38,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 264. [2018-04-10 15:54:38,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-04-10 15:54:38,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 285 transitions. [2018-04-10 15:54:38,065 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 285 transitions. Word has length 39 [2018-04-10 15:54:38,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:38,066 INFO L459 AbstractCegarLoop]: Abstraction has 264 states and 285 transitions. [2018-04-10 15:54:38,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 15:54:38,066 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 285 transitions. [2018-04-10 15:54:38,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-10 15:54:38,067 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:38,067 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:38,067 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:38,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1136635123, now seen corresponding path program 1 times [2018-04-10 15:54:38,067 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:38,067 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:38,068 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:38,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:38,068 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:38,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:38,112 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:54:38,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:38,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 15:54:38,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:54:38,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:54:38,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:54:38,113 INFO L87 Difference]: Start difference. First operand 264 states and 285 transitions. Second operand 4 states. [2018-04-10 15:54:38,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:38,225 INFO L93 Difference]: Finished difference Result 268 states and 287 transitions. [2018-04-10 15:54:38,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 15:54:38,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-04-10 15:54:38,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:38,227 INFO L225 Difference]: With dead ends: 268 [2018-04-10 15:54:38,227 INFO L226 Difference]: Without dead ends: 268 [2018-04-10 15:54:38,227 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-10 15:54:38,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-04-10 15:54:38,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 262. [2018-04-10 15:54:38,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-04-10 15:54:38,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 281 transitions. [2018-04-10 15:54:38,232 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 281 transitions. Word has length 63 [2018-04-10 15:54:38,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:38,232 INFO L459 AbstractCegarLoop]: Abstraction has 262 states and 281 transitions. [2018-04-10 15:54:38,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:54:38,233 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 281 transitions. [2018-04-10 15:54:38,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-10 15:54:38,233 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:38,234 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:38,234 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:38,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1136635124, now seen corresponding path program 1 times [2018-04-10 15:54:38,234 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:38,234 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:38,238 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:38,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:38,238 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:38,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:38,308 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:54:38,308 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:38,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 15:54:38,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:54:38,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:54:38,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:54:38,309 INFO L87 Difference]: Start difference. First operand 262 states and 281 transitions. Second operand 4 states. [2018-04-10 15:54:38,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:38,424 INFO L93 Difference]: Finished difference Result 266 states and 283 transitions. [2018-04-10 15:54:38,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 15:54:38,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-04-10 15:54:38,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:38,426 INFO L225 Difference]: With dead ends: 266 [2018-04-10 15:54:38,426 INFO L226 Difference]: Without dead ends: 266 [2018-04-10 15:54:38,426 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-10 15:54:38,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-04-10 15:54:38,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 260. [2018-04-10 15:54:38,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-04-10 15:54:38,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 277 transitions. [2018-04-10 15:54:38,434 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 277 transitions. Word has length 63 [2018-04-10 15:54:38,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:38,434 INFO L459 AbstractCegarLoop]: Abstraction has 260 states and 277 transitions. [2018-04-10 15:54:38,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:54:38,434 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 277 transitions. [2018-04-10 15:54:38,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-10 15:54:38,435 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:38,435 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:38,436 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:38,436 INFO L82 PathProgramCache]: Analyzing trace with hash 802588596, now seen corresponding path program 1 times [2018-04-10 15:54:38,436 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:38,436 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:38,436 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:38,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:38,437 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:38,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:38,507 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:38,507 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:38,507 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:38,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:38,528 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:38,541 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:38,541 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:54:38,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-04-10 15:54:38,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 15:54:38,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 15:54:38,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:54:38,542 INFO L87 Difference]: Start difference. First operand 260 states and 277 transitions. Second operand 7 states. [2018-04-10 15:54:38,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:38,559 INFO L93 Difference]: Finished difference Result 284 states and 301 transitions. [2018-04-10 15:54:38,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:54:38,560 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-04-10 15:54:38,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:38,561 INFO L225 Difference]: With dead ends: 284 [2018-04-10 15:54:38,561 INFO L226 Difference]: Without dead ends: 284 [2018-04-10 15:54:38,561 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:54:38,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-04-10 15:54:38,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 274. [2018-04-10 15:54:38,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-04-10 15:54:38,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 291 transitions. [2018-04-10 15:54:38,566 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 291 transitions. Word has length 66 [2018-04-10 15:54:38,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:38,566 INFO L459 AbstractCegarLoop]: Abstraction has 274 states and 291 transitions. [2018-04-10 15:54:38,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 15:54:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 291 transitions. [2018-04-10 15:54:38,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-10 15:54:38,567 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:38,567 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:38,567 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:38,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1052182541, now seen corresponding path program 2 times [2018-04-10 15:54:38,568 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:38,568 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:38,568 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:38,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:38,568 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:38,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:38,623 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:38,623 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:38,623 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:38,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:54:38,644 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-04-10 15:54:38,644 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:54:38,648 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:38,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:54:38,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:38,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:38,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 15:54:38,675 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1)) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0))) is different from true [2018-04-10 15:54:38,680 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1)) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0))) is different from true [2018-04-10 15:54:38,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:38,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:38,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2018-04-10 15:54:38,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-04-10 15:54:38,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:38,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:38,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:54:38,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2018-04-10 15:54:38,771 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-04-10 15:54:38,771 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:54:38,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-04-10 15:54:38,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-10 15:54:38,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-10 15:54:38,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=82, Unknown=2, NotChecked=38, Total=156 [2018-04-10 15:54:38,772 INFO L87 Difference]: Start difference. First operand 274 states and 291 transitions. Second operand 13 states. [2018-04-10 15:54:39,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:39,107 INFO L93 Difference]: Finished difference Result 342 states and 368 transitions. [2018-04-10 15:54:39,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 15:54:39,107 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2018-04-10 15:54:39,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:39,109 INFO L225 Difference]: With dead ends: 342 [2018-04-10 15:54:39,109 INFO L226 Difference]: Without dead ends: 342 [2018-04-10 15:54:39,109 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=190, Unknown=17, NotChecked=62, Total=342 [2018-04-10 15:54:39,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-04-10 15:54:39,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 309. [2018-04-10 15:54:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-04-10 15:54:39,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 334 transitions. [2018-04-10 15:54:39,118 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 334 transitions. Word has length 73 [2018-04-10 15:54:39,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:39,118 INFO L459 AbstractCegarLoop]: Abstraction has 309 states and 334 transitions. [2018-04-10 15:54:39,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-10 15:54:39,118 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 334 transitions. [2018-04-10 15:54:39,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-10 15:54:39,121 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:39,121 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:39,121 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:39,121 INFO L82 PathProgramCache]: Analyzing trace with hash 530748117, now seen corresponding path program 1 times [2018-04-10 15:54:39,121 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:39,121 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:39,122 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:39,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:54:39,122 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:39,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:39,192 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:39,192 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:39,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:39,215 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:39,239 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:39,239 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:54:39,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-04-10 15:54:39,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 15:54:39,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 15:54:39,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-04-10 15:54:39,240 INFO L87 Difference]: Start difference. First operand 309 states and 334 transitions. Second operand 9 states. [2018-04-10 15:54:39,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:39,266 INFO L93 Difference]: Finished difference Result 333 states and 358 transitions. [2018-04-10 15:54:39,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 15:54:39,267 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-04-10 15:54:39,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:39,268 INFO L225 Difference]: With dead ends: 333 [2018-04-10 15:54:39,268 INFO L226 Difference]: Without dead ends: 333 [2018-04-10 15:54:39,268 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-04-10 15:54:39,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-04-10 15:54:39,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 323. [2018-04-10 15:54:39,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-04-10 15:54:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 348 transitions. [2018-04-10 15:54:39,274 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 348 transitions. Word has length 80 [2018-04-10 15:54:39,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:39,274 INFO L459 AbstractCegarLoop]: Abstraction has 323 states and 348 transitions. [2018-04-10 15:54:39,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 15:54:39,274 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 348 transitions. [2018-04-10 15:54:39,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-10 15:54:39,275 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:39,275 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:39,275 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:39,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1561340116, now seen corresponding path program 2 times [2018-04-10 15:54:39,276 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:39,276 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:39,276 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:39,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:39,277 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:39,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:39,358 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:39,358 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:39,359 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:54:39,375 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-04-10 15:54:39,375 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:54:39,379 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:39,464 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|) 0) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80)))) is different from true [2018-04-10 15:54:39,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:39,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23 [2018-04-10 15:54:39,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:39,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:39,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 36 [2018-04-10 15:54:39,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:39,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:39,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:39,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:39,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:39,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:39,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:39,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 30 [2018-04-10 15:54:39,562 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:39,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:54:39,570 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29 [2018-04-10 15:54:39,602 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-04-10 15:54:39,602 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:54:39,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 16 [2018-04-10 15:54:39,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 15:54:39,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 15:54:39,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=160, Unknown=2, NotChecked=26, Total=240 [2018-04-10 15:54:39,603 INFO L87 Difference]: Start difference. First operand 323 states and 348 transitions. Second operand 16 states. [2018-04-10 15:54:40,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:40,139 INFO L93 Difference]: Finished difference Result 377 states and 403 transitions. [2018-04-10 15:54:40,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 15:54:40,141 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 87 [2018-04-10 15:54:40,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:40,142 INFO L225 Difference]: With dead ends: 377 [2018-04-10 15:54:40,142 INFO L226 Difference]: Without dead ends: 377 [2018-04-10 15:54:40,143 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=437, Unknown=37, NotChecked=46, Total=650 [2018-04-10 15:54:40,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-04-10 15:54:40,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 351. [2018-04-10 15:54:40,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-04-10 15:54:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 380 transitions. [2018-04-10 15:54:40,149 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 380 transitions. Word has length 87 [2018-04-10 15:54:40,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:40,149 INFO L459 AbstractCegarLoop]: Abstraction has 351 states and 380 transitions. [2018-04-10 15:54:40,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 15:54:40,149 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 380 transitions. [2018-04-10 15:54:40,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-04-10 15:54:40,150 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:40,150 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:40,150 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:40,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1837647721, now seen corresponding path program 1 times [2018-04-10 15:54:40,151 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:40,151 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:40,151 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:40,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:54:40,152 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:40,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:40,219 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-04-10 15:54:40,219 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:40,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:54:40,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:54:40,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:54:40,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:54:40,220 INFO L87 Difference]: Start difference. First operand 351 states and 380 transitions. Second operand 4 states. [2018-04-10 15:54:40,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:40,236 INFO L93 Difference]: Finished difference Result 359 states and 384 transitions. [2018-04-10 15:54:40,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 15:54:40,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-04-10 15:54:40,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:40,237 INFO L225 Difference]: With dead ends: 359 [2018-04-10 15:54:40,238 INFO L226 Difference]: Without dead ends: 359 [2018-04-10 15:54:40,238 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-10 15:54:40,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-04-10 15:54:40,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2018-04-10 15:54:40,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-04-10 15:54:40,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 382 transitions. [2018-04-10 15:54:40,244 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 382 transitions. Word has length 96 [2018-04-10 15:54:40,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:40,244 INFO L459 AbstractCegarLoop]: Abstraction has 357 states and 382 transitions. [2018-04-10 15:54:40,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:54:40,244 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 382 transitions. [2018-04-10 15:54:40,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-04-10 15:54:40,245 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:40,245 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:40,245 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:40,246 INFO L82 PathProgramCache]: Analyzing trace with hash -86304893, now seen corresponding path program 1 times [2018-04-10 15:54:40,246 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:40,246 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:40,247 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:40,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:40,247 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:40,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:40,339 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:40,339 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:40,339 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:40,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:40,362 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:40,376 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:40,377 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:54:40,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-04-10 15:54:40,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 15:54:40,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 15:54:40,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-04-10 15:54:40,378 INFO L87 Difference]: Start difference. First operand 357 states and 382 transitions. Second operand 11 states. [2018-04-10 15:54:40,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:40,415 INFO L93 Difference]: Finished difference Result 381 states and 406 transitions. [2018-04-10 15:54:40,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 15:54:40,416 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-04-10 15:54:40,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:40,417 INFO L225 Difference]: With dead ends: 381 [2018-04-10 15:54:40,417 INFO L226 Difference]: Without dead ends: 381 [2018-04-10 15:54:40,418 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-04-10 15:54:40,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-04-10 15:54:40,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 371. [2018-04-10 15:54:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-04-10 15:54:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 396 transitions. [2018-04-10 15:54:40,424 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 396 transitions. Word has length 96 [2018-04-10 15:54:40,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:40,424 INFO L459 AbstractCegarLoop]: Abstraction has 371 states and 396 transitions. [2018-04-10 15:54:40,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 15:54:40,424 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 396 transitions. [2018-04-10 15:54:40,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-04-10 15:54:40,425 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:40,425 INFO L355 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:40,425 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:40,426 INFO L82 PathProgramCache]: Analyzing trace with hash -172830846, now seen corresponding path program 2 times [2018-04-10 15:54:40,426 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:40,426 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:40,427 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:40,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:40,427 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:40,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:40,550 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:40,551 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:40,551 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:40,551 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:54:40,574 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-04-10 15:54:40,574 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:54:40,577 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:40,593 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1)) (= 0 (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|)))) is different from true [2018-04-10 15:54:40,600 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|)) (= |c_#valid| (store (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1)))) is different from true [2018-04-10 15:54:40,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:40,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:40,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-10 15:54:40,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-04-10 15:54:40,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:40,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:40,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:54:40,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2018-04-10 15:54:40,724 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-04-10 15:54:40,724 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:54:40,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2018-04-10 15:54:40,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 15:54:40,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 15:54:40,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=122, Unknown=2, NotChecked=50, Total=240 [2018-04-10 15:54:40,725 INFO L87 Difference]: Start difference. First operand 371 states and 396 transitions. Second operand 16 states. [2018-04-10 15:54:41,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:41,136 INFO L93 Difference]: Finished difference Result 403 states and 429 transitions. [2018-04-10 15:54:41,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 15:54:41,138 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2018-04-10 15:54:41,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:41,139 INFO L225 Difference]: With dead ends: 403 [2018-04-10 15:54:41,139 INFO L226 Difference]: Without dead ends: 403 [2018-04-10 15:54:41,140 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=302, Unknown=47, NotChecked=86, Total=600 [2018-04-10 15:54:41,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-04-10 15:54:41,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 389. [2018-04-10 15:54:41,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-04-10 15:54:41,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 416 transitions. [2018-04-10 15:54:41,146 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 416 transitions. Word has length 103 [2018-04-10 15:54:41,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:41,147 INFO L459 AbstractCegarLoop]: Abstraction has 389 states and 416 transitions. [2018-04-10 15:54:41,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 15:54:41,147 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 416 transitions. [2018-04-10 15:54:41,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-04-10 15:54:41,148 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:41,148 INFO L355 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:41,148 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:41,148 INFO L82 PathProgramCache]: Analyzing trace with hash -614798684, now seen corresponding path program 1 times [2018-04-10 15:54:41,148 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:41,148 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:41,149 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:41,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:54:41,149 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:41,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:41,261 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:41,261 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:41,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:41,278 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:41,294 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:41,294 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:54:41,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-04-10 15:54:41,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-10 15:54:41,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-10 15:54:41,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-04-10 15:54:41,295 INFO L87 Difference]: Start difference. First operand 389 states and 416 transitions. Second operand 13 states. [2018-04-10 15:54:41,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:41,341 INFO L93 Difference]: Finished difference Result 413 states and 440 transitions. [2018-04-10 15:54:41,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 15:54:41,344 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 110 [2018-04-10 15:54:41,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:41,347 INFO L225 Difference]: With dead ends: 413 [2018-04-10 15:54:41,347 INFO L226 Difference]: Without dead ends: 413 [2018-04-10 15:54:41,347 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-04-10 15:54:41,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-04-10 15:54:41,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 403. [2018-04-10 15:54:41,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-04-10 15:54:41,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 430 transitions. [2018-04-10 15:54:41,355 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 430 transitions. Word has length 110 [2018-04-10 15:54:41,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:41,355 INFO L459 AbstractCegarLoop]: Abstraction has 403 states and 430 transitions. [2018-04-10 15:54:41,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-10 15:54:41,355 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 430 transitions. [2018-04-10 15:54:41,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-04-10 15:54:41,356 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:41,356 INFO L355 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:41,356 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:41,356 INFO L82 PathProgramCache]: Analyzing trace with hash -327862173, now seen corresponding path program 2 times [2018-04-10 15:54:41,357 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:41,357 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:41,357 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:41,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:41,357 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:41,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:41,520 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:41,520 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:41,520 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:54:41,560 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-04-10 15:54:41,561 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:54:41,563 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:41,614 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |c_#length|))) is different from true [2018-04-10 15:54:41,618 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80)))) is different from true [2018-04-10 15:54:41,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:41,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23 [2018-04-10 15:54:41,677 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:41,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 19 treesize of output 33 [2018-04-10 15:54:41,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-10 15:54:41,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:54:41,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:41,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:41,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-10 15:54:41,734 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:41,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 15:54:41,760 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:33, output treesize:52 [2018-04-10 15:54:41,837 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2018-04-10 15:54:41,837 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:54:41,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 21 [2018-04-10 15:54:41,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 15:54:41,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 15:54:41,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=252, Unknown=2, NotChecked=70, Total=420 [2018-04-10 15:54:41,838 INFO L87 Difference]: Start difference. First operand 403 states and 430 transitions. Second operand 21 states. [2018-04-10 15:54:42,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:42,467 INFO L93 Difference]: Finished difference Result 434 states and 456 transitions. [2018-04-10 15:54:42,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 15:54:42,468 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 117 [2018-04-10 15:54:42,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:42,469 INFO L225 Difference]: With dead ends: 434 [2018-04-10 15:54:42,469 INFO L226 Difference]: Without dead ends: 434 [2018-04-10 15:54:42,470 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=265, Invalid=865, Unknown=68, NotChecked=134, Total=1332 [2018-04-10 15:54:42,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-04-10 15:54:42,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 416. [2018-04-10 15:54:42,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-04-10 15:54:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 441 transitions. [2018-04-10 15:54:42,477 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 441 transitions. Word has length 117 [2018-04-10 15:54:42,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:42,477 INFO L459 AbstractCegarLoop]: Abstraction has 416 states and 441 transitions. [2018-04-10 15:54:42,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 15:54:42,478 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 441 transitions. [2018-04-10 15:54:42,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-10 15:54:42,478 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:42,479 INFO L355 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:42,479 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:42,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1416359625, now seen corresponding path program 1 times [2018-04-10 15:54:42,479 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:42,479 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:42,480 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:42,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:54:42,480 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:42,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:42,566 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2018-04-10 15:54:42,566 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:42,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 15:54:42,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 15:54:42,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 15:54:42,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:54:42,567 INFO L87 Difference]: Start difference. First operand 416 states and 441 transitions. Second operand 6 states. [2018-04-10 15:54:42,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:42,644 INFO L93 Difference]: Finished difference Result 460 states and 489 transitions. [2018-04-10 15:54:42,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 15:54:42,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2018-04-10 15:54:42,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:42,646 INFO L225 Difference]: With dead ends: 460 [2018-04-10 15:54:42,646 INFO L226 Difference]: Without dead ends: 460 [2018-04-10 15:54:42,646 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-10 15:54:42,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-04-10 15:54:42,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 424. [2018-04-10 15:54:42,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-04-10 15:54:42,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 449 transitions. [2018-04-10 15:54:42,652 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 449 transitions. Word has length 124 [2018-04-10 15:54:42,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:42,652 INFO L459 AbstractCegarLoop]: Abstraction has 424 states and 449 transitions. [2018-04-10 15:54:42,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 15:54:42,653 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 449 transitions. [2018-04-10 15:54:42,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-04-10 15:54:42,654 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:42,654 INFO L355 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:42,654 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:42,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1368301798, now seen corresponding path program 1 times [2018-04-10 15:54:42,654 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:42,654 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:42,655 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:42,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:42,655 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:42,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:42,792 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:42,792 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:42,793 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:42,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:42,819 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:42,837 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:42,838 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:54:42,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-04-10 15:54:42,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 15:54:42,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 15:54:42,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-04-10 15:54:42,839 INFO L87 Difference]: Start difference. First operand 424 states and 449 transitions. Second operand 15 states. [2018-04-10 15:54:42,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:42,881 INFO L93 Difference]: Finished difference Result 448 states and 473 transitions. [2018-04-10 15:54:42,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 15:54:42,882 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 126 [2018-04-10 15:54:42,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:42,883 INFO L225 Difference]: With dead ends: 448 [2018-04-10 15:54:42,883 INFO L226 Difference]: Without dead ends: 448 [2018-04-10 15:54:42,883 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-04-10 15:54:42,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-04-10 15:54:42,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 438. [2018-04-10 15:54:42,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-04-10 15:54:42,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 463 transitions. [2018-04-10 15:54:42,890 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 463 transitions. Word has length 126 [2018-04-10 15:54:42,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:42,890 INFO L459 AbstractCegarLoop]: Abstraction has 438 states and 463 transitions. [2018-04-10 15:54:42,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 15:54:42,890 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 463 transitions. [2018-04-10 15:54:42,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-04-10 15:54:42,891 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:42,892 INFO L355 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:42,892 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:42,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1844556071, now seen corresponding path program 2 times [2018-04-10 15:54:42,892 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:42,892 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:42,893 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:42,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:42,893 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:42,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:43,049 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:43,049 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:43,049 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:43,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:54:43,067 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-04-10 15:54:43,067 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:54:43,070 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:43,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:54:43,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:43,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:43,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 15:54:43,109 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1)) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0))) is different from true [2018-04-10 15:54:43,112 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1)) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0))) is different from true [2018-04-10 15:54:43,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:43,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:43,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2018-04-10 15:54:43,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-04-10 15:54:43,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:43,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:43,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:54:43,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2018-04-10 15:54:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2018-04-10 15:54:43,304 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:54:43,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 22 [2018-04-10 15:54:43,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 15:54:43,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 15:54:43,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=252, Unknown=16, NotChecked=74, Total=462 [2018-04-10 15:54:43,305 INFO L87 Difference]: Start difference. First operand 438 states and 463 transitions. Second operand 22 states. [2018-04-10 15:54:43,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:43,992 INFO L93 Difference]: Finished difference Result 481 states and 506 transitions. [2018-04-10 15:54:43,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 15:54:43,992 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 133 [2018-04-10 15:54:43,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:43,993 INFO L225 Difference]: With dead ends: 481 [2018-04-10 15:54:43,993 INFO L226 Difference]: Without dead ends: 481 [2018-04-10 15:54:43,994 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=328, Invalid=719, Unknown=17, NotChecked=126, Total=1190 [2018-04-10 15:54:43,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2018-04-10 15:54:43,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 460. [2018-04-10 15:54:43,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-04-10 15:54:43,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 486 transitions. [2018-04-10 15:54:43,998 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 486 transitions. Word has length 133 [2018-04-10 15:54:43,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:43,998 INFO L459 AbstractCegarLoop]: Abstraction has 460 states and 486 transitions. [2018-04-10 15:54:43,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 15:54:43,998 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 486 transitions. [2018-04-10 15:54:43,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-04-10 15:54:43,999 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:43,999 INFO L355 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:43,999 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:43,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1624701499, now seen corresponding path program 1 times [2018-04-10 15:54:43,999 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:43,999 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:44,000 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:44,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:54:44,000 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:44,011 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:44,148 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:44,149 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:44,149 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:44,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:44,168 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:44,180 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:54:44,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-04-10 15:54:44,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 15:54:44,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 15:54:44,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-04-10 15:54:44,181 INFO L87 Difference]: Start difference. First operand 460 states and 486 transitions. Second operand 17 states. [2018-04-10 15:54:44,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:44,218 INFO L93 Difference]: Finished difference Result 484 states and 510 transitions. [2018-04-10 15:54:44,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 15:54:44,219 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 140 [2018-04-10 15:54:44,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:44,220 INFO L225 Difference]: With dead ends: 484 [2018-04-10 15:54:44,220 INFO L226 Difference]: Without dead ends: 484 [2018-04-10 15:54:44,220 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-04-10 15:54:44,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-04-10 15:54:44,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 474. [2018-04-10 15:54:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-04-10 15:54:44,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 500 transitions. [2018-04-10 15:54:44,223 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 500 transitions. Word has length 140 [2018-04-10 15:54:44,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:44,224 INFO L459 AbstractCegarLoop]: Abstraction has 474 states and 500 transitions. [2018-04-10 15:54:44,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 15:54:44,224 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 500 transitions. [2018-04-10 15:54:44,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-04-10 15:54:44,224 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:44,224 INFO L355 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:44,224 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:44,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1504055366, now seen corresponding path program 2 times [2018-04-10 15:54:44,225 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:44,225 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:44,225 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:44,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:44,225 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:44,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:44,365 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 0 proven. 665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:44,365 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:44,365 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:44,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:54:44,374 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-04-10 15:54:44,374 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:54:44,376 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:44,449 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|) 0) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80)))) is different from true [2018-04-10 15:54:44,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:44,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:44,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:44,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:44,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 30 [2018-04-10 15:54:44,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:44,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23 [2018-04-10 15:54:44,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:44,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 36 [2018-04-10 15:54:44,554 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:44,562 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:44,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:54:44,571 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29 [2018-04-10 15:54:44,705 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 665 trivial. 0 not checked. [2018-04-10 15:54:44,705 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:54:44,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 24 [2018-04-10 15:54:44,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 15:54:44,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 15:54:44,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=356, Unknown=2, NotChecked=42, Total=552 [2018-04-10 15:54:44,706 INFO L87 Difference]: Start difference. First operand 474 states and 500 transitions. Second operand 24 states. [2018-04-10 15:54:45,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:45,383 INFO L93 Difference]: Finished difference Result 527 states and 558 transitions. [2018-04-10 15:54:45,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 15:54:45,383 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 147 [2018-04-10 15:54:45,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:45,384 INFO L225 Difference]: With dead ends: 527 [2018-04-10 15:54:45,385 INFO L226 Difference]: Without dead ends: 527 [2018-04-10 15:54:45,385 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=432, Invalid=1158, Unknown=136, NotChecked=80, Total=1806 [2018-04-10 15:54:45,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-04-10 15:54:45,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 499. [2018-04-10 15:54:45,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-04-10 15:54:45,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 527 transitions. [2018-04-10 15:54:45,391 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 527 transitions. Word has length 147 [2018-04-10 15:54:45,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:45,391 INFO L459 AbstractCegarLoop]: Abstraction has 499 states and 527 transitions. [2018-04-10 15:54:45,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 15:54:45,391 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 527 transitions. [2018-04-10 15:54:45,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-04-10 15:54:45,391 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:45,392 INFO L355 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:45,392 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:45,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1793737151, now seen corresponding path program 1 times [2018-04-10 15:54:45,392 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:45,392 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:45,392 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:45,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:54:45,393 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:45,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:45,435 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2018-04-10 15:54:45,435 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:45,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:54:45,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:54:45,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:54:45,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:54:45,436 INFO L87 Difference]: Start difference. First operand 499 states and 527 transitions. Second operand 5 states. [2018-04-10 15:54:45,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:45,565 INFO L93 Difference]: Finished difference Result 498 states and 526 transitions. [2018-04-10 15:54:45,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:54:45,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2018-04-10 15:54:45,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:45,567 INFO L225 Difference]: With dead ends: 498 [2018-04-10 15:54:45,567 INFO L226 Difference]: Without dead ends: 498 [2018-04-10 15:54:45,567 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:54:45,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-04-10 15:54:45,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2018-04-10 15:54:45,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-04-10 15:54:45,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 526 transitions. [2018-04-10 15:54:45,573 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 526 transitions. Word has length 155 [2018-04-10 15:54:45,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:45,574 INFO L459 AbstractCegarLoop]: Abstraction has 498 states and 526 transitions. [2018-04-10 15:54:45,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:54:45,574 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 526 transitions. [2018-04-10 15:54:45,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-04-10 15:54:45,574 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:45,575 INFO L355 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:45,575 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:45,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1793737152, now seen corresponding path program 1 times [2018-04-10 15:54:45,575 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:45,575 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:45,576 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:45,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:45,576 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:45,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:45,747 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:45,747 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:45,747 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:45,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:45,778 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:45,830 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:45,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:54:45,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-04-10 15:54:45,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 15:54:45,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 15:54:45,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-04-10 15:54:45,832 INFO L87 Difference]: Start difference. First operand 498 states and 526 transitions. Second operand 19 states. [2018-04-10 15:54:45,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:45,894 INFO L93 Difference]: Finished difference Result 522 states and 550 transitions. [2018-04-10 15:54:45,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 15:54:45,895 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 155 [2018-04-10 15:54:45,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:45,896 INFO L225 Difference]: With dead ends: 522 [2018-04-10 15:54:45,897 INFO L226 Difference]: Without dead ends: 522 [2018-04-10 15:54:45,897 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-04-10 15:54:45,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-04-10 15:54:45,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 512. [2018-04-10 15:54:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-04-10 15:54:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 540 transitions. [2018-04-10 15:54:45,904 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 540 transitions. Word has length 155 [2018-04-10 15:54:45,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:45,905 INFO L459 AbstractCegarLoop]: Abstraction has 512 states and 540 transitions. [2018-04-10 15:54:45,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 15:54:45,905 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 540 transitions. [2018-04-10 15:54:45,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-04-10 15:54:45,906 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:45,906 INFO L355 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:45,906 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:45,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1310998943, now seen corresponding path program 2 times [2018-04-10 15:54:45,906 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:45,906 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:45,907 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:45,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:45,907 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:45,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:46,106 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 0 proven. 872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:46,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:46,107 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:46,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:54:46,128 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-04-10 15:54:46,129 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:54:46,132 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:46,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:54:46,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:46,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:54:46,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:46,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:46,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 15:54:46,169 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__append_#t~malloc23.base| Int)) (and (= (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__append_#t~malloc23.base| 8) |c_#length|) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__append_#t~malloc23.base|) 0))) is different from true [2018-04-10 15:54:46,182 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (= (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |c_#length|)) is different from true [2018-04-10 15:54:46,184 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (= |c_#length| (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80))) is different from true [2018-04-10 15:54:46,219 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__append_#t~malloc23.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= (store (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__append_#t~malloc23.base| 8) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80) |c_#length|) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__append_#t~malloc23.base|) 0))) is different from true [2018-04-10 15:54:46,225 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:46,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:46,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-10 15:54:46,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:46,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:46,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 30 [2018-04-10 15:54:46,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:46,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:46,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 34 [2018-04-10 15:54:46,253 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 15:54:46,254 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:46,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:46,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:46,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:46,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:46,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:46,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:46,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:46,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:46,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 22 treesize of output 45 [2018-04-10 15:54:46,300 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2018-04-10 15:54:46,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:46,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:46,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:46,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 15:54:46,380 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-04-10 15:54:46,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:46,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:46,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:46,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 15:54:46,470 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-04-10 15:54:46,513 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-04-10 15:54:46,554 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-04-10 15:54:46,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 17 dim-0 vars, and 10 xjuncts. [2018-04-10 15:54:46,605 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:31, output treesize:176 [2018-04-10 15:54:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2018-04-10 15:54:46,701 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:54:46,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 27 [2018-04-10 15:54:46,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-10 15:54:46,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-10 15:54:46,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=330, Unknown=4, NotChecked=180, Total=702 [2018-04-10 15:54:46,702 INFO L87 Difference]: Start difference. First operand 512 states and 540 transitions. Second operand 27 states. [2018-04-10 15:54:47,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:47,468 INFO L93 Difference]: Finished difference Result 585 states and 622 transitions. [2018-04-10 15:54:47,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 15:54:47,468 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 162 [2018-04-10 15:54:47,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:47,469 INFO L225 Difference]: With dead ends: 585 [2018-04-10 15:54:47,469 INFO L226 Difference]: Without dead ends: 585 [2018-04-10 15:54:47,470 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=511, Invalid=908, Unknown=157, NotChecked=316, Total=1892 [2018-04-10 15:54:47,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-04-10 15:54:47,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 556. [2018-04-10 15:54:47,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-04-10 15:54:47,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 604 transitions. [2018-04-10 15:54:47,475 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 604 transitions. Word has length 162 [2018-04-10 15:54:47,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:47,476 INFO L459 AbstractCegarLoop]: Abstraction has 556 states and 604 transitions. [2018-04-10 15:54:47,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-10 15:54:47,476 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 604 transitions. [2018-04-10 15:54:47,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-04-10 15:54:47,476 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:47,476 INFO L355 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:47,477 INFO L408 AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:47,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1269081651, now seen corresponding path program 1 times [2018-04-10 15:54:47,477 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:47,477 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:47,477 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:47,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:54:47,477 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:47,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:47,550 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 986 trivial. 0 not checked. [2018-04-10 15:54:47,550 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:47,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 15:54:47,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 15:54:47,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 15:54:47,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:54:47,551 INFO L87 Difference]: Start difference. First operand 556 states and 604 transitions. Second operand 7 states. [2018-04-10 15:54:47,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:47,799 INFO L93 Difference]: Finished difference Result 582 states and 637 transitions. [2018-04-10 15:54:47,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 15:54:47,800 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2018-04-10 15:54:47,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:47,801 INFO L225 Difference]: With dead ends: 582 [2018-04-10 15:54:47,802 INFO L226 Difference]: Without dead ends: 582 [2018-04-10 15:54:47,802 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-10 15:54:47,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-04-10 15:54:47,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 555. [2018-04-10 15:54:47,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-04-10 15:54:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 602 transitions. [2018-04-10 15:54:47,809 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 602 transitions. Word has length 170 [2018-04-10 15:54:47,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:47,809 INFO L459 AbstractCegarLoop]: Abstraction has 555 states and 602 transitions. [2018-04-10 15:54:47,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 15:54:47,809 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 602 transitions. [2018-04-10 15:54:47,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-04-10 15:54:47,810 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:47,810 INFO L355 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:47,810 INFO L408 AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:47,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1269081650, now seen corresponding path program 1 times [2018-04-10 15:54:47,810 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:47,811 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:47,811 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:47,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:47,811 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:47,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:48,048 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 0 proven. 986 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:48,048 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:48,049 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:48,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:48,077 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:48,111 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 0 proven. 986 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:48,112 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:54:48,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-04-10 15:54:48,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 15:54:48,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 15:54:48,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-04-10 15:54:48,113 INFO L87 Difference]: Start difference. First operand 555 states and 602 transitions. Second operand 21 states. [2018-04-10 15:54:48,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:48,173 INFO L93 Difference]: Finished difference Result 579 states and 626 transitions. [2018-04-10 15:54:48,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 15:54:48,176 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 170 [2018-04-10 15:54:48,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:48,178 INFO L225 Difference]: With dead ends: 579 [2018-04-10 15:54:48,178 INFO L226 Difference]: Without dead ends: 579 [2018-04-10 15:54:48,178 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-04-10 15:54:48,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-04-10 15:54:48,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 569. [2018-04-10 15:54:48,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2018-04-10 15:54:48,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 616 transitions. [2018-04-10 15:54:48,186 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 616 transitions. Word has length 170 [2018-04-10 15:54:48,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:48,186 INFO L459 AbstractCegarLoop]: Abstraction has 569 states and 616 transitions. [2018-04-10 15:54:48,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 15:54:48,186 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 616 transitions. [2018-04-10 15:54:48,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-04-10 15:54:48,187 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:48,187 INFO L355 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:48,187 INFO L408 AbstractCegarLoop]: === Iteration 35 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:48,188 INFO L82 PathProgramCache]: Analyzing trace with hash 293529357, now seen corresponding path program 2 times [2018-04-10 15:54:48,188 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:48,188 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:48,188 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:48,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:48,189 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:48,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:48,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:48,479 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:48,479 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:48,479 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:54:48,513 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-04-10 15:54:48,514 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:54:48,517 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:48,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:54:48,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:54:48,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:48,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:48,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:54:48,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:54:48,636 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:48,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:48,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:54:48,644 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:42, output treesize:36 [2018-04-10 15:54:48,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-10 15:54:48,719 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:54:48,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-10 15:54:48,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:48,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:48,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-04-10 15:54:48,740 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:54:48,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-10 15:54:48,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:48,746 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:48,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:48,754 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:53, output treesize:14 [2018-04-10 15:54:48,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2018-04-10 15:54:48,783 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:54:48,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [21] total 30 [2018-04-10 15:54:48,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-10 15:54:48,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-10 15:54:48,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=634, Unknown=0, NotChecked=0, Total=870 [2018-04-10 15:54:48,784 INFO L87 Difference]: Start difference. First operand 569 states and 616 transitions. Second operand 30 states. [2018-04-10 15:54:49,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:49,534 INFO L93 Difference]: Finished difference Result 640 states and 698 transitions. [2018-04-10 15:54:49,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-10 15:54:49,534 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 177 [2018-04-10 15:54:49,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:49,535 INFO L225 Difference]: With dead ends: 640 [2018-04-10 15:54:49,536 INFO L226 Difference]: Without dead ends: 640 [2018-04-10 15:54:49,536 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=308, Invalid=1174, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 15:54:49,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-04-10 15:54:49,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 582. [2018-04-10 15:54:49,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-04-10 15:54:49,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 628 transitions. [2018-04-10 15:54:49,543 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 628 transitions. Word has length 177 [2018-04-10 15:54:49,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:49,543 INFO L459 AbstractCegarLoop]: Abstraction has 582 states and 628 transitions. [2018-04-10 15:54:49,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-10 15:54:49,543 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 628 transitions. [2018-04-10 15:54:49,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-04-10 15:54:49,544 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:49,544 INFO L355 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:49,544 INFO L408 AbstractCegarLoop]: === Iteration 36 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:49,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1731486807, now seen corresponding path program 1 times [2018-04-10 15:54:49,545 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:49,545 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:49,545 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:49,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:54:49,545 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:49,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:49,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:49,816 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:49,816 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:49,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:49,845 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:49,883 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:54:49,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-04-10 15:54:49,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 15:54:49,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 15:54:49,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-04-10 15:54:49,884 INFO L87 Difference]: Start difference. First operand 582 states and 628 transitions. Second operand 23 states. [2018-04-10 15:54:49,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:49,954 INFO L93 Difference]: Finished difference Result 596 states and 642 transitions. [2018-04-10 15:54:49,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 15:54:49,954 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 184 [2018-04-10 15:54:49,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:49,956 INFO L225 Difference]: With dead ends: 596 [2018-04-10 15:54:49,956 INFO L226 Difference]: Without dead ends: 596 [2018-04-10 15:54:49,956 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-04-10 15:54:49,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2018-04-10 15:54:49,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2018-04-10 15:54:49,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-04-10 15:54:49,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 642 transitions. [2018-04-10 15:54:49,964 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 642 transitions. Word has length 184 [2018-04-10 15:54:49,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:49,965 INFO L459 AbstractCegarLoop]: Abstraction has 596 states and 642 transitions. [2018-04-10 15:54:49,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 15:54:49,965 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 642 transitions. [2018-04-10 15:54:49,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-04-10 15:54:49,966 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:49,966 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:49,966 INFO L408 AbstractCegarLoop]: === Iteration 37 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:49,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1288466776, now seen corresponding path program 2 times [2018-04-10 15:54:49,966 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:49,966 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:49,967 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:49,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:49,967 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:49,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:50,002 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:54:50,002 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:50,002 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:50,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:54:50,021 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-04-10 15:54:50,021 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:54:50,025 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:50,046 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1)) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0))) is different from true [2018-04-10 15:54:50,049 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1)) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0))) is different from true [2018-04-10 15:54:50,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:50,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:50,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:50,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2018-04-10 15:54:50,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-10 15:54:50,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:50,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:50,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:54:50,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:29 [2018-04-10 15:54:50,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:54:50,253 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:50,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 15:54:50,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 15:54:50,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 15:54:50,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=28, Unknown=2, NotChecked=22, Total=72 [2018-04-10 15:54:50,254 INFO L87 Difference]: Start difference. First operand 596 states and 642 transitions. Second operand 9 states. [2018-04-10 15:54:50,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:50,446 INFO L93 Difference]: Finished difference Result 613 states and 662 transitions. [2018-04-10 15:54:50,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 15:54:50,446 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 191 [2018-04-10 15:54:50,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:50,447 INFO L225 Difference]: With dead ends: 613 [2018-04-10 15:54:50,448 INFO L226 Difference]: Without dead ends: 613 [2018-04-10 15:54:50,448 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=28, Unknown=2, NotChecked=22, Total=72 [2018-04-10 15:54:50,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-04-10 15:54:50,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 598. [2018-04-10 15:54:50,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-04-10 15:54:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 645 transitions. [2018-04-10 15:54:50,454 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 645 transitions. Word has length 191 [2018-04-10 15:54:50,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:50,455 INFO L459 AbstractCegarLoop]: Abstraction has 598 states and 645 transitions. [2018-04-10 15:54:50,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 15:54:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 645 transitions. [2018-04-10 15:54:50,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-04-10 15:54:50,456 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:50,456 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:50,456 INFO L408 AbstractCegarLoop]: === Iteration 38 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:50,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1288466775, now seen corresponding path program 1 times [2018-04-10 15:54:50,457 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:50,457 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:50,457 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:50,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:54:50,457 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:50,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:50,491 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:54:50,492 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:50,492 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:50,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:50,529 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:50,567 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |c_#length|))) is different from true [2018-04-10 15:54:50,569 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80)))) is different from true [2018-04-10 15:54:50,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:50,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:50,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-10 15:54:50,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:50,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23 [2018-04-10 15:54:50,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:50,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 19 treesize of output 33 [2018-04-10 15:54:50,642 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-10 15:54:50,658 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:54:50,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 15:54:50,678 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:33, output treesize:52 [2018-04-10 15:54:50,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:54:50,833 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:50,833 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 15:54:50,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 15:54:50,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 15:54:50,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=43, Unknown=2, NotChecked=26, Total=90 [2018-04-10 15:54:50,834 INFO L87 Difference]: Start difference. First operand 598 states and 645 transitions. Second operand 10 states. [2018-04-10 15:54:51,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:51,075 INFO L93 Difference]: Finished difference Result 610 states and 659 transitions. [2018-04-10 15:54:51,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 15:54:51,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 191 [2018-04-10 15:54:51,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:51,076 INFO L225 Difference]: With dead ends: 610 [2018-04-10 15:54:51,076 INFO L226 Difference]: Without dead ends: 610 [2018-04-10 15:54:51,077 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=133, Unknown=2, NotChecked=50, Total=240 [2018-04-10 15:54:51,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-04-10 15:54:51,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 598. [2018-04-10 15:54:51,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-04-10 15:54:51,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 644 transitions. [2018-04-10 15:54:51,081 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 644 transitions. Word has length 191 [2018-04-10 15:54:51,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:51,082 INFO L459 AbstractCegarLoop]: Abstraction has 598 states and 644 transitions. [2018-04-10 15:54:51,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 15:54:51,082 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 644 transitions. [2018-04-10 15:54:51,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-04-10 15:54:51,109 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:51,109 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:51,109 INFO L408 AbstractCegarLoop]: === Iteration 39 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:51,109 INFO L82 PathProgramCache]: Analyzing trace with hash -341476481, now seen corresponding path program 1 times [2018-04-10 15:54:51,109 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:51,109 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:51,110 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:51,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:51,110 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:51,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:51,129 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:54:51,129 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:51,130 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:51,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:51,170 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:51,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:54:51,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:51,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:51,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 15:54:51,182 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1)) (= 0 (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|)))) is different from true [2018-04-10 15:54:51,184 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|)) (= |c_#valid| (store (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1)))) is different from true [2018-04-10 15:54:51,222 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (let ((.cse0 (store (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1))) (and (= |c_#valid| (store .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| 1)) (= 0 (select .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base|)) (= 0 (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|))))) is different from true [2018-04-10 15:54:51,229 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:51,230 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:51,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2018-04-10 15:54:51,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:51,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:51,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:51,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 49 [2018-04-10 15:54:51,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2018-04-10 15:54:51,265 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:51,276 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:51,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:51,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:54:51,298 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:34, output treesize:37 [2018-04-10 15:54:51,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:54:51,377 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:51,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 15:54:51,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 15:54:51,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 15:54:51,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=23, Unknown=3, NotChecked=30, Total=72 [2018-04-10 15:54:51,378 INFO L87 Difference]: Start difference. First operand 598 states and 644 transitions. Second operand 9 states. [2018-04-10 15:54:51,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:51,751 INFO L93 Difference]: Finished difference Result 636 states and 683 transitions. [2018-04-10 15:54:51,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 15:54:51,751 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 194 [2018-04-10 15:54:51,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:51,752 INFO L225 Difference]: With dead ends: 636 [2018-04-10 15:54:51,752 INFO L226 Difference]: Without dead ends: 636 [2018-04-10 15:54:51,752 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=31, Unknown=3, NotChecked=36, Total=90 [2018-04-10 15:54:51,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2018-04-10 15:54:51,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 609. [2018-04-10 15:54:51,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-04-10 15:54:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 655 transitions. [2018-04-10 15:54:51,757 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 655 transitions. Word has length 194 [2018-04-10 15:54:51,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:51,757 INFO L459 AbstractCegarLoop]: Abstraction has 609 states and 655 transitions. [2018-04-10 15:54:51,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 15:54:51,757 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 655 transitions. [2018-04-10 15:54:51,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-04-10 15:54:51,758 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:51,758 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:51,758 INFO L408 AbstractCegarLoop]: === Iteration 40 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:51,758 INFO L82 PathProgramCache]: Analyzing trace with hash -341476480, now seen corresponding path program 1 times [2018-04-10 15:54:51,758 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:51,759 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:51,759 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:51,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:51,759 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:51,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:51,794 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:54:51,794 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:51,794 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:51,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:51,833 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:51,862 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|) 0) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80)))) is different from true [2018-04-10 15:54:51,946 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|) 0) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| 16)))) is different from true [2018-04-10 15:54:51,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:51,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-04-10 15:54:51,972 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:51,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:51,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 42 [2018-04-10 15:54:51,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 46 [2018-04-10 15:54:51,995 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-10 15:54:52,027 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:54:52,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:54:52,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:52,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:52,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:52,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:52,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 30 [2018-04-10 15:54:52,059 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:52,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 15:54:52,072 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:41, output treesize:72 [2018-04-10 15:54:53,371 WARN L151 SmtUtils]: Spent 1290ms on a formula simplification. DAG size of input: 46 DAG size of output 42 [2018-04-10 15:54:53,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:54:53,472 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:53,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 15:54:53,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 15:54:53,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 15:54:53,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=42, Unknown=3, NotChecked=26, Total=90 [2018-04-10 15:54:53,473 INFO L87 Difference]: Start difference. First operand 609 states and 655 transitions. Second operand 10 states. [2018-04-10 15:54:54,567 WARN L148 SmtUtils]: Spent 1030ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-10 15:54:56,582 WARN L151 SmtUtils]: Spent 2004ms on a formula simplification. DAG size of input: 49 DAG size of output 49 [2018-04-10 15:54:56,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:56,683 INFO L93 Difference]: Finished difference Result 635 states and 682 transitions. [2018-04-10 15:54:56,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 15:54:56,719 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 194 [2018-04-10 15:54:56,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:56,720 INFO L225 Difference]: With dead ends: 635 [2018-04-10 15:54:56,721 INFO L226 Difference]: Without dead ends: 635 [2018-04-10 15:54:56,721 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=44, Invalid=93, Unknown=3, NotChecked=42, Total=182 [2018-04-10 15:54:56,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-04-10 15:54:56,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 613. [2018-04-10 15:54:56,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-04-10 15:54:56,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 659 transitions. [2018-04-10 15:54:56,725 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 659 transitions. Word has length 194 [2018-04-10 15:54:56,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:56,726 INFO L459 AbstractCegarLoop]: Abstraction has 613 states and 659 transitions. [2018-04-10 15:54:56,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 15:54:56,726 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 659 transitions. [2018-04-10 15:54:56,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-04-10 15:54:56,726 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:56,727 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:56,727 INFO L408 AbstractCegarLoop]: === Iteration 41 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:56,727 INFO L82 PathProgramCache]: Analyzing trace with hash -590739205, now seen corresponding path program 1 times [2018-04-10 15:54:56,727 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:56,727 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:56,727 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:56,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:56,727 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:56,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:56,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:54:56,868 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:56,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 15:54:56,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 15:54:56,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 15:54:56,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:54:56,868 INFO L87 Difference]: Start difference. First operand 613 states and 659 transitions. Second operand 6 states. [2018-04-10 15:54:57,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:57,130 INFO L93 Difference]: Finished difference Result 608 states and 654 transitions. [2018-04-10 15:54:57,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 15:54:57,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 194 [2018-04-10 15:54:57,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:57,131 INFO L225 Difference]: With dead ends: 608 [2018-04-10 15:54:57,131 INFO L226 Difference]: Without dead ends: 608 [2018-04-10 15:54:57,131 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:54:57,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-04-10 15:54:57,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 570. [2018-04-10 15:54:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-04-10 15:54:57,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 598 transitions. [2018-04-10 15:54:57,135 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 598 transitions. Word has length 194 [2018-04-10 15:54:57,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:57,135 INFO L459 AbstractCegarLoop]: Abstraction has 570 states and 598 transitions. [2018-04-10 15:54:57,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 15:54:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 598 transitions. [2018-04-10 15:54:57,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-04-10 15:54:57,136 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:57,136 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:57,136 INFO L408 AbstractCegarLoop]: === Iteration 42 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:57,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1517151886, now seen corresponding path program 1 times [2018-04-10 15:54:57,137 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:57,137 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:57,137 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:57,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:57,137 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:57,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:57,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:54:57,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:57,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:54:57,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:54:57,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:54:57,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:54:57,217 INFO L87 Difference]: Start difference. First operand 570 states and 598 transitions. Second operand 5 states. [2018-04-10 15:54:57,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:57,357 INFO L93 Difference]: Finished difference Result 585 states and 615 transitions. [2018-04-10 15:54:57,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:54:57,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2018-04-10 15:54:57,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:57,359 INFO L225 Difference]: With dead ends: 585 [2018-04-10 15:54:57,359 INFO L226 Difference]: Without dead ends: 585 [2018-04-10 15:54:57,359 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:54:57,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-04-10 15:54:57,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 569. [2018-04-10 15:54:57,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2018-04-10 15:54:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 597 transitions. [2018-04-10 15:54:57,363 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 597 transitions. Word has length 195 [2018-04-10 15:54:57,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:57,363 INFO L459 AbstractCegarLoop]: Abstraction has 569 states and 597 transitions. [2018-04-10 15:54:57,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:54:57,363 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 597 transitions. [2018-04-10 15:54:57,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-04-10 15:54:57,364 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:57,364 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:57,364 INFO L408 AbstractCegarLoop]: === Iteration 43 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:57,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1517151885, now seen corresponding path program 1 times [2018-04-10 15:54:57,364 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:57,364 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:57,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:57,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:57,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:57,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:57,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:54:57,443 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:57,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:54:57,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:54:57,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:54:57,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:54:57,444 INFO L87 Difference]: Start difference. First operand 569 states and 597 transitions. Second operand 5 states. [2018-04-10 15:54:57,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:57,599 INFO L93 Difference]: Finished difference Result 596 states and 626 transitions. [2018-04-10 15:54:57,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:54:57,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2018-04-10 15:54:57,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:57,601 INFO L225 Difference]: With dead ends: 596 [2018-04-10 15:54:57,602 INFO L226 Difference]: Without dead ends: 596 [2018-04-10 15:54:57,602 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:54:57,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2018-04-10 15:54:57,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 568. [2018-04-10 15:54:57,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-04-10 15:54:57,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 596 transitions. [2018-04-10 15:54:57,607 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 596 transitions. Word has length 195 [2018-04-10 15:54:57,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:57,608 INFO L459 AbstractCegarLoop]: Abstraction has 568 states and 596 transitions. [2018-04-10 15:54:57,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:54:57,608 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 596 transitions. [2018-04-10 15:54:57,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-04-10 15:54:57,609 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:57,609 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:57,609 INFO L408 AbstractCegarLoop]: === Iteration 44 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:57,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1741375922, now seen corresponding path program 1 times [2018-04-10 15:54:57,609 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:57,609 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:57,610 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:57,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:57,610 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:57,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:57,641 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:54:57,641 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:57,641 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:57,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:57,720 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:57,735 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1)) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0))) is different from true [2018-04-10 15:54:57,739 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (let ((.cse0 (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1))) (and (= |c_#valid| (store .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1)) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= 0 (select .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|))))) is different from true [2018-04-10 15:54:57,814 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (let ((.cse0 (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1))) (and (= |c_#valid| (store (store .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| 1)) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= 0 (select .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|))))) is different from true [2018-04-10 15:54:57,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:57,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:57,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:57,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:57,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2018-04-10 15:54:57,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2018-04-10 15:54:57,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-04-10 15:54:57,836 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:57,841 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:57,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:54:57,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:54:57,852 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:31, output treesize:33 [2018-04-10 15:54:57,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:54:57,940 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:57,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 15:54:57,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 15:54:57,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 15:54:57,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=15, Unknown=3, NotChecked=24, Total=56 [2018-04-10 15:54:57,941 INFO L87 Difference]: Start difference. First operand 568 states and 596 transitions. Second operand 8 states. [2018-04-10 15:54:58,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:58,031 INFO L93 Difference]: Finished difference Result 587 states and 616 transitions. [2018-04-10 15:54:58,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 15:54:58,031 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 196 [2018-04-10 15:54:58,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:58,033 INFO L225 Difference]: With dead ends: 587 [2018-04-10 15:54:58,033 INFO L226 Difference]: Without dead ends: 587 [2018-04-10 15:54:58,033 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=15, Unknown=3, NotChecked=24, Total=56 [2018-04-10 15:54:58,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-04-10 15:54:58,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 570. [2018-04-10 15:54:58,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-04-10 15:54:58,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 599 transitions. [2018-04-10 15:54:58,036 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 599 transitions. Word has length 196 [2018-04-10 15:54:58,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:58,037 INFO L459 AbstractCegarLoop]: Abstraction has 570 states and 599 transitions. [2018-04-10 15:54:58,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 15:54:58,037 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 599 transitions. [2018-04-10 15:54:58,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-04-10 15:54:58,038 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:58,038 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:54:58,038 INFO L408 AbstractCegarLoop]: === Iteration 45 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:54:58,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1741375921, now seen corresponding path program 1 times [2018-04-10 15:54:58,038 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:58,038 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:58,038 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:58,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:58,039 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:58,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:58,070 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:54:58,071 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:58,071 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:58,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:58,132 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:58,162 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|) 0) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80)))) is different from true [2018-04-10 15:54:58,232 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|) 0) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| 16)))) is different from true [2018-04-10 15:54:58,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:58,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-04-10 15:54:58,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:58,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:58,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 42 [2018-04-10 15:54:58,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 46 [2018-04-10 15:54:58,282 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-10 15:54:58,324 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:54:58,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:54:58,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:58,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:58,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:58,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:54:58,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 30 [2018-04-10 15:54:58,363 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:54:58,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 15:54:58,380 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:78 [2018-04-10 15:54:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:54:58,528 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:54:58,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-10 15:54:58,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 15:54:58,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 15:54:58,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=56, Unknown=3, NotChecked=30, Total=110 [2018-04-10 15:54:58,529 INFO L87 Difference]: Start difference. First operand 570 states and 599 transitions. Second operand 11 states. [2018-04-10 15:55:02,874 WARN L148 SmtUtils]: Spent 4258ms on a formula simplification that was a NOOP. DAG size: 46 [2018-04-10 15:55:03,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:03,029 INFO L93 Difference]: Finished difference Result 586 states and 615 transitions. [2018-04-10 15:55:03,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-10 15:55:03,029 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 196 [2018-04-10 15:55:03,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:03,030 INFO L225 Difference]: With dead ends: 586 [2018-04-10 15:55:03,030 INFO L226 Difference]: Without dead ends: 586 [2018-04-10 15:55:03,030 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=57, Invalid=156, Unknown=5, NotChecked=54, Total=272 [2018-04-10 15:55:03,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2018-04-10 15:55:03,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 564. [2018-04-10 15:55:03,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2018-04-10 15:55:03,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 592 transitions. [2018-04-10 15:55:03,034 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 592 transitions. Word has length 196 [2018-04-10 15:55:03,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:03,034 INFO L459 AbstractCegarLoop]: Abstraction has 564 states and 592 transitions. [2018-04-10 15:55:03,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 15:55:03,034 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 592 transitions. [2018-04-10 15:55:03,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-04-10 15:55:03,035 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:03,035 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:55:03,035 INFO L408 AbstractCegarLoop]: === Iteration 46 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:03,035 INFO L82 PathProgramCache]: Analyzing trace with hash 212931943, now seen corresponding path program 1 times [2018-04-10 15:55:03,035 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:03,036 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:03,036 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:03,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:03,036 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:03,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:03,055 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:55:03,055 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:55:03,055 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:55:03,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:03,161 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:55:03,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:03,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:03,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:03,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 15:55:03,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:55:03,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:03,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:03,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:03,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:03,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-04-10 15:55:03,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:55:03,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:03,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:03,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:03,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:03,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:151, output treesize:163 [2018-04-10 15:55:03,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 238 treesize of output 230 [2018-04-10 15:55:03,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 238 [2018-04-10 15:55:03,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:03,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:03,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 216 treesize of output 208 [2018-04-10 15:55:03,799 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:03,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:03,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 11 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:03,995 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:251, output treesize:508 [2018-04-10 15:55:04,349 WARN L151 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 98 DAG size of output 54 [2018-04-10 15:55:04,353 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:04,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:04,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:04,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:04,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 122 [2018-04-10 15:55:04,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:04,388 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:04,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:04,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:04,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:04,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 124 [2018-04-10 15:55:04,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 103 [2018-04-10 15:55:04,405 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:04,432 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:04,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:04,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 303 treesize of output 195 [2018-04-10 15:55:04,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 15:55:04,533 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:04,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 121 [2018-04-10 15:55:04,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2018-04-10 15:55:04,572 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:04,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 43 [2018-04-10 15:55:04,574 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:04,589 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:04,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 106 [2018-04-10 15:55:04,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2018-04-10 15:55:04,613 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:04,629 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:04,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 106 [2018-04-10 15:55:04,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-10 15:55:04,633 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:04,643 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:04,649 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:04,655 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:04,661 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:04,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:04,677 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 15 variables, input treesize:532, output treesize:117 [2018-04-10 15:55:04,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-04-10 15:55:04,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 15:55:04,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:04,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 15:55:04,741 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:04,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:04,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:04,755 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:131, output treesize:103 [2018-04-10 15:55:04,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 57 [2018-04-10 15:55:04,797 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:04,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2018-04-10 15:55:04,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:04,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-04-10 15:55:04,807 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:04,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:04,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:04,826 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:110, output treesize:45 [2018-04-10 15:55:05,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:55:05,048 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:55:05,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-04-10 15:55:05,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 15:55:05,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 15:55:05,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=408, Unknown=8, NotChecked=0, Total=462 [2018-04-10 15:55:05,048 INFO L87 Difference]: Start difference. First operand 564 states and 592 transitions. Second operand 22 states. [2018-04-10 15:55:07,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:07,042 INFO L93 Difference]: Finished difference Result 609 states and 645 transitions. [2018-04-10 15:55:07,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 15:55:07,043 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 196 [2018-04-10 15:55:07,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:07,044 INFO L225 Difference]: With dead ends: 609 [2018-04-10 15:55:07,044 INFO L226 Difference]: Without dead ends: 609 [2018-04-10 15:55:07,044 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=78, Invalid=666, Unknown=12, NotChecked=0, Total=756 [2018-04-10 15:55:07,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2018-04-10 15:55:07,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 582. [2018-04-10 15:55:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-04-10 15:55:07,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 615 transitions. [2018-04-10 15:55:07,048 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 615 transitions. Word has length 196 [2018-04-10 15:55:07,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:07,048 INFO L459 AbstractCegarLoop]: Abstraction has 582 states and 615 transitions. [2018-04-10 15:55:07,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 15:55:07,048 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 615 transitions. [2018-04-10 15:55:07,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-04-10 15:55:07,049 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:07,049 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:55:07,049 INFO L408 AbstractCegarLoop]: === Iteration 47 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:07,049 INFO L82 PathProgramCache]: Analyzing trace with hash 212931944, now seen corresponding path program 1 times [2018-04-10 15:55:07,049 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:07,049 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:07,050 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:07,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:07,050 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:07,064 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:07,087 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:55:07,087 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:55:07,088 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:55:07,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:07,159 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:55:07,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:07,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:07,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:07,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 15:55:07,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:07,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:07,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:07,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-04-10 15:55:07,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-04-10 15:55:07,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:07,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:07,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:18 [2018-04-10 15:55:07,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:55:07,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:07,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:07,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:07,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:55:07,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:07,377 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:07,381 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:07,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:07,398 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:50 [2018-04-10 15:55:07,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 49 [2018-04-10 15:55:07,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-04-10 15:55:07,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:07,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:07,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 39 [2018-04-10 15:55:07,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 41 [2018-04-10 15:55:07,518 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:07,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-10 15:55:07,537 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:07,549 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:07,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:07,569 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:69, output treesize:169 [2018-04-10 15:55:07,609 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 15:55:07,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:07,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:07,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:07,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2018-04-10 15:55:07,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:07,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:07,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:185, output treesize:93 [2018-04-10 15:55:07,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:07,716 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:07,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 88 [2018-04-10 15:55:07,722 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:07,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-04-10 15:55:07,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:07,738 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:07,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2018-04-10 15:55:07,739 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:07,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:07,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2018-04-10 15:55:07,786 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:07,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-04-10 15:55:07,786 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:07,802 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:07,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-10 15:55:07,802 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:07,810 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:07,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:07,822 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:125, output treesize:14 [2018-04-10 15:55:07,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:55:07,941 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:55:07,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-04-10 15:55:07,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 15:55:07,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 15:55:07,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-04-10 15:55:07,942 INFO L87 Difference]: Start difference. First operand 582 states and 615 transitions. Second operand 20 states. [2018-04-10 15:55:08,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:08,830 INFO L93 Difference]: Finished difference Result 653 states and 699 transitions. [2018-04-10 15:55:08,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 15:55:08,830 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 196 [2018-04-10 15:55:08,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:08,832 INFO L225 Difference]: With dead ends: 653 [2018-04-10 15:55:08,832 INFO L226 Difference]: Without dead ends: 653 [2018-04-10 15:55:08,832 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2018-04-10 15:55:08,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-04-10 15:55:08,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 591. [2018-04-10 15:55:08,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-04-10 15:55:08,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 632 transitions. [2018-04-10 15:55:08,837 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 632 transitions. Word has length 196 [2018-04-10 15:55:08,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:08,837 INFO L459 AbstractCegarLoop]: Abstraction has 591 states and 632 transitions. [2018-04-10 15:55:08,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 15:55:08,837 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 632 transitions. [2018-04-10 15:55:08,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-04-10 15:55:08,838 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:08,838 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:55:08,838 INFO L408 AbstractCegarLoop]: === Iteration 48 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:08,838 INFO L82 PathProgramCache]: Analyzing trace with hash -996742439, now seen corresponding path program 1 times [2018-04-10 15:55:08,838 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:08,838 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:08,839 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:08,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:08,839 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:08,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:08,858 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:55:08,858 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:55:08,859 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:55:08,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:08,886 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:55:08,892 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1)) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0))) is different from true [2018-04-10 15:55:08,895 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (let ((.cse0 (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1))) (and (= |c_#valid| (store .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1)) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= 0 (select .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|))))) is different from true [2018-04-10 15:55:08,984 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (let ((.cse0 (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1))) (and (= |c_#valid| (store (store .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| 1)) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= 0 (select .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|))))) is different from true [2018-04-10 15:55:09,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:09,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:09,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:09,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:09,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2018-04-10 15:55:09,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2018-04-10 15:55:09,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-04-10 15:55:09,010 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:09,016 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:09,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:09,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:09,028 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:31, output treesize:33 [2018-04-10 15:55:09,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:55:09,119 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:55:09,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 15:55:09,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 15:55:09,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 15:55:09,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=15, Unknown=3, NotChecked=24, Total=56 [2018-04-10 15:55:09,119 INFO L87 Difference]: Start difference. First operand 591 states and 632 transitions. Second operand 8 states. [2018-04-10 15:55:09,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:09,235 INFO L93 Difference]: Finished difference Result 632 states and 677 transitions. [2018-04-10 15:55:09,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 15:55:09,235 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 198 [2018-04-10 15:55:09,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:09,236 INFO L225 Difference]: With dead ends: 632 [2018-04-10 15:55:09,236 INFO L226 Difference]: Without dead ends: 632 [2018-04-10 15:55:09,236 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=15, Unknown=3, NotChecked=24, Total=56 [2018-04-10 15:55:09,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-04-10 15:55:09,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 606. [2018-04-10 15:55:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-04-10 15:55:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 648 transitions. [2018-04-10 15:55:09,240 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 648 transitions. Word has length 198 [2018-04-10 15:55:09,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:09,240 INFO L459 AbstractCegarLoop]: Abstraction has 606 states and 648 transitions. [2018-04-10 15:55:09,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 15:55:09,240 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 648 transitions. [2018-04-10 15:55:09,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-04-10 15:55:09,240 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:09,240 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:55:09,241 INFO L408 AbstractCegarLoop]: === Iteration 49 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:09,241 INFO L82 PathProgramCache]: Analyzing trace with hash -996742438, now seen corresponding path program 1 times [2018-04-10 15:55:09,241 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:09,241 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:09,241 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:09,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:09,241 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:09,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:09,266 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:55:09,266 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:55:09,266 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:55:09,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:09,296 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:55:09,452 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (let ((.cse0 (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1))) (and (<= (select (store .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base|) 0) (<= (select .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|) 0) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| 16))))) is different from true [2018-04-10 15:55:09,473 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:09,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-04-10 15:55:09,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:09,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:09,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 42 [2018-04-10 15:55:09,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:09,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:09,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:09,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-04-10 15:55:09,492 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:09,504 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:09,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:09,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:09,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:09,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:09,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:09,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:09,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:09,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:09,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 63 [2018-04-10 15:55:09,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:09,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:09,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:09,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:09,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:09,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:09,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:09,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:09,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 50 [2018-04-10 15:55:09,546 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:09,551 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:09,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:09,559 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2018-04-10 15:55:09,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:55:09,688 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:55:09,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 15:55:09,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 15:55:09,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 15:55:09,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=4, NotChecked=14, Total=90 [2018-04-10 15:55:09,689 INFO L87 Difference]: Start difference. First operand 606 states and 648 transitions. Second operand 10 states. [2018-04-10 15:55:10,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:10,065 INFO L93 Difference]: Finished difference Result 613 states and 651 transitions. [2018-04-10 15:55:10,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 15:55:10,065 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 198 [2018-04-10 15:55:10,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:10,066 INFO L225 Difference]: With dead ends: 613 [2018-04-10 15:55:10,067 INFO L226 Difference]: Without dead ends: 613 [2018-04-10 15:55:10,067 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=4, NotChecked=20, Total=156 [2018-04-10 15:55:10,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-04-10 15:55:10,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 605. [2018-04-10 15:55:10,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-04-10 15:55:10,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 644 transitions. [2018-04-10 15:55:10,072 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 644 transitions. Word has length 198 [2018-04-10 15:55:10,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:10,072 INFO L459 AbstractCegarLoop]: Abstraction has 605 states and 644 transitions. [2018-04-10 15:55:10,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 15:55:10,072 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 644 transitions. [2018-04-10 15:55:10,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-04-10 15:55:10,073 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:10,073 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:55:10,073 INFO L408 AbstractCegarLoop]: === Iteration 50 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:10,073 INFO L82 PathProgramCache]: Analyzing trace with hash -91769048, now seen corresponding path program 1 times [2018-04-10 15:55:10,073 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:10,073 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:10,073 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:10,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:10,074 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:10,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:10,091 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:55:10,091 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:55:10,091 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:55:10,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:10,129 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:55:10,151 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1)) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0))) is different from true [2018-04-10 15:55:10,154 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1)) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0))) is different from true [2018-04-10 15:55:10,236 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store (store (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| 1)) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0))) is different from true [2018-04-10 15:55:10,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:10,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:10,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-04-10 15:55:10,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-04-10 15:55:10,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-10 15:55:10,257 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:10,263 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:10,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:10,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:10,272 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:23, output treesize:25 [2018-04-10 15:55:10,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:55:10,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:55:10,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 15:55:10,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 15:55:10,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 15:55:10,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=22, Unknown=4, NotChecked=30, Total=72 [2018-04-10 15:55:10,348 INFO L87 Difference]: Start difference. First operand 605 states and 644 transitions. Second operand 9 states. [2018-04-10 15:55:10,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:10,503 INFO L93 Difference]: Finished difference Result 610 states and 649 transitions. [2018-04-10 15:55:10,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 15:55:10,503 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 200 [2018-04-10 15:55:10,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:10,504 INFO L225 Difference]: With dead ends: 610 [2018-04-10 15:55:10,504 INFO L226 Difference]: Without dead ends: 610 [2018-04-10 15:55:10,504 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=22, Unknown=4, NotChecked=30, Total=72 [2018-04-10 15:55:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-04-10 15:55:10,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 607. [2018-04-10 15:55:10,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-04-10 15:55:10,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 646 transitions. [2018-04-10 15:55:10,509 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 646 transitions. Word has length 200 [2018-04-10 15:55:10,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:10,509 INFO L459 AbstractCegarLoop]: Abstraction has 607 states and 646 transitions. [2018-04-10 15:55:10,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 15:55:10,510 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 646 transitions. [2018-04-10 15:55:10,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-04-10 15:55:10,510 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:10,511 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:55:10,511 INFO L408 AbstractCegarLoop]: === Iteration 51 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:10,511 INFO L82 PathProgramCache]: Analyzing trace with hash -91769047, now seen corresponding path program 1 times [2018-04-10 15:55:10,511 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:10,511 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:10,512 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:10,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:10,512 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:10,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:10,542 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:55:10,542 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:55:10,542 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:55:10,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:10,585 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:55:10,628 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|) 0) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80)))) is different from true [2018-04-10 15:55:10,709 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|) 0) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| 16)))) is different from true [2018-04-10 15:55:10,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:10,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:10,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:10,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:10,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 30 [2018-04-10 15:55:10,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:10,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-04-10 15:55:10,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:10,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 42 [2018-04-10 15:55:10,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 46 [2018-04-10 15:55:10,769 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-04-10 15:55:10,794 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:55:10,807 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:55:10,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:10,824 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:78 [2018-04-10 15:55:10,939 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 47 DAG size of output 43 [2018-04-10 15:55:11,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:55:11,044 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:55:11,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-10 15:55:11,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 15:55:11,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 15:55:11,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=56, Unknown=3, NotChecked=30, Total=110 [2018-04-10 15:55:11,044 INFO L87 Difference]: Start difference. First operand 607 states and 646 transitions. Second operand 11 states. [2018-04-10 15:55:11,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:11,473 INFO L93 Difference]: Finished difference Result 630 states and 673 transitions. [2018-04-10 15:55:11,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-10 15:55:11,473 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 200 [2018-04-10 15:55:11,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:11,474 INFO L225 Difference]: With dead ends: 630 [2018-04-10 15:55:11,475 INFO L226 Difference]: Without dead ends: 630 [2018-04-10 15:55:11,475 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=156, Unknown=5, NotChecked=54, Total=272 [2018-04-10 15:55:11,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2018-04-10 15:55:11,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 590. [2018-04-10 15:55:11,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-04-10 15:55:11,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 628 transitions. [2018-04-10 15:55:11,478 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 628 transitions. Word has length 200 [2018-04-10 15:55:11,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:11,479 INFO L459 AbstractCegarLoop]: Abstraction has 590 states and 628 transitions. [2018-04-10 15:55:11,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 15:55:11,479 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 628 transitions. [2018-04-10 15:55:11,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-04-10 15:55:11,479 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:11,480 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 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-10 15:55:11,480 INFO L408 AbstractCegarLoop]: === Iteration 52 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:11,480 INFO L82 PathProgramCache]: Analyzing trace with hash 151782073, now seen corresponding path program 1 times [2018-04-10 15:55:11,480 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:11,480 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:11,480 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:11,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:11,480 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:11,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:11,503 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:55:11,503 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:55:11,503 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:55:11,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:11,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:55:11,545 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |c_#length|))) is different from true [2018-04-10 15:55:11,547 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80)))) is different from true [2018-04-10 15:55:11,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:11,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23 [2018-04-10 15:55:11,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:11,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 19 treesize of output 33 [2018-04-10 15:55:11,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-10 15:55:11,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:55:11,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:11,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:11,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-10 15:55:11,665 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:11,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:11,682 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:33, output treesize:52 [2018-04-10 15:55:11,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1376 trivial. 0 not checked. [2018-04-10 15:55:11,866 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:55:11,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 15:55:11,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 15:55:11,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 15:55:11,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=43, Unknown=2, NotChecked=26, Total=90 [2018-04-10 15:55:11,867 INFO L87 Difference]: Start difference. First operand 590 states and 628 transitions. Second operand 10 states. [2018-04-10 15:55:12,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:12,095 INFO L93 Difference]: Finished difference Result 593 states and 630 transitions. [2018-04-10 15:55:12,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 15:55:12,095 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 201 [2018-04-10 15:55:12,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:12,096 INFO L225 Difference]: With dead ends: 593 [2018-04-10 15:55:12,096 INFO L226 Difference]: Without dead ends: 593 [2018-04-10 15:55:12,096 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=117, Unknown=2, NotChecked=46, Total=210 [2018-04-10 15:55:12,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-04-10 15:55:12,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 582. [2018-04-10 15:55:12,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-04-10 15:55:12,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 619 transitions. [2018-04-10 15:55:12,105 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 619 transitions. Word has length 201 [2018-04-10 15:55:12,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:12,106 INFO L459 AbstractCegarLoop]: Abstraction has 582 states and 619 transitions. [2018-04-10 15:55:12,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 15:55:12,106 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 619 transitions. [2018-04-10 15:55:12,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-04-10 15:55:12,107 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:12,107 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:55:12,107 INFO L408 AbstractCegarLoop]: === Iteration 53 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:12,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1313914853, now seen corresponding path program 1 times [2018-04-10 15:55:12,107 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:12,107 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:12,108 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:12,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:12,108 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:12,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:55:12,166 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:55:12,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 15:55:12,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 15:55:12,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 15:55:12,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 15:55:12,166 INFO L87 Difference]: Start difference. First operand 582 states and 619 transitions. Second operand 3 states. [2018-04-10 15:55:12,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:12,171 INFO L93 Difference]: Finished difference Result 584 states and 621 transitions. [2018-04-10 15:55:12,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 15:55:12,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2018-04-10 15:55:12,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:12,173 INFO L225 Difference]: With dead ends: 584 [2018-04-10 15:55:12,173 INFO L226 Difference]: Without dead ends: 584 [2018-04-10 15:55:12,173 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-10 15:55:12,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-04-10 15:55:12,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2018-04-10 15:55:12,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-04-10 15:55:12,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 621 transitions. [2018-04-10 15:55:12,180 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 621 transitions. Word has length 202 [2018-04-10 15:55:12,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:12,180 INFO L459 AbstractCegarLoop]: Abstraction has 584 states and 621 transitions. [2018-04-10 15:55:12,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 15:55:12,180 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 621 transitions. [2018-04-10 15:55:12,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-04-10 15:55:12,181 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:12,181 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 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-10 15:55:12,181 INFO L408 AbstractCegarLoop]: === Iteration 54 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:12,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1479875411, now seen corresponding path program 1 times [2018-04-10 15:55:12,181 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:12,182 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:12,182 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:12,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:12,182 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:12,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:12,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:55:12,265 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:55:12,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 15:55:12,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:55:12,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:55:12,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:55:12,266 INFO L87 Difference]: Start difference. First operand 584 states and 621 transitions. Second operand 5 states. [2018-04-10 15:55:12,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:12,294 INFO L93 Difference]: Finished difference Result 662 states and 717 transitions. [2018-04-10 15:55:12,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:55:12,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2018-04-10 15:55:12,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:12,296 INFO L225 Difference]: With dead ends: 662 [2018-04-10 15:55:12,296 INFO L226 Difference]: Without dead ends: 662 [2018-04-10 15:55:12,296 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-10 15:55:12,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2018-04-10 15:55:12,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 590. [2018-04-10 15:55:12,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-04-10 15:55:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 627 transitions. [2018-04-10 15:55:12,301 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 627 transitions. Word has length 203 [2018-04-10 15:55:12,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:12,302 INFO L459 AbstractCegarLoop]: Abstraction has 590 states and 627 transitions. [2018-04-10 15:55:12,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:55:12,302 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 627 transitions. [2018-04-10 15:55:12,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-04-10 15:55:12,302 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:12,303 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:55:12,303 INFO L408 AbstractCegarLoop]: === Iteration 55 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:12,303 INFO L82 PathProgramCache]: Analyzing trace with hash 461092509, now seen corresponding path program 1 times [2018-04-10 15:55:12,303 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:12,303 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:12,303 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:12,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:12,304 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:12,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:12,341 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:55:12,341 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:55:12,341 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:55:12,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:12,421 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:55:12,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:12,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:12,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:12,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 15:55:12,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:55:12,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:12,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:12,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:12,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:12,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-04-10 15:55:12,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:55:12,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:12,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:12,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:12,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 32 [2018-04-10 15:55:12,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 34 [2018-04-10 15:55:12,580 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 15:55:12,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-04-10 15:55:12,603 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:12,612 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:55:12,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:12,624 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:48, output treesize:87 [2018-04-10 15:55:12,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:12,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:12,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-04-10 15:55:12,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:12,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:12,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:103, output treesize:48 [2018-04-10 15:55:12,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-04-10 15:55:12,700 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:12,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-04-10 15:55:12,700 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:12,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:12,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:12,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:46 [2018-04-10 15:55:12,732 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:12,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2018-04-10 15:55:12,735 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:12,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2018-04-10 15:55:12,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:12,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-04-10 15:55:12,740 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:12,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:12,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:12,746 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:53, output treesize:4 [2018-04-10 15:55:12,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:55:12,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:55:12,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-04-10 15:55:12,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 15:55:12,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 15:55:12,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-04-10 15:55:12,793 INFO L87 Difference]: Start difference. First operand 590 states and 627 transitions. Second operand 18 states. [2018-04-10 15:55:13,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:13,456 INFO L93 Difference]: Finished difference Result 632 states and 668 transitions. [2018-04-10 15:55:13,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 15:55:13,456 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 202 [2018-04-10 15:55:13,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:13,457 INFO L225 Difference]: With dead ends: 632 [2018-04-10 15:55:13,458 INFO L226 Difference]: Without dead ends: 632 [2018-04-10 15:55:13,458 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2018-04-10 15:55:13,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-04-10 15:55:13,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 587. [2018-04-10 15:55:13,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-04-10 15:55:13,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 622 transitions. [2018-04-10 15:55:13,462 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 622 transitions. Word has length 202 [2018-04-10 15:55:13,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:13,462 INFO L459 AbstractCegarLoop]: Abstraction has 587 states and 622 transitions. [2018-04-10 15:55:13,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 15:55:13,462 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 622 transitions. [2018-04-10 15:55:13,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-04-10 15:55:13,463 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:13,463 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:55:13,463 INFO L408 AbstractCegarLoop]: === Iteration 56 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:13,463 INFO L82 PathProgramCache]: Analyzing trace with hash 855517531, now seen corresponding path program 1 times [2018-04-10 15:55:13,463 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:13,464 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:13,464 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:13,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:13,464 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:13,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:13,489 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:55:13,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:55:13,489 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:55:13,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:13,551 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:55:13,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:13,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:13,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:13,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 15:55:13,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:55:13,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:13,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:13,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:13,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:13,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-10 15:55:13,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 15:55:13,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:13,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:13,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-04-10 15:55:13,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:55:13,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:13,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:13,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:13,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:13,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-04-10 15:55:13,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-04-10 15:55:13,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2018-04-10 15:55:13,791 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:13,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-10 15:55:13,817 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:13,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:13,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:55:13,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:13,857 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:13,859 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:13,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:13,879 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:43, output treesize:65 [2018-04-10 15:55:13,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:13,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:13,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-04-10 15:55:13,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:13,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-10 15:55:13,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 15:55:13,973 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:13,974 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:13,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:13,983 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:95, output treesize:38 [2018-04-10 15:55:14,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 15:55:14,014 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:14,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 15:55:14,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:14,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:14,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:14,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:41 [2018-04-10 15:55:14,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:14,057 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:14,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2018-04-10 15:55:14,062 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:14,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-10 15:55:14,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:14,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-04-10 15:55:14,126 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:14,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:14,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:14,135 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:48, output treesize:5 [2018-04-10 15:55:14,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:55:14,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:55:14,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-04-10 15:55:14,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 15:55:14,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 15:55:14,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-04-10 15:55:14,181 INFO L87 Difference]: Start difference. First operand 587 states and 622 transitions. Second operand 18 states. [2018-04-10 15:55:14,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:14,903 INFO L93 Difference]: Finished difference Result 604 states and 638 transitions. [2018-04-10 15:55:14,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 15:55:14,903 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 205 [2018-04-10 15:55:14,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:14,904 INFO L225 Difference]: With dead ends: 604 [2018-04-10 15:55:14,904 INFO L226 Difference]: Without dead ends: 604 [2018-04-10 15:55:14,905 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2018-04-10 15:55:14,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2018-04-10 15:55:14,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 579. [2018-04-10 15:55:14,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-04-10 15:55:14,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 612 transitions. [2018-04-10 15:55:14,908 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 612 transitions. Word has length 205 [2018-04-10 15:55:14,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:14,908 INFO L459 AbstractCegarLoop]: Abstraction has 579 states and 612 transitions. [2018-04-10 15:55:14,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 15:55:14,908 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 612 transitions. [2018-04-10 15:55:14,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-04-10 15:55:14,909 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:14,909 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 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] [2018-04-10 15:55:14,909 INFO L408 AbstractCegarLoop]: === Iteration 57 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:14,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1535851879, now seen corresponding path program 1 times [2018-04-10 15:55:14,909 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:14,909 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:14,909 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:14,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:14,910 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:14,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:14,939 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:55:14,939 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:55:14,939 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:55:14,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:15,006 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:55:15,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:15,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:15,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:15,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 15:55:15,057 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1)) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0))) is different from true [2018-04-10 15:55:15,060 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (let ((.cse0 (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1))) (and (= |c_#valid| (store .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1)) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= 0 (select .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|))))) is different from true [2018-04-10 15:55:15,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:15,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:15,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:15,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:15,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 62 [2018-04-10 15:55:15,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:15,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:15,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:15,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:15,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:15,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2018-04-10 15:55:15,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 51 [2018-04-10 15:55:15,287 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:15,297 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:15,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:15,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:15,319 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:50, output treesize:53 [2018-04-10 15:55:15,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:15,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 15:55:15,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:15,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:15,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:15,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:15,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:15,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:15,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-04-10 15:55:15,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:15,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:15,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:64, output treesize:18 [2018-04-10 15:55:15,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:55:15,530 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:55:15,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-10 15:55:15,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 15:55:15,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 15:55:15,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=129, Unknown=5, NotChecked=46, Total=210 [2018-04-10 15:55:15,531 INFO L87 Difference]: Start difference. First operand 579 states and 612 transitions. Second operand 15 states. [2018-04-10 15:55:16,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:16,145 INFO L93 Difference]: Finished difference Result 703 states and 777 transitions. [2018-04-10 15:55:16,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 15:55:16,145 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 207 [2018-04-10 15:55:16,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:16,147 INFO L225 Difference]: With dead ends: 703 [2018-04-10 15:55:16,147 INFO L226 Difference]: Without dead ends: 703 [2018-04-10 15:55:16,147 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=221, Unknown=7, NotChecked=62, Total=342 [2018-04-10 15:55:16,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2018-04-10 15:55:16,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 648. [2018-04-10 15:55:16,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-04-10 15:55:16,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 712 transitions. [2018-04-10 15:55:16,152 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 712 transitions. Word has length 207 [2018-04-10 15:55:16,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:16,153 INFO L459 AbstractCegarLoop]: Abstraction has 648 states and 712 transitions. [2018-04-10 15:55:16,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 15:55:16,153 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 712 transitions. [2018-04-10 15:55:16,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-04-10 15:55:16,154 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:16,154 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:55:16,154 INFO L408 AbstractCegarLoop]: === Iteration 58 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:16,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1112563363, now seen corresponding path program 1 times [2018-04-10 15:55:16,155 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:16,155 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:16,155 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:16,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:16,155 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:16,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:16,195 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:55:16,195 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:55:16,195 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:55:16,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:16,315 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:55:16,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:16,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:16,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:16,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:16,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:16,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 15:55:16,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:55:16,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:16,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:16,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:16,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:55:16,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:16,351 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:16,352 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:16,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:16,357 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-04-10 15:55:16,549 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.offset| Int)) (= (store |c_old(#memory_$Pointer$.offset)| c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base (store (select |c_old(#memory_$Pointer$.offset)| c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base) (+ c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.offset 4) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.offset|)) |c_#memory_$Pointer$.offset|)) (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base (store (select |c_old(#memory_$Pointer$.base)| c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base) (+ c___U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.offset 4) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|))) (= 0 (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|)) (= |c_#length| (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80)) (= 0 (select (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|))))) is different from true [2018-04-10 15:55:17,476 WARN L151 SmtUtils]: Spent 351ms on a formula simplification. DAG size of input: 96 DAG size of output 94 [2018-04-10 15:55:17,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:17,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:17,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:17,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-04-10 15:55:17,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:17,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:17,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:17,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:17,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-04-10 15:55:17,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:17,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:17,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:17,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:17,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:17,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:17,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:17,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 55 [2018-04-10 15:55:17,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:17,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:17,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:17,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:17,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:17,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:17,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2018-04-10 15:55:17,649 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:17,724 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:17,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:17,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 30 [2018-04-10 15:55:17,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:17,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:17,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 52 [2018-04-10 15:55:17,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:17,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:17,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:17,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 81 [2018-04-10 15:55:17,935 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:18,055 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:18,091 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:18,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:18,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 107 [2018-04-10 15:55:18,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:18,321 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:18,408 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:18,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:18,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:18,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 69 [2018-04-10 15:55:18,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-04-10 15:55:18,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:18,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-10 15:55:18,506 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:18,523 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:18,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:18,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:18,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:18,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 62 [2018-04-10 15:55:18,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-04-10 15:55:18,592 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:18,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:18,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:18,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:18,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 51 treesize of output 101 [2018-04-10 15:55:18,710 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-10 15:55:18,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:18,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:18,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:18,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:18,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 100 [2018-04-10 15:55:18,745 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:19,558 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:19,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-04-10 15:55:19,562 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:19,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:19,776 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:19,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2018-04-10 15:55:19,781 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:20,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-04-10 15:55:20,055 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:20,315 INFO L267 ElimStorePlain]: Start of recursive call 16: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 15:55:20,400 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-10 15:55:20,489 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-10 15:55:20,567 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-10 15:55:20,686 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:20,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 107 [2018-04-10 15:55:20,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:20,728 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:20,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:20,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:20,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:20,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 69 [2018-04-10 15:55:20,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-04-10 15:55:20,785 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:20,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-10 15:55:20,786 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:20,792 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:20,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:20,807 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:20,808 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:20,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 62 [2018-04-10 15:55:20,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-04-10 15:55:20,818 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:20,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:20,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:20,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:20,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 51 treesize of output 101 [2018-04-10 15:55:20,863 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-10 15:55:20,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2018-04-10 15:55:20,874 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:21,065 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:21,065 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:21,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2018-04-10 15:55:21,069 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:21,230 INFO L267 ElimStorePlain]: Start of recursive call 28: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:55:21,252 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:55:21,273 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:55:21,295 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:55:21,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 18 dim-0 vars, and 4 xjuncts. [2018-04-10 15:55:21,360 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 16 variables, input treesize:390, output treesize:405 [2018-04-10 15:55:21,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:21,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2018-04-10 15:55:21,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:21,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-04-10 15:55:21,885 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:21,892 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:21,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-10 15:55:21,892 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:21,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:21,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:21,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-10 15:55:21,916 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:21,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 15:55:21,917 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:21,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 15:55:21,922 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:21,927 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:21,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:21,937 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:111, output treesize:33 [2018-04-10 15:55:22,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:55:22,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:55:22,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-04-10 15:55:22,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 15:55:22,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 15:55:22,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=396, Unknown=21, NotChecked=40, Total=506 [2018-04-10 15:55:22,299 INFO L87 Difference]: Start difference. First operand 648 states and 712 transitions. Second operand 23 states. [2018-04-10 15:55:24,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:24,914 INFO L93 Difference]: Finished difference Result 719 states and 801 transitions. [2018-04-10 15:55:24,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 15:55:24,915 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 206 [2018-04-10 15:55:24,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:24,916 INFO L225 Difference]: With dead ends: 719 [2018-04-10 15:55:24,916 INFO L226 Difference]: Without dead ends: 719 [2018-04-10 15:55:24,916 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=95, Invalid=748, Unknown=31, NotChecked=56, Total=930 [2018-04-10 15:55:24,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-04-10 15:55:24,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 677. [2018-04-10 15:55:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2018-04-10 15:55:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 747 transitions. [2018-04-10 15:55:24,921 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 747 transitions. Word has length 206 [2018-04-10 15:55:24,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:24,921 INFO L459 AbstractCegarLoop]: Abstraction has 677 states and 747 transitions. [2018-04-10 15:55:24,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 15:55:24,921 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 747 transitions. [2018-04-10 15:55:24,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-04-10 15:55:24,922 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:24,922 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:55:24,922 INFO L408 AbstractCegarLoop]: === Iteration 59 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:24,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1112563362, now seen corresponding path program 1 times [2018-04-10 15:55:24,922 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:24,922 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:24,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:24,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:24,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:24,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:55:24,975 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:55:24,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:55:24,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:55:24,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:55:24,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:55:24,976 INFO L87 Difference]: Start difference. First operand 677 states and 747 transitions. Second operand 5 states. [2018-04-10 15:55:25,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:25,077 INFO L93 Difference]: Finished difference Result 691 states and 762 transitions. [2018-04-10 15:55:25,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 15:55:25,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 206 [2018-04-10 15:55:25,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:25,078 INFO L225 Difference]: With dead ends: 691 [2018-04-10 15:55:25,078 INFO L226 Difference]: Without dead ends: 691 [2018-04-10 15:55:25,078 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-10 15:55:25,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2018-04-10 15:55:25,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 682. [2018-04-10 15:55:25,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2018-04-10 15:55:25,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 753 transitions. [2018-04-10 15:55:25,083 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 753 transitions. Word has length 206 [2018-04-10 15:55:25,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:25,083 INFO L459 AbstractCegarLoop]: Abstraction has 682 states and 753 transitions. [2018-04-10 15:55:25,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:55:25,083 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 753 transitions. [2018-04-10 15:55:25,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-04-10 15:55:25,084 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:25,084 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:55:25,084 INFO L408 AbstractCegarLoop]: === Iteration 60 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:25,084 INFO L82 PathProgramCache]: Analyzing trace with hash -274385153, now seen corresponding path program 1 times [2018-04-10 15:55:25,084 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:25,084 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:25,085 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:25,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:25,085 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:25,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:55:25,183 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:55:25,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 15:55:25,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 15:55:25,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 15:55:25,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-10 15:55:25,184 INFO L87 Difference]: Start difference. First operand 682 states and 753 transitions. Second operand 8 states. [2018-04-10 15:55:25,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:25,292 INFO L93 Difference]: Finished difference Result 700 states and 769 transitions. [2018-04-10 15:55:25,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 15:55:25,293 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 208 [2018-04-10 15:55:25,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:25,294 INFO L225 Difference]: With dead ends: 700 [2018-04-10 15:55:25,294 INFO L226 Difference]: Without dead ends: 700 [2018-04-10 15:55:25,294 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-04-10 15:55:25,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2018-04-10 15:55:25,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 682. [2018-04-10 15:55:25,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2018-04-10 15:55:25,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 751 transitions. [2018-04-10 15:55:25,298 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 751 transitions. Word has length 208 [2018-04-10 15:55:25,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:25,299 INFO L459 AbstractCegarLoop]: Abstraction has 682 states and 751 transitions. [2018-04-10 15:55:25,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 15:55:25,299 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 751 transitions. [2018-04-10 15:55:25,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-04-10 15:55:25,299 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:25,299 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 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-10 15:55:25,300 INFO L408 AbstractCegarLoop]: === Iteration 61 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:25,300 INFO L82 PathProgramCache]: Analyzing trace with hash 841401545, now seen corresponding path program 1 times [2018-04-10 15:55:25,300 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:25,300 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:25,300 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:25,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:25,300 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:25,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:25,316 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:55:25,317 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:55:25,317 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:55:25,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:25,349 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:55:25,368 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base Int)) (= |c_#valid| (store |c_old(#valid)| __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base 1))) is different from true [2018-04-10 15:55:25,369 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base Int)) (let ((.cse0 (store |c_old(#valid)| __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base 1))) (and (= 0 (select .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|)) (= |c_#valid| (store .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1))))) is different from true [2018-04-10 15:55:25,420 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base Int)) (let ((.cse0 (store |c_old(#valid)| __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_~data~0.base 1))) (and (= |c_#valid| (store (store .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| 1)) (= 0 (select .cse0 |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|))))) is different from true [2018-04-10 15:55:25,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:25,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:25,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-04-10 15:55:25,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-04-10 15:55:25,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-10 15:55:25,438 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:25,442 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:25,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:25,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:25,450 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:29 [2018-04-10 15:55:25,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1376 trivial. 0 not checked. [2018-04-10 15:55:25,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:55:25,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 15:55:25,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 15:55:25,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 15:55:25,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=23, Unknown=3, NotChecked=30, Total=72 [2018-04-10 15:55:25,567 INFO L87 Difference]: Start difference. First operand 682 states and 751 transitions. Second operand 9 states. [2018-04-10 15:55:25,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:25,658 INFO L93 Difference]: Finished difference Result 682 states and 750 transitions. [2018-04-10 15:55:25,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 15:55:25,658 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 208 [2018-04-10 15:55:25,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:25,659 INFO L225 Difference]: With dead ends: 682 [2018-04-10 15:55:25,659 INFO L226 Difference]: Without dead ends: 682 [2018-04-10 15:55:25,660 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=23, Unknown=3, NotChecked=30, Total=72 [2018-04-10 15:55:25,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-04-10 15:55:25,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 681. [2018-04-10 15:55:25,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2018-04-10 15:55:25,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 750 transitions. [2018-04-10 15:55:25,665 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 750 transitions. Word has length 208 [2018-04-10 15:55:25,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:25,666 INFO L459 AbstractCegarLoop]: Abstraction has 681 states and 750 transitions. [2018-04-10 15:55:25,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 15:55:25,666 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 750 transitions. [2018-04-10 15:55:25,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-04-10 15:55:25,667 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:25,667 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:55:25,667 INFO L408 AbstractCegarLoop]: === Iteration 62 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:25,667 INFO L82 PathProgramCache]: Analyzing trace with hash 112687780, now seen corresponding path program 1 times [2018-04-10 15:55:25,667 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:25,667 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:25,667 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:25,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:25,668 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:25,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:25,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:55:25,716 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:55:25,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:55:25,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:55:25,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:55:25,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:55:25,717 INFO L87 Difference]: Start difference. First operand 681 states and 750 transitions. Second operand 5 states. [2018-04-10 15:55:25,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:25,806 INFO L93 Difference]: Finished difference Result 687 states and 756 transitions. [2018-04-10 15:55:25,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 15:55:25,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 209 [2018-04-10 15:55:25,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:25,808 INFO L225 Difference]: With dead ends: 687 [2018-04-10 15:55:25,808 INFO L226 Difference]: Without dead ends: 687 [2018-04-10 15:55:25,808 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-10 15:55:25,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-04-10 15:55:25,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 684. [2018-04-10 15:55:25,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2018-04-10 15:55:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 754 transitions. [2018-04-10 15:55:25,815 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 754 transitions. Word has length 209 [2018-04-10 15:55:25,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:25,815 INFO L459 AbstractCegarLoop]: Abstraction has 684 states and 754 transitions. [2018-04-10 15:55:25,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:55:25,815 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 754 transitions. [2018-04-10 15:55:25,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-04-10 15:55:25,816 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:25,816 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:55:25,816 INFO L408 AbstractCegarLoop]: === Iteration 63 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:25,817 INFO L82 PathProgramCache]: Analyzing trace with hash 112687781, now seen corresponding path program 1 times [2018-04-10 15:55:25,817 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:25,817 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:25,817 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:25,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:25,817 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:25,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:26,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:55:26,045 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:55:26,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-10 15:55:26,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 15:55:26,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 15:55:26,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-04-10 15:55:26,046 INFO L87 Difference]: Start difference. First operand 684 states and 754 transitions. Second operand 12 states. [2018-04-10 15:55:26,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:26,286 INFO L93 Difference]: Finished difference Result 712 states and 799 transitions. [2018-04-10 15:55:26,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 15:55:26,287 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 209 [2018-04-10 15:55:26,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:26,288 INFO L225 Difference]: With dead ends: 712 [2018-04-10 15:55:26,288 INFO L226 Difference]: Without dead ends: 712 [2018-04-10 15:55:26,288 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2018-04-10 15:55:26,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2018-04-10 15:55:26,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 684. [2018-04-10 15:55:26,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2018-04-10 15:55:26,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 753 transitions. [2018-04-10 15:55:26,292 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 753 transitions. Word has length 209 [2018-04-10 15:55:26,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:26,292 INFO L459 AbstractCegarLoop]: Abstraction has 684 states and 753 transitions. [2018-04-10 15:55:26,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 15:55:26,293 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 753 transitions. [2018-04-10 15:55:26,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-04-10 15:55:26,293 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:26,293 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 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-10 15:55:26,293 INFO L408 AbstractCegarLoop]: === Iteration 64 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:26,293 INFO L82 PathProgramCache]: Analyzing trace with hash -459337651, now seen corresponding path program 1 times [2018-04-10 15:55:26,294 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:26,294 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:26,294 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:26,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:26,294 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:26,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:26,326 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:55:26,326 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:55:26,326 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:55:26,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:26,392 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:55:26,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:26,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:26,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:26,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 15:55:26,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 15:55:26,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:26,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:26,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-04-10 15:55:26,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:26,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 15:55:26,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:26,441 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:26,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:26,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 15:55:26,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:26,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:26,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-04-10 15:55:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:55:26,471 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:55:26,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-10 15:55:26,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 15:55:26,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 15:55:26,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-04-10 15:55:26,471 INFO L87 Difference]: Start difference. First operand 684 states and 753 transitions. Second operand 12 states. [2018-04-10 15:55:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:26,676 INFO L93 Difference]: Finished difference Result 682 states and 748 transitions. [2018-04-10 15:55:26,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 15:55:26,677 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 211 [2018-04-10 15:55:26,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:26,678 INFO L225 Difference]: With dead ends: 682 [2018-04-10 15:55:26,678 INFO L226 Difference]: Without dead ends: 682 [2018-04-10 15:55:26,678 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-04-10 15:55:26,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-04-10 15:55:26,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 600. [2018-04-10 15:55:26,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-04-10 15:55:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 634 transitions. [2018-04-10 15:55:26,681 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 634 transitions. Word has length 211 [2018-04-10 15:55:26,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:26,681 INFO L459 AbstractCegarLoop]: Abstraction has 600 states and 634 transitions. [2018-04-10 15:55:26,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 15:55:26,682 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 634 transitions. [2018-04-10 15:55:26,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-04-10 15:55:26,682 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:26,682 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 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-10 15:55:26,682 INFO L408 AbstractCegarLoop]: === Iteration 65 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:26,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1133040921, now seen corresponding path program 1 times [2018-04-10 15:55:26,683 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:26,683 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:26,683 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:26,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:26,683 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:26,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:26,701 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:55:26,701 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:55:26,701 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:55:26,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:26,730 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:55:26,754 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |c_#length|))) is different from true [2018-04-10 15:55:26,756 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80)))) is different from true [2018-04-10 15:55:26,797 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| 16)))) is different from true [2018-04-10 15:55:26,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:26,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-04-10 15:55:26,808 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:26,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 39 [2018-04-10 15:55:26,818 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:26,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 31 [2018-04-10 15:55:26,822 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 15:55:26,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:26,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:26,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 50 [2018-04-10 15:55:26,863 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-04-10 15:55:26,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:26,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 36 [2018-04-10 15:55:26,925 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-04-10 15:55:26,945 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 15:55:26,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 15:55:26,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:26,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:26,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-10 15:55:26,980 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:26,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-04-10 15:55:26,996 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:36, output treesize:90 [2018-04-10 15:55:27,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1376 trivial. 0 not checked. [2018-04-10 15:55:27,152 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:55:27,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-10 15:55:27,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 15:55:27,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 15:55:27,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=44, Unknown=3, NotChecked=42, Total=110 [2018-04-10 15:55:27,152 INFO L87 Difference]: Start difference. First operand 600 states and 634 transitions. Second operand 11 states. [2018-04-10 15:55:27,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:27,318 INFO L93 Difference]: Finished difference Result 600 states and 633 transitions. [2018-04-10 15:55:27,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-10 15:55:27,318 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 210 [2018-04-10 15:55:27,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:27,319 INFO L225 Difference]: With dead ends: 600 [2018-04-10 15:55:27,320 INFO L226 Difference]: Without dead ends: 600 [2018-04-10 15:55:27,320 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=134, Unknown=3, NotChecked=78, Total=272 [2018-04-10 15:55:27,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-04-10 15:55:27,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 575. [2018-04-10 15:55:27,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2018-04-10 15:55:27,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 606 transitions. [2018-04-10 15:55:27,323 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 606 transitions. Word has length 210 [2018-04-10 15:55:27,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:27,323 INFO L459 AbstractCegarLoop]: Abstraction has 575 states and 606 transitions. [2018-04-10 15:55:27,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 15:55:27,323 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 606 transitions. [2018-04-10 15:55:27,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-04-10 15:55:27,324 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:27,324 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:55:27,324 INFO L408 AbstractCegarLoop]: === Iteration 66 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:27,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1582508468, now seen corresponding path program 1 times [2018-04-10 15:55:27,324 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:27,324 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:27,325 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:27,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:27,325 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:27,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:27,362 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:55:27,362 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:55:27,362 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:55:27,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:27,452 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:55:27,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:27,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:27,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:27,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:27,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:27,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 15:55:27,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:27,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:27,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:27,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:27,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:27,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 15:55:27,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:27,606 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:27,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 15:55:27,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:27,614 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:27,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-10 15:55:27,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:27,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:27,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-04-10 15:55:27,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:55:27,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:27,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:27,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:27,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:55:27,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:27,743 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:27,745 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:27,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:27,756 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:42 [2018-04-10 15:55:27,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-04-10 15:55:27,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 15:55:27,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:27,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:27,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-04-10 15:55:27,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 35 [2018-04-10 15:55:27,873 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:27,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-10 15:55:27,895 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:27,904 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:27,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:27,921 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:61, output treesize:129 [2018-04-10 15:55:27,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:27,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:27,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 81 [2018-04-10 15:55:27,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:27,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 15:55:27,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:27,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:27,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:155, output treesize:69 [2018-04-10 15:55:28,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:28,058 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:28,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 63 [2018-04-10 15:55:28,061 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:28,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2018-04-10 15:55:28,062 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:28,069 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:28,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-10 15:55:28,069 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:28,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:28,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-04-10 15:55:28,090 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:28,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-04-10 15:55:28,090 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:28,096 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:28,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 15:55:28,097 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:28,100 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:28,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:28,108 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:101, output treesize:14 [2018-04-10 15:55:28,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:55:28,261 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:55:28,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-04-10 15:55:28,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 15:55:28,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 15:55:28,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2018-04-10 15:55:28,262 INFO L87 Difference]: Start difference. First operand 575 states and 606 transitions. Second operand 21 states. [2018-04-10 15:55:29,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:29,395 INFO L93 Difference]: Finished difference Result 610 states and 646 transitions. [2018-04-10 15:55:29,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 15:55:29,395 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 212 [2018-04-10 15:55:29,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:29,396 INFO L225 Difference]: With dead ends: 610 [2018-04-10 15:55:29,396 INFO L226 Difference]: Without dead ends: 610 [2018-04-10 15:55:29,396 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 15:55:29,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-04-10 15:55:29,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 590. [2018-04-10 15:55:29,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-04-10 15:55:29,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 625 transitions. [2018-04-10 15:55:29,400 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 625 transitions. Word has length 212 [2018-04-10 15:55:29,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:29,400 INFO L459 AbstractCegarLoop]: Abstraction has 590 states and 625 transitions. [2018-04-10 15:55:29,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 15:55:29,401 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 625 transitions. [2018-04-10 15:55:29,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-04-10 15:55:29,402 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:29,402 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:55:29,402 INFO L408 AbstractCegarLoop]: === Iteration 67 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:29,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1582508469, now seen corresponding path program 1 times [2018-04-10 15:55:29,402 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:29,402 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:29,403 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:29,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:29,403 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:29,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:29,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:55:29,496 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:55:29,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 15:55:29,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 15:55:29,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 15:55:29,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-04-10 15:55:29,497 INFO L87 Difference]: Start difference. First operand 590 states and 625 transitions. Second operand 9 states. [2018-04-10 15:55:29,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:29,693 INFO L93 Difference]: Finished difference Result 611 states and 650 transitions. [2018-04-10 15:55:29,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 15:55:29,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 212 [2018-04-10 15:55:29,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:29,694 INFO L225 Difference]: With dead ends: 611 [2018-04-10 15:55:29,695 INFO L226 Difference]: Without dead ends: 611 [2018-04-10 15:55:29,695 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-04-10 15:55:29,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-04-10 15:55:29,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 602. [2018-04-10 15:55:29,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-04-10 15:55:29,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 640 transitions. [2018-04-10 15:55:29,698 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 640 transitions. Word has length 212 [2018-04-10 15:55:29,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:29,698 INFO L459 AbstractCegarLoop]: Abstraction has 602 states and 640 transitions. [2018-04-10 15:55:29,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 15:55:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 640 transitions. [2018-04-10 15:55:29,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-04-10 15:55:29,699 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:29,699 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 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, 1, 1, 1] [2018-04-10 15:55:29,699 INFO L408 AbstractCegarLoop]: === Iteration 68 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:29,699 INFO L82 PathProgramCache]: Analyzing trace with hash -857655976, now seen corresponding path program 1 times [2018-04-10 15:55:29,699 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:29,699 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:29,700 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:29,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:29,700 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:29,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:29,716 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:55:29,716 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:55:29,716 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:55:29,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:29,835 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:55:29,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:29,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:29,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:29,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:29,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:29,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 15:55:29,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:55:29,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:29,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:29,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:29,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:29,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:36 [2018-04-10 15:55:29,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:29,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:29,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2018-04-10 15:55:29,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:29,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-04-10 15:55:29,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:29,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:29,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:27 [2018-04-10 15:55:30,066 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:30,066 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:30,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:30,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 50 [2018-04-10 15:55:30,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:30,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:30,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:49 [2018-04-10 15:55:30,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-04-10 15:55:30,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 15:55:30,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:30,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:30,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:30,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:65 [2018-04-10 15:55:30,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2018-04-10 15:55:30,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-04-10 15:55:30,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:30,187 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:30,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-10 15:55:30,187 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:30,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:30,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:30,199 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:74, output treesize:28 [2018-04-10 15:55:30,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:55:30,259 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:55:30,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-10 15:55:30,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 15:55:30,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 15:55:30,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-04-10 15:55:30,260 INFO L87 Difference]: Start difference. First operand 602 states and 640 transitions. Second operand 20 states. [2018-04-10 15:55:31,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:31,564 INFO L93 Difference]: Finished difference Result 644 states and 696 transitions. [2018-04-10 15:55:31,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 15:55:31,565 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 213 [2018-04-10 15:55:31,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:31,566 INFO L225 Difference]: With dead ends: 644 [2018-04-10 15:55:31,566 INFO L226 Difference]: Without dead ends: 644 [2018-04-10 15:55:31,566 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=179, Invalid=877, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 15:55:31,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2018-04-10 15:55:31,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 627. [2018-04-10 15:55:31,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2018-04-10 15:55:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 672 transitions. [2018-04-10 15:55:31,570 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 672 transitions. Word has length 213 [2018-04-10 15:55:31,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:31,570 INFO L459 AbstractCegarLoop]: Abstraction has 627 states and 672 transitions. [2018-04-10 15:55:31,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 15:55:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 672 transitions. [2018-04-10 15:55:31,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-04-10 15:55:31,571 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:31,571 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 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, 1, 1, 1] [2018-04-10 15:55:31,571 INFO L408 AbstractCegarLoop]: === Iteration 69 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:31,571 INFO L82 PathProgramCache]: Analyzing trace with hash -857655975, now seen corresponding path program 1 times [2018-04-10 15:55:31,571 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:31,571 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:31,572 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:31,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:31,572 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:31,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:31,595 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:55:31,595 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:55:31,595 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:55:31,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:31,688 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:55:31,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:31,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:31,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:31,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:31,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:31,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 15:55:31,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:55:31,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:31,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:31,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:31,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:55:31,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:31,802 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:31,804 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:31,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:31,813 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:55 [2018-04-10 15:55:31,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:31,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:31,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-10 15:55:31,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:31,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 15:55:31,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:31,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:31,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:43 [2018-04-10 15:55:31,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:31,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 15:55:31,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:31,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:31,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:31,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-10 15:55:31,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:31,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:31,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:47 [2018-04-10 15:55:31,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 49 [2018-04-10 15:55:31,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-04-10 15:55:31,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:32,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:32,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-04-10 15:55:32,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-10 15:55:32,036 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:32,048 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:32,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:32,058 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:84, output treesize:76 [2018-04-10 15:55:32,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 44 [2018-04-10 15:55:32,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2018-04-10 15:55:32,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:32,102 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:32,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-04-10 15:55:32,102 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:32,114 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:32,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2018-04-10 15:55:32,115 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:32,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:32,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-04-10 15:55:32,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-04-10 15:55:32,137 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:32,145 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:32,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 15:55:32,145 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:32,153 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:32,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-04-10 15:55:32,154 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:32,158 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:32,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:32,166 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:94, output treesize:18 [2018-04-10 15:55:32,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:55:32,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:55:32,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-10 15:55:32,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 15:55:32,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 15:55:32,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=268, Unknown=2, NotChecked=0, Total=306 [2018-04-10 15:55:32,228 INFO L87 Difference]: Start difference. First operand 627 states and 672 transitions. Second operand 18 states. [2018-04-10 15:55:33,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:33,776 INFO L93 Difference]: Finished difference Result 643 states and 695 transitions. [2018-04-10 15:55:33,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 15:55:33,777 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 213 [2018-04-10 15:55:33,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:33,778 INFO L225 Difference]: With dead ends: 643 [2018-04-10 15:55:33,778 INFO L226 Difference]: Without dead ends: 643 [2018-04-10 15:55:33,779 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=166, Invalid=761, Unknown=3, NotChecked=0, Total=930 [2018-04-10 15:55:33,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-04-10 15:55:33,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 627. [2018-04-10 15:55:33,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2018-04-10 15:55:33,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 671 transitions. [2018-04-10 15:55:33,782 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 671 transitions. Word has length 213 [2018-04-10 15:55:33,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:33,782 INFO L459 AbstractCegarLoop]: Abstraction has 627 states and 671 transitions. [2018-04-10 15:55:33,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 15:55:33,783 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 671 transitions. [2018-04-10 15:55:33,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-04-10 15:55:33,783 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:33,783 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:55:33,783 INFO L408 AbstractCegarLoop]: === Iteration 70 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:33,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1813122169, now seen corresponding path program 1 times [2018-04-10 15:55:33,784 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:33,784 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:33,784 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:33,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:33,784 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:33,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:33,815 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:55:33,816 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:55:33,816 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:55:33,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:33,906 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:55:33,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:33,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:33,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:33,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 15:55:34,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 15:55:34,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 15:55:34,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:34,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:34,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:34,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-10 15:55:34,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-04-10 15:55:34,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:34,119 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:34,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 49 [2018-04-10 15:55:34,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:34,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:34,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:34,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-04-10 15:55:34,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:55:34,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:34,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:34,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:34,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:34,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-04-10 15:55:34,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:34,211 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:34,215 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:34,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:34,226 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:67 [2018-04-10 15:55:34,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 54 [2018-04-10 15:55:34,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2018-04-10 15:55:34,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:34,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:34,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 48 [2018-04-10 15:55:34,297 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:34,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:34,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:34,343 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:34,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 62 [2018-04-10 15:55:34,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-10 15:55:34,347 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:34,354 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:34,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:34,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:34,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 100 [2018-04-10 15:55:34,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 84 [2018-04-10 15:55:34,371 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:34,408 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:34,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:34,430 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:83, output treesize:146 [2018-04-10 15:55:34,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:34,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:34,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:34,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:34,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 44 [2018-04-10 15:55:34,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:34,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:34,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:162, output treesize:86 [2018-04-10 15:55:34,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:34,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:34,675 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:34,676 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:34,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 84 [2018-04-10 15:55:34,679 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:34,682 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 42 [2018-04-10 15:55:34,683 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:34,698 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:34,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 56 [2018-04-10 15:55:34,702 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 15:55:34,704 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:34,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2018-04-10 15:55:34,704 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:34,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:34,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:34,744 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:115, output treesize:129 [2018-04-10 15:55:34,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2018-04-10 15:55:34,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:34,858 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:34,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 15:55:34,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:34,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 15:55:34,866 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:34,870 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:34,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 15:55:34,870 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:34,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:34,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:34,879 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:70, output treesize:3 [2018-04-10 15:55:35,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2018-04-10 15:55:35,062 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:55:35,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-10 15:55:35,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 15:55:35,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 15:55:35,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-04-10 15:55:35,063 INFO L87 Difference]: Start difference. First operand 627 states and 671 transitions. Second operand 28 states. [2018-04-10 15:55:36,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:36,696 INFO L93 Difference]: Finished difference Result 757 states and 828 transitions. [2018-04-10 15:55:36,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-10 15:55:36,696 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 213 [2018-04-10 15:55:36,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:36,697 INFO L225 Difference]: With dead ends: 757 [2018-04-10 15:55:36,698 INFO L226 Difference]: Without dead ends: 757 [2018-04-10 15:55:36,698 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 182 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=262, Invalid=2494, Unknown=0, NotChecked=0, Total=2756 [2018-04-10 15:55:36,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-04-10 15:55:36,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 702. [2018-04-10 15:55:36,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2018-04-10 15:55:36,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 773 transitions. [2018-04-10 15:55:36,702 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 773 transitions. Word has length 213 [2018-04-10 15:55:36,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:36,702 INFO L459 AbstractCegarLoop]: Abstraction has 702 states and 773 transitions. [2018-04-10 15:55:36,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 15:55:36,702 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 773 transitions. [2018-04-10 15:55:36,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-04-10 15:55:36,703 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:36,703 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:55:36,703 INFO L408 AbstractCegarLoop]: === Iteration 71 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:36,703 INFO L82 PathProgramCache]: Analyzing trace with hash -372212213, now seen corresponding path program 1 times [2018-04-10 15:55:36,703 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:36,703 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:36,703 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:36,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:36,704 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:36,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:36,729 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:55:36,730 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:55:36,730 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:55:36,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:36,900 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:55:36,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:36,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:36,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:36,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 15:55:36,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:36,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:36,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:36,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2018-04-10 15:55:36,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-04-10 15:55:36,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:36,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:36,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:26 [2018-04-10 15:55:36,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:36,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:36,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:36,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-10 15:55:36,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 15:55:36,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 15:55:36,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:36,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:36,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:36,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-10 15:55:37,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-04-10 15:55:37,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:37,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2018-04-10 15:55:37,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:37,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:37,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:37,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-04-10 15:55:37,077 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:37,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-10 15:55:37,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:37,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:37,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:37,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:55:37,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:37,100 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:37,101 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:37,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:37,112 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:69 [2018-04-10 15:55:37,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-04-10 15:55:37,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 15:55:37,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:37,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:37,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:37,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:37,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 69 [2018-04-10 15:55:37,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 62 [2018-04-10 15:55:37,193 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:37,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-04-10 15:55:37,226 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:37,242 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:37,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:37,262 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:85, output treesize:185 [2018-04-10 15:55:37,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:37,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:37,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:37,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:37,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 59 [2018-04-10 15:55:37,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:37,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:37,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:181, output treesize:114 [2018-04-10 15:55:37,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 104 [2018-04-10 15:55:37,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 75 [2018-04-10 15:55:37,441 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:37,452 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:37,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 15:55:37,452 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:37,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:37,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:37,471 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:146, output treesize:92 [2018-04-10 15:55:37,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:37,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:37,561 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:37,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 69 [2018-04-10 15:55:37,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2018-04-10 15:55:37,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:37,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 15:55:37,572 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:37,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-04-10 15:55:37,575 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:37,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:37,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:37,579 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:93, output treesize:5 [2018-04-10 15:55:37,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:55:37,710 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:55:37,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-04-10 15:55:37,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 15:55:37,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 15:55:37,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2018-04-10 15:55:37,711 INFO L87 Difference]: Start difference. First operand 702 states and 773 transitions. Second operand 25 states. [2018-04-10 15:55:38,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:38,966 INFO L93 Difference]: Finished difference Result 800 states and 904 transitions. [2018-04-10 15:55:38,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 15:55:38,966 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 214 [2018-04-10 15:55:38,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:38,967 INFO L225 Difference]: With dead ends: 800 [2018-04-10 15:55:38,967 INFO L226 Difference]: Without dead ends: 800 [2018-04-10 15:55:38,968 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=1408, Unknown=0, NotChecked=0, Total=1560 [2018-04-10 15:55:38,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2018-04-10 15:55:38,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 780. [2018-04-10 15:55:38,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2018-04-10 15:55:38,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 873 transitions. [2018-04-10 15:55:38,972 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 873 transitions. Word has length 214 [2018-04-10 15:55:38,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:38,973 INFO L459 AbstractCegarLoop]: Abstraction has 780 states and 873 transitions. [2018-04-10 15:55:38,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 15:55:38,973 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 873 transitions. [2018-04-10 15:55:38,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-04-10 15:55:38,973 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:38,973 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:55:38,973 INFO L408 AbstractCegarLoop]: === Iteration 72 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:38,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1885597289, now seen corresponding path program 1 times [2018-04-10 15:55:38,974 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:38,974 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:38,974 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:38,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:38,974 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:38,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:39,001 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:55:39,002 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:55:39,002 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:55:39,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:39,079 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:55:39,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:39,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:39,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:39,087 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 15:55:39,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-10 15:55:39,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:39,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:39,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:3 [2018-04-10 15:55:39,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:39,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:39,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:39,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:39,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:39,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-04-10 15:55:39,173 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|) 0) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80)))) is different from true [2018-04-10 15:55:39,216 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| Int) (|__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| Int)) (and (<= (select (store |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 1) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base|) 0) (<= (select |c_old(#valid)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base|) 0) (= |c_#length| (store (store (store |c_old(#length)| |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc5.base| 16) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc6.base| 80) |__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_data_#t~malloc20.base| 16)))) is different from true [2018-04-10 15:55:39,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:39,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:39,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 30 [2018-04-10 15:55:39,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:39,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:39,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:39,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 52 [2018-04-10 15:55:39,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 41 [2018-04-10 15:55:39,245 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-10 15:55:39,270 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 15:55:39,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 15:55:39,310 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:39,311 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:39,311 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:39,312 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:39,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 27 [2018-04-10 15:55:39,313 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:39,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-04-10 15:55:39,336 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:48, output treesize:114 [2018-04-10 15:55:39,461 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 62 DAG size of output 58 [2018-04-10 15:55:39,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 52 [2018-04-10 15:55:39,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:39,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:39,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:39,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2018-04-10 15:55:39,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:39,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:39,566 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:39,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2018-04-10 15:55:39,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:39,623 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:39,632 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:39,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2018-04-10 15:55:39,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:39,679 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:39,688 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:39,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2018-04-10 15:55:39,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:39,733 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:39,741 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:39,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 40 [2018-04-10 15:55:39,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:39,787 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:39,794 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:39,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 6 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-04-10 15:55:39,822 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 21 variables, input treesize:166, output treesize:112 [2018-04-10 15:55:40,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2018-04-10 15:55:40,111 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:40,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-10 15:55:40,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:40,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:40,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2018-04-10 15:55:40,164 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:40,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-10 15:55:40,164 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:40,174 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:40,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-04-10 15:55:40,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-04-10 15:55:40,212 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:40,219 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:40,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-04-10 15:55:40,255 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:40,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-04-10 15:55:40,255 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:40,262 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:40,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2018-04-10 15:55:40,301 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:40,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-10 15:55:40,302 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:40,316 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:40,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-04-10 15:55:40,354 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:40,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-04-10 15:55:40,355 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:40,363 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:40,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-04-10 15:55:40,388 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 21 variables, input treesize:184, output treesize:75 [2018-04-10 15:55:40,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:55:40,635 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:55:40,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-04-10 15:55:40,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 15:55:40,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 15:55:40,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=199, Unknown=5, NotChecked=58, Total=306 [2018-04-10 15:55:40,670 INFO L87 Difference]: Start difference. First operand 780 states and 873 transitions. Second operand 18 states. [2018-04-10 15:55:41,123 WARN L151 SmtUtils]: Spent 190ms on a formula simplification. DAG size of input: 101 DAG size of output 90 [2018-04-10 15:55:41,415 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 86 DAG size of output 82 [2018-04-10 15:55:41,581 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 80 DAG size of output 80 [2018-04-10 15:55:41,918 WARN L151 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 95 DAG size of output 84 [2018-04-10 15:55:42,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:42,318 INFO L93 Difference]: Finished difference Result 944 states and 1081 transitions. [2018-04-10 15:55:42,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 15:55:42,318 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 215 [2018-04-10 15:55:42,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:42,319 INFO L225 Difference]: With dead ends: 944 [2018-04-10 15:55:42,319 INFO L226 Difference]: Without dead ends: 944 [2018-04-10 15:55:42,319 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=105, Invalid=546, Unknown=7, NotChecked=98, Total=756 [2018-04-10 15:55:42,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2018-04-10 15:55:42,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 880. [2018-04-10 15:55:42,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-04-10 15:55:42,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 994 transitions. [2018-04-10 15:55:42,324 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 994 transitions. Word has length 215 [2018-04-10 15:55:42,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:42,324 INFO L459 AbstractCegarLoop]: Abstraction has 880 states and 994 transitions. [2018-04-10 15:55:42,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 15:55:42,324 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 994 transitions. [2018-04-10 15:55:42,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-04-10 15:55:42,325 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:42,325 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 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, 1, 1, 1, 1, 1] [2018-04-10 15:55:42,325 INFO L408 AbstractCegarLoop]: === Iteration 73 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:42,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1687347977, now seen corresponding path program 1 times [2018-04-10 15:55:42,325 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:42,325 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:42,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:42,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:42,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:42,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:42,346 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:55:42,347 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:55:42,347 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:55:42,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:42,526 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:55:42,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:42,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:42,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:42,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:42,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:42,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 15:55:42,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:55:42,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:42,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:42,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:42,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:42,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:72 [2018-04-10 15:55:42,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:55:42,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:42,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:42,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:42,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 70 [2018-04-10 15:55:42,799 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:42,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 70 [2018-04-10 15:55:42,805 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:42,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2018-04-10 15:55:42,858 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:42,884 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:42,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:42,922 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:98, output treesize:223 [2018-04-10 15:55:43,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 122 [2018-04-10 15:55:43,020 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2018-04-10 15:55:43,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:43,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:43,047 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-04-10 15:55:43,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 104 [2018-04-10 15:55:43,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 165 [2018-04-10 15:55:43,053 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:43,066 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:43,071 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:43,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:43,085 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:249, output treesize:76 [2018-04-10 15:55:43,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 115 [2018-04-10 15:55:43,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:43,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 76 [2018-04-10 15:55:43,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:43,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:43,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:92, output treesize:118 [2018-04-10 15:55:43,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 88 [2018-04-10 15:55:43,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 15:55:43,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:43,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:43,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 104 [2018-04-10 15:55:43,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 15:55:43,409 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:43,417 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:43,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:43,435 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:155, output treesize:147 [2018-04-10 15:55:43,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 82 [2018-04-10 15:55:43,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-04-10 15:55:43,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:43,493 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:43,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 57 [2018-04-10 15:55:43,494 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:43,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:43,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:43,515 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:165, output treesize:127 [2018-04-10 15:55:43,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:43,563 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:43,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 95 [2018-04-10 15:55:43,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 20 [2018-04-10 15:55:43,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:43,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2018-04-10 15:55:43,587 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:43,594 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:43,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-04-10 15:55:43,595 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:43,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:43,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:43,614 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:131, output treesize:45 [2018-04-10 15:55:43,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:55:43,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:55:43,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-10 15:55:43,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 15:55:43,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 15:55:43,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=697, Unknown=1, NotChecked=0, Total=756 [2018-04-10 15:55:43,903 INFO L87 Difference]: Start difference. First operand 880 states and 994 transitions. Second operand 28 states. [2018-04-10 15:55:45,937 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 118 DAG size of output 95 [2018-04-10 15:55:46,598 WARN L151 SmtUtils]: Spent 537ms on a formula simplification. DAG size of input: 45 DAG size of output 37 [2018-04-10 15:55:48,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:55:48,278 INFO L93 Difference]: Finished difference Result 1214 states and 1377 transitions. [2018-04-10 15:55:48,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-10 15:55:48,278 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 217 [2018-04-10 15:55:48,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:55:48,280 INFO L225 Difference]: With dead ends: 1214 [2018-04-10 15:55:48,280 INFO L226 Difference]: Without dead ends: 1214 [2018-04-10 15:55:48,281 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=229, Invalid=2220, Unknown=1, NotChecked=0, Total=2450 [2018-04-10 15:55:48,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2018-04-10 15:55:48,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1161. [2018-04-10 15:55:48,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2018-04-10 15:55:48,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1321 transitions. [2018-04-10 15:55:48,289 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1321 transitions. Word has length 217 [2018-04-10 15:55:48,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:55:48,289 INFO L459 AbstractCegarLoop]: Abstraction has 1161 states and 1321 transitions. [2018-04-10 15:55:48,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 15:55:48,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1321 transitions. [2018-04-10 15:55:48,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-04-10 15:55:48,290 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:55:48,290 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 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, 1, 1, 1, 1, 1] [2018-04-10 15:55:48,290 INFO L408 AbstractCegarLoop]: === Iteration 74 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:55:48,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1687347978, now seen corresponding path program 1 times [2018-04-10 15:55:48,290 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:55:48,291 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:55:48,291 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:48,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:48,291 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:55:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:48,318 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:55:48,348 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:55:48,348 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:55:48,348 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:55:48,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:55:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:55:48,539 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:55:48,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:48,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:48,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:55:48,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:48,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:48,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 15:55:48,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:55:48,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:48,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:48,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:48,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:55:48,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:48,743 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:48,744 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:48,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:48,763 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:94, output treesize:79 [2018-04-10 15:55:48,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-04-10 15:55:48,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 15:55:48,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:48,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:48,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:55:48,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:55:48,842 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:48,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:48,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:48,861 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:98, output treesize:120 [2018-04-10 15:55:48,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:48,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:48,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:48,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:48,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 65 [2018-04-10 15:55:48,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:48,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:48,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:48,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:48,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:48,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 44 [2018-04-10 15:55:48,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:48,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:48,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:48,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 45 [2018-04-10 15:55:48,991 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:48,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:48,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 75 [2018-04-10 15:55:48,994 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:48,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:48,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:48,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 112 [2018-04-10 15:55:48,996 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:49,010 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:49,017 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:49,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:49,034 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:133, output treesize:76 [2018-04-10 15:55:49,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:49,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:49,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:49,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:49,370 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:49,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:49,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:49,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:49,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:49,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:49,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:49,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:49,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:49,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:49,382 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:49,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:49,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:49,384 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:49,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 18 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 61 treesize of output 216 [2018-04-10 15:55:49,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2018-04-10 15:55:49,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:49,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:49,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:49,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:49,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-04-10 15:55:49,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:49,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 14 dim-0 vars, and 4 xjuncts. [2018-04-10 15:55:49,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:133, output treesize:397 [2018-04-10 15:55:50,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:50,031 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:50,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 142 [2018-04-10 15:55:50,038 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:50,039 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:50,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-04-10 15:55:50,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:50,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:50,225 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:50,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:50,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:50,228 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:50,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 162 [2018-04-10 15:55:50,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 15:55:50,234 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:50,260 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:50,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:50,367 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:50,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:50,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 162 [2018-04-10 15:55:50,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 15:55:50,379 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:50,407 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:50,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:50,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:50,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:50,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 140 [2018-04-10 15:55:50,519 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:50,533 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 83 treesize of output 100 [2018-04-10 15:55:50,534 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-10 15:55:50,571 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:50,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:50,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:50,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:50,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:50,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 158 [2018-04-10 15:55:50,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 15:55:50,667 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:50,690 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:50,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:50,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:50,764 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:50,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:50,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 158 [2018-04-10 15:55:50,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 15:55:50,774 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:50,799 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:50,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 6 dim-2 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2018-04-10 15:55:50,866 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 21 variables, input treesize:403, output treesize:373 [2018-04-10 15:55:51,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:51,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:51,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 147 [2018-04-10 15:55:51,214 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 76 [2018-04-10 15:55:51,215 INFO L267 ElimStorePlain]: Start of recursive call 3: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-04-10 15:55:51,264 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:51,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-04-10 15:55:51,265 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:51,267 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:51,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 80 [2018-04-10 15:55:51,273 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 15:55:51,275 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:51,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 74 [2018-04-10 15:55:51,280 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 15:55:51,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:51,282 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:51,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 74 [2018-04-10 15:55:51,284 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:51,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-10 15:55:51,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:51,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:51,515 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:51,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:51,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:51,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 174 [2018-04-10 15:55:51,523 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:51,527 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 41 [2018-04-10 15:55:51,527 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:55:51,561 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:51,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 51 [2018-04-10 15:55:51,561 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:51,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 45 [2018-04-10 15:55:51,584 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:51,603 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:51,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:51,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:51,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 89 [2018-04-10 15:55:51,741 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:51,741 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:51,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2018-04-10 15:55:51,742 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:51,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-10 15:55:51,762 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:51,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-10 15:55:51,777 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:51,787 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:51,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 78 [2018-04-10 15:55:51,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 14 [2018-04-10 15:55:51,935 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:51,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-04-10 15:55:51,946 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:51,955 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:51,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 78 [2018-04-10 15:55:51,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2018-04-10 15:55:51,959 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:51,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 3 [2018-04-10 15:55:51,972 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:51,980 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:51,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 78 [2018-04-10 15:55:51,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2018-04-10 15:55:51,984 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:51,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 3 [2018-04-10 15:55:51,997 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:52,006 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:52,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 78 [2018-04-10 15:55:52,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2018-04-10 15:55:52,010 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:52,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 3 [2018-04-10 15:55:52,023 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:52,032 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:52,117 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:52,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:52,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:52,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:52,119 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:52,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:52,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 180 [2018-04-10 15:55:52,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 35 [2018-04-10 15:55:52,125 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:52,164 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:52,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-04-10 15:55:52,165 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:52,187 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:52,187 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:55:52,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2018-04-10 15:55:52,188 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:52,208 INFO L267 ElimStorePlain]: Start of recursive call 28: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:55:52,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:52,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:55:52,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 91 [2018-04-10 15:55:52,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-10 15:55:52,292 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:52,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 14 [2018-04-10 15:55:52,308 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:52,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-04-10 15:55:52,321 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-10 15:55:52,331 INFO L267 ElimStorePlain]: Start of recursive call 32: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:55:52,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 19 dim-0 vars, 6 dim-2 vars, End of recursive call: 24 dim-0 vars, and 6 xjuncts. [2018-04-10 15:55:52,397 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 25 variables, input treesize:487, output treesize:211 [2018-04-10 15:55:52,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:55:52,966 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:55:52,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-10 15:55:52,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-10 15:55:52,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-10 15:55:52,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=805, Unknown=2, NotChecked=0, Total=870 [2018-04-10 15:55:52,966 INFO L87 Difference]: Start difference. First operand 1161 states and 1321 transitions. Second operand 30 states. [2018-04-10 15:55:55,139 WARN L151 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 134 DAG size of output 132 [2018-04-10 15:55:55,424 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 162 DAG size of output 137 [2018-04-10 15:55:56,002 WARN L151 SmtUtils]: Spent 369ms on a formula simplification. DAG size of input: 248 DAG size of output 187 [2018-04-10 15:55:58,373 WARN L151 SmtUtils]: Spent 1116ms on a formula simplification. DAG size of input: 292 DAG size of output 220 [2018-04-10 15:55:59,748 WARN L151 SmtUtils]: Spent 604ms on a formula simplification. DAG size of input: 241 DAG size of output 179 [2018-04-10 15:56:02,097 WARN L151 SmtUtils]: Spent 1929ms on a formula simplification. DAG size of input: 285 DAG size of output 233 [2018-04-10 15:56:04,299 WARN L151 SmtUtils]: Spent 1743ms on a formula simplification. DAG size of input: 329 DAG size of output 230 [2018-04-10 15:56:06,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:56:06,574 INFO L93 Difference]: Finished difference Result 1231 states and 1406 transitions. [2018-04-10 15:56:06,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-10 15:56:06,574 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 217 [2018-04-10 15:56:06,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:56:06,576 INFO L225 Difference]: With dead ends: 1231 [2018-04-10 15:56:06,576 INFO L226 Difference]: Without dead ends: 1231 [2018-04-10 15:56:06,577 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 186 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=247, Invalid=2612, Unknown=3, NotChecked=0, Total=2862 [2018-04-10 15:56:06,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2018-04-10 15:56:06,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1170. [2018-04-10 15:56:06,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1170 states. [2018-04-10 15:56:06,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1335 transitions. [2018-04-10 15:56:06,584 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1335 transitions. Word has length 217 [2018-04-10 15:56:06,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:56:06,584 INFO L459 AbstractCegarLoop]: Abstraction has 1170 states and 1335 transitions. [2018-04-10 15:56:06,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-10 15:56:06,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1335 transitions. [2018-04-10 15:56:06,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-04-10 15:56:06,585 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:56:06,585 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:56:06,585 INFO L408 AbstractCegarLoop]: === Iteration 75 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:56:06,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1917884782, now seen corresponding path program 1 times [2018-04-10 15:56:06,585 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:56:06,585 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:56:06,586 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:06,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:06,586 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:06,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:56:06,605 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:56:06,605 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:56:06,605 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:56:06,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:06,723 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:56:06,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:56:06,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:06,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:06,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 15:56:06,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 15:56:06,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 15:56:06,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:06,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:06,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:06,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-04-10 15:56:06,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-04-10 15:56:06,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:06,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 32 [2018-04-10 15:56:06,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:06,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:06,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:06,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-04-10 15:56:06,917 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:06,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-04-10 15:56:06,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:56:06,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:06,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:06,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:06,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:77 [2018-04-10 15:56:06,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:56:06,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:56:06,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:06,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:06,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:07,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 88 [2018-04-10 15:56:07,014 WARN L288 Elim1Store]: Array PQE input equivalent to false [2018-04-10 15:56:07,014 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:07,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2018-04-10 15:56:07,103 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:07,159 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:07,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 68 [2018-04-10 15:56:07,164 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:07,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:07,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:07,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 84 [2018-04-10 15:56:07,226 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-10 15:56:07,293 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 6 xjuncts. [2018-04-10 15:56:07,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 14 dim-0 vars, and 6 xjuncts. [2018-04-10 15:56:07,364 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:96, output treesize:696 [2018-04-10 15:56:07,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:07,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:07,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:07,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:07,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 140 [2018-04-10 15:56:07,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:07,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:07,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:07,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:07,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:07,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 134 [2018-04-10 15:56:07,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:07,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:07,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:07,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 12 variables, input treesize:522, output treesize:169 [2018-04-10 15:56:07,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 141 [2018-04-10 15:56:07,631 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:07,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 124 [2018-04-10 15:56:07,632 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:07,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:07,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:07,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:183, output treesize:143 [2018-04-10 15:56:07,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:07,827 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:07,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:07,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:07,829 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:07,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:07,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 107 [2018-04-10 15:56:07,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:07,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 49 [2018-04-10 15:56:07,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-10 15:56:07,873 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:07,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-10 15:56:07,874 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:07,875 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:07,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-04-10 15:56:07,876 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:07,877 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:07,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-04-10 15:56:07,878 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:07,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-04-10 15:56:07,892 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:07,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-04-10 15:56:07,893 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:07,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-04-10 15:56:07,894 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:07,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 15:56:07,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-10 15:56:07,928 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:164, output treesize:66 [2018-04-10 15:56:07,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:07,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 18 [2018-04-10 15:56:07,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 15:56:08,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:08,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 20 [2018-04-10 15:56:08,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 15:56:08,020 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:08,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 21 [2018-04-10 15:56:08,024 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 15:56:08,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:08,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 18 [2018-04-10 15:56:08,028 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 15:56:08,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:08,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-10 15:56:08,062 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:08,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 9 xjuncts. [2018-04-10 15:56:08,093 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:85, output treesize:120 [2018-04-10 15:56:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:56:08,390 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:56:08,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-04-10 15:56:08,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 15:56:08,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 15:56:08,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=598, Unknown=0, NotChecked=0, Total=650 [2018-04-10 15:56:08,391 INFO L87 Difference]: Start difference. First operand 1170 states and 1335 transitions. Second operand 26 states. [2018-04-10 15:56:10,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:56:10,629 INFO L93 Difference]: Finished difference Result 1250 states and 1419 transitions. [2018-04-10 15:56:10,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-10 15:56:10,629 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 218 [2018-04-10 15:56:10,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:56:10,631 INFO L225 Difference]: With dead ends: 1250 [2018-04-10 15:56:10,631 INFO L226 Difference]: Without dead ends: 1250 [2018-04-10 15:56:10,631 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=160, Invalid=1732, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 15:56:10,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2018-04-10 15:56:10,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1201. [2018-04-10 15:56:10,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1201 states. [2018-04-10 15:56:10,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1371 transitions. [2018-04-10 15:56:10,639 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1371 transitions. Word has length 218 [2018-04-10 15:56:10,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:56:10,639 INFO L459 AbstractCegarLoop]: Abstraction has 1201 states and 1371 transitions. [2018-04-10 15:56:10,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 15:56:10,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1371 transitions. [2018-04-10 15:56:10,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-04-10 15:56:10,640 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:56:10,640 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:56:10,640 INFO L408 AbstractCegarLoop]: === Iteration 76 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:56:10,640 INFO L82 PathProgramCache]: Analyzing trace with hash -513672222, now seen corresponding path program 1 times [2018-04-10 15:56:10,640 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:56:10,640 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:56:10,641 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:10,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:10,641 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:10,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:56:10,678 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:56:10,679 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:56:10,679 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:56:10,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:10,840 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:56:10,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:56:10,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:10,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:10,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 15:56:10,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 15:56:10,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 15:56:10,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:10,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:10,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:10,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-04-10 15:56:10,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:56:10,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:56:10,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:10,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:10,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:56:10,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:56:10,963 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:10,964 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:10,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:10,972 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:36 [2018-04-10 15:56:11,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-04-10 15:56:11,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2018-04-10 15:56:11,006 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:11,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 15:56:11,023 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:11,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:11,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-04-10 15:56:11,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 15:56:11,059 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:11,069 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:11,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:11,083 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:55, output treesize:101 [2018-04-10 15:56:11,115 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 15:56:11,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:11,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:11,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:11,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2018-04-10 15:56:11,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:11,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:11,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:117, output treesize:59 [2018-04-10 15:56:11,222 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:11,222 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:11,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 65 [2018-04-10 15:56:11,247 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:11,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-10 15:56:11,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:11,255 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:11,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 26 [2018-04-10 15:56:11,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:11,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:11,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-04-10 15:56:11,277 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:11,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-10 15:56:11,278 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:11,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 15:56:11,283 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:11,285 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:11,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:11,291 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:98, output treesize:11 [2018-04-10 15:56:11,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 15:56:11,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 15:56:11,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:11,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:11,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:11,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-04-10 15:56:11,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1383 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:56:11,395 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:56:11,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-04-10 15:56:11,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 15:56:11,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 15:56:11,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2018-04-10 15:56:11,396 INFO L87 Difference]: Start difference. First operand 1201 states and 1371 transitions. Second operand 24 states. [2018-04-10 15:56:12,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:56:12,529 INFO L93 Difference]: Finished difference Result 1384 states and 1592 transitions. [2018-04-10 15:56:12,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-10 15:56:12,529 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 220 [2018-04-10 15:56:12,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:56:12,531 INFO L225 Difference]: With dead ends: 1384 [2018-04-10 15:56:12,531 INFO L226 Difference]: Without dead ends: 1384 [2018-04-10 15:56:12,531 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=249, Invalid=1821, Unknown=0, NotChecked=0, Total=2070 [2018-04-10 15:56:12,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2018-04-10 15:56:12,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1198. [2018-04-10 15:56:12,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1198 states. [2018-04-10 15:56:12,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1361 transitions. [2018-04-10 15:56:12,538 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1361 transitions. Word has length 220 [2018-04-10 15:56:12,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:56:12,538 INFO L459 AbstractCegarLoop]: Abstraction has 1198 states and 1361 transitions. [2018-04-10 15:56:12,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 15:56:12,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1361 transitions. [2018-04-10 15:56:12,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-04-10 15:56:12,539 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:56:12,539 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:56:12,539 INFO L408 AbstractCegarLoop]: === Iteration 77 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:56:12,539 INFO L82 PathProgramCache]: Analyzing trace with hash -90970396, now seen corresponding path program 1 times [2018-04-10 15:56:12,540 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:56:12,540 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:56:12,540 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:12,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:12,540 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:12,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:56:12,562 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:56:12,563 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:56:12,563 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:56:12,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:12,670 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:56:12,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:56:12,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:12,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:12,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 15:56:12,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 15:56:12,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:12,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:12,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-04-10 15:56:12,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:56:12,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:12,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:12,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-04-10 15:56:12,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:12,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:12,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-04-10 15:56:12,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:12,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:12,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 15:56:12,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:12,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:12,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-10 15:56:12,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:12,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:12,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-04-10 15:56:12,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:56:12,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:56:12,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:12,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:12,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:56:12,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:56:12,855 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:12,857 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:12,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:12,871 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:66, output treesize:56 [2018-04-10 15:56:12,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 40 [2018-04-10 15:56:12,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-04-10 15:56:12,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:12,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2018-04-10 15:56:12,948 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:12,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:12,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-04-10 15:56:13,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-04-10 15:56:13,004 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 15:56:13,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 15:56:13,017 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:13,023 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:13,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:13,044 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:75, output treesize:150 [2018-04-10 15:56:13,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:13,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:13,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 102 [2018-04-10 15:56:13,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:13,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:13,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:166, output treesize:95 [2018-04-10 15:56:13,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:13,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:13,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:13,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:13,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:13,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 100 [2018-04-10 15:56:13,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 15:56:13,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:13,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:13,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:13,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-04-10 15:56:13,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:13,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:13,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:106, output treesize:160 [2018-04-10 15:56:13,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 73 [2018-04-10 15:56:13,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 66 [2018-04-10 15:56:13,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:13,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:13,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 87 [2018-04-10 15:56:13,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 83 [2018-04-10 15:56:13,523 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:13,558 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:13,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 62 [2018-04-10 15:56:13,566 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:13,590 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:13,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:13,622 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:117, output treesize:195 [2018-04-10 15:56:13,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:13,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:13,774 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:13,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 157 [2018-04-10 15:56:13,785 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:13,787 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:13,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 137 [2018-04-10 15:56:13,788 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:13,859 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:13,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 88 [2018-04-10 15:56:13,860 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:13,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 107 [2018-04-10 15:56:13,914 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:13,959 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:13,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 103 [2018-04-10 15:56:13,960 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:14,005 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:14,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 92 [2018-04-10 15:56:14,006 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:14,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:14,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:14,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 89 [2018-04-10 15:56:14,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2018-04-10 15:56:14,086 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:14,101 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:14,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-10 15:56:14,101 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:14,114 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:14,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2018-04-10 15:56:14,146 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:14,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-10 15:56:14,146 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:14,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-10 15:56:14,157 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:14,164 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:14,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:14,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:14,188 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:14,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 95 [2018-04-10 15:56:14,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 79 [2018-04-10 15:56:14,196 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:14,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2018-04-10 15:56:14,230 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:14,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 47 [2018-04-10 15:56:14,261 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:14,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-04-10 15:56:14,292 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:14,310 INFO L267 ElimStorePlain]: Start of recursive call 14: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:14,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:14,325 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 14 variables, input treesize:242, output treesize:29 [2018-04-10 15:56:14,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1383 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:56:14,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:56:14,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-10 15:56:14,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 15:56:14,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 15:56:14,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=693, Unknown=1, NotChecked=0, Total=756 [2018-04-10 15:56:14,587 INFO L87 Difference]: Start difference. First operand 1198 states and 1361 transitions. Second operand 28 states. [2018-04-10 15:56:16,180 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 114 DAG size of output 113 [2018-04-10 15:56:16,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:56:16,849 INFO L93 Difference]: Finished difference Result 1234 states and 1406 transitions. [2018-04-10 15:56:16,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-10 15:56:16,850 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 220 [2018-04-10 15:56:16,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:56:16,852 INFO L225 Difference]: With dead ends: 1234 [2018-04-10 15:56:16,852 INFO L226 Difference]: Without dead ends: 1234 [2018-04-10 15:56:16,853 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=223, Invalid=2222, Unknown=5, NotChecked=0, Total=2450 [2018-04-10 15:56:16,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2018-04-10 15:56:16,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1218. [2018-04-10 15:56:16,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2018-04-10 15:56:16,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1386 transitions. [2018-04-10 15:56:16,860 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1386 transitions. Word has length 220 [2018-04-10 15:56:16,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:56:16,860 INFO L459 AbstractCegarLoop]: Abstraction has 1218 states and 1386 transitions. [2018-04-10 15:56:16,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 15:56:16,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1386 transitions. [2018-04-10 15:56:16,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-04-10 15:56:16,861 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:56:16,861 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:56:16,861 INFO L408 AbstractCegarLoop]: === Iteration 78 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:56:16,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1371955587, now seen corresponding path program 1 times [2018-04-10 15:56:16,861 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:56:16,861 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:56:16,862 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:16,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:16,862 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:16,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:56:16,884 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:56:16,884 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:56:16,884 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:56:16,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:16,946 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:56:16,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:56:16,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:16,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:56:16,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:16,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:16,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-10 15:56:17,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:17,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:17,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:17,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:17,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 59 [2018-04-10 15:56:17,161 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:17,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:17,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:17,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:17,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:17,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2018-04-10 15:56:17,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 54 [2018-04-10 15:56:17,167 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:17,176 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:17,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:17,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:17,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2018-04-10 15:56:17,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:17,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:17,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2018-04-10 15:56:17,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 70 [2018-04-10 15:56:17,206 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:17,216 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:17,222 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:17,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:17,236 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:72, output treesize:58 [2018-04-10 15:56:17,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:17,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:17,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:17,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:17,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:17,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-04-10 15:56:17,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:17,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:17,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:41 [2018-04-10 15:56:17,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:56:17,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:56:17,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:17,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:17,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:56:17,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:56:17,307 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:17,308 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:17,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:17,316 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:57, output treesize:51 [2018-04-10 15:56:17,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-04-10 15:56:17,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2018-04-10 15:56:17,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:17,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:17,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-04-10 15:56:17,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-04-10 15:56:17,391 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:17,393 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:17,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:17,399 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:65, output treesize:35 [2018-04-10 15:56:17,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:56:17,596 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:56:17,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-04-10 15:56:17,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 15:56:17,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 15:56:17,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=195, Unknown=7, NotChecked=0, Total=240 [2018-04-10 15:56:17,597 INFO L87 Difference]: Start difference. First operand 1218 states and 1386 transitions. Second operand 16 states. [2018-04-10 15:56:18,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:56:18,456 INFO L93 Difference]: Finished difference Result 1277 states and 1473 transitions. [2018-04-10 15:56:18,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 15:56:18,457 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 219 [2018-04-10 15:56:18,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:56:18,458 INFO L225 Difference]: With dead ends: 1277 [2018-04-10 15:56:18,458 INFO L226 Difference]: Without dead ends: 1277 [2018-04-10 15:56:18,458 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=486, Unknown=12, NotChecked=0, Total=600 [2018-04-10 15:56:18,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2018-04-10 15:56:18,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1145. [2018-04-10 15:56:18,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2018-04-10 15:56:18,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1301 transitions. [2018-04-10 15:56:18,466 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1301 transitions. Word has length 219 [2018-04-10 15:56:18,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:56:18,467 INFO L459 AbstractCegarLoop]: Abstraction has 1145 states and 1301 transitions. [2018-04-10 15:56:18,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 15:56:18,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1301 transitions. [2018-04-10 15:56:18,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-04-10 15:56:18,467 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:56:18,467 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:56:18,468 INFO L408 AbstractCegarLoop]: === Iteration 79 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:56:18,468 INFO L82 PathProgramCache]: Analyzing trace with hash 190546496, now seen corresponding path program 1 times [2018-04-10 15:56:18,468 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:56:18,468 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:56:18,468 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:18,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:18,468 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:18,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:56:18,493 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:56:18,493 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:56:18,493 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:56:18,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:18,594 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:56:18,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:56:18,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:18,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:18,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 15:56:18,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:56:18,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:56:18,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:18,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:18,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:18,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-10 15:56:18,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:56:18,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:18,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:56:18,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:18,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:18,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 15:56:18,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:18,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:18,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-10 15:56:18,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:18,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:18,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:18,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-10 15:56:18,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:18,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:18,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-04-10 15:56:18,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:18,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:18,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 15:56:18,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 15:56:18,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:18,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:38 [2018-04-10 15:56:18,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2018-04-10 15:56:18,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:56:18,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:18,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:18,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2018-04-10 15:56:18,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:56:18,881 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:18,892 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:18,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2018-04-10 15:56:18,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:56:18,921 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:18,929 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:18,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-04-10 15:56:18,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:56:18,954 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:18,962 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:18,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:18,989 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:105, output treesize:87 [2018-04-10 15:56:19,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 73 [2018-04-10 15:56:19,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 65 [2018-04-10 15:56:19,053 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:19,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2018-04-10 15:56:19,098 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:19,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:19,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 67 [2018-04-10 15:56:19,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 61 [2018-04-10 15:56:19,192 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:19,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-04-10 15:56:19,231 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:19,257 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:19,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 83 [2018-04-10 15:56:19,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 62 [2018-04-10 15:56:19,329 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:19,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2018-04-10 15:56:19,358 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:19,375 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:19,377 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:19,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 58 [2018-04-10 15:56:19,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-10 15:56:19,379 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:19,387 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:19,437 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:19,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 54 [2018-04-10 15:56:19,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-10 15:56:19,439 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:19,447 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:19,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 75 [2018-04-10 15:56:19,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2018-04-10 15:56:19,460 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:19,500 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:19,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-04-10 15:56:19,543 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 10 variables, input treesize:119, output treesize:199 [2018-04-10 15:56:19,817 WARN L148 SmtUtils]: Spent 243ms on a formula simplification that was a NOOP. DAG size: 86 [2018-04-10 15:56:19,822 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 15:56:19,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:19,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:19,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:19,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 80 [2018-04-10 15:56:19,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:19,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:19,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:19,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-04-10 15:56:19,883 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:19,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 71 [2018-04-10 15:56:19,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 15:56:19,926 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:19,934 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:19,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 59 [2018-04-10 15:56:19,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 15:56:19,937 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:19,944 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:19,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:19,962 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 13 variables, input treesize:259, output treesize:121 [2018-04-10 15:56:20,697 WARN L148 SmtUtils]: Spent 709ms on a formula simplification that was a NOOP. DAG size: 57 [2018-04-10 15:56:20,925 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:20,925 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:20,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 92 [2018-04-10 15:56:20,929 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:20,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-10 15:56:20,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:20,943 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:20,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2018-04-10 15:56:20,944 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:20,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:20,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-04-10 15:56:20,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 15:56:20,983 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:20,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 15:56:20,992 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:20,999 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:21,022 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:21,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 80 [2018-04-10 15:56:21,026 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:21,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2018-04-10 15:56:21,026 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:21,040 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:21,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-10 15:56:21,041 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:21,051 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:21,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2018-04-10 15:56:21,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 15:56:21,081 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:21,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 15:56:21,089 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:21,096 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:21,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:21,111 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 14 variables, input treesize:185, output treesize:33 [2018-04-10 15:56:21,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2018-04-10 15:56:21,361 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:56:21,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-04-10 15:56:21,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 15:56:21,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 15:56:21,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2018-04-10 15:56:21,362 INFO L87 Difference]: Start difference. First operand 1145 states and 1301 transitions. Second operand 25 states. [2018-04-10 15:56:23,021 WARN L151 SmtUtils]: Spent 1083ms on a formula simplification. DAG size of input: 94 DAG size of output 93 [2018-04-10 15:56:24,502 WARN L151 SmtUtils]: Spent 1162ms on a formula simplification. DAG size of input: 64 DAG size of output 61 [2018-04-10 15:56:25,363 WARN L151 SmtUtils]: Spent 771ms on a formula simplification. DAG size of input: 97 DAG size of output 87 [2018-04-10 15:56:26,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:56:26,336 INFO L93 Difference]: Finished difference Result 1227 states and 1387 transitions. [2018-04-10 15:56:26,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-10 15:56:26,337 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 221 [2018-04-10 15:56:26,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:56:26,339 INFO L225 Difference]: With dead ends: 1227 [2018-04-10 15:56:26,339 INFO L226 Difference]: Without dead ends: 1227 [2018-04-10 15:56:26,339 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 195 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=171, Invalid=1635, Unknown=0, NotChecked=0, Total=1806 [2018-04-10 15:56:26,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2018-04-10 15:56:26,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1183. [2018-04-10 15:56:26,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2018-04-10 15:56:26,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1344 transitions. [2018-04-10 15:56:26,352 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1344 transitions. Word has length 221 [2018-04-10 15:56:26,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:56:26,352 INFO L459 AbstractCegarLoop]: Abstraction has 1183 states and 1344 transitions. [2018-04-10 15:56:26,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 15:56:26,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1344 transitions. [2018-04-10 15:56:26,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-04-10 15:56:26,353 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:56:26,353 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 15:56:26,353 INFO L408 AbstractCegarLoop]: === Iteration 80 === [__U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__appendErr14RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr10RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr28RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr2RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr38RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr20RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr18RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr31RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr22RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr35RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr4RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr12RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr21RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr25RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr7RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr15RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr19RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr37RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr11RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr3RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr8RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr29RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr32RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr6RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr16RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr14RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr34RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr39RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr24RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr26RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr9RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr5RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr36RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr17RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr27RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr30RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr13RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr23RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__create_dataErr33RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr1RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr3AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr4AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr0RequiresViolation, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr2AssertViolationMEMORY_FREE, __U_MULTI_fcomplex_data_creation_test___false_valid_memtrack_i__freeDataErr5AssertViolationMEMORY_FREE]=== [2018-04-10 15:56:26,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1568408321, now seen corresponding path program 1 times [2018-04-10 15:56:26,354 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:56:26,354 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:56:26,354 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:26,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:26,355 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:56:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:26,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:56:26,390 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:56:26,390 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:56:26,391 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:56:26,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:56:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:56:26,502 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:56:26,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:56:26,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:26,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:26,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 15:56:26,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 15:56:26,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 15:56:26,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:26,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:26,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:26,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-04-10 15:56:26,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:26,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:26,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:26,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 48 [2018-04-10 15:56:26,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:26,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:26,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:44 [2018-04-10 15:56:26,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-04-10 15:56:26,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 15:56:26,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:26,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:26,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:26,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:53 [2018-04-10 15:56:26,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2018-04-10 15:56:26,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:26,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 39 [2018-04-10 15:56:26,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:26,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:26,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:26,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:77 [2018-04-10 15:56:26,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2018-04-10 15:56:26,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2018-04-10 15:56:26,760 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:26,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:26,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:26,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:62 [2018-04-10 15:56:26,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:26,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:26,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:26,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-04-10 15:56:26,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:26,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:26,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:83, output treesize:76 [2018-04-10 15:56:26,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 65 [2018-04-10 15:56:26,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2018-04-10 15:56:26,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:26,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2018-04-10 15:56:26,944 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 15:56:26,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:56:26,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:56:26,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:56:27,047 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:27,049 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:27,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:27,078 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:95, output treesize:200 [2018-04-10 15:56:27,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 113 [2018-04-10 15:56:27,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 112 [2018-04-10 15:56:27,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:27,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 89 [2018-04-10 15:56:27,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:27,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:27,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 129 treesize of output 143 [2018-04-10 15:56:27,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 133 [2018-04-10 15:56:27,371 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:27,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 125 [2018-04-10 15:56:27,585 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 15:56:27,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 99 treesize of output 117 [2018-04-10 15:56:27,735 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-04-10 15:56:27,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 113 treesize of output 111 [2018-04-10 15:56:27,956 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:28,141 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 7 xjuncts. [2018-04-10 15:56:28,374 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:28,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 100 [2018-04-10 15:56:28,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-10 15:56:28,376 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:28,392 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:28,393 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:28,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 94 [2018-04-10 15:56:28,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-10 15:56:28,396 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:28,410 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:28,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 135 [2018-04-10 15:56:28,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 119 [2018-04-10 15:56:28,424 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:28,509 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:28,511 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:28,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 104 [2018-04-10 15:56:28,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-10 15:56:28,513 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:28,531 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:28,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 118 [2018-04-10 15:56:28,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-04-10 15:56:28,536 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:28,556 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:28,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 149 [2018-04-10 15:56:28,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 133 [2018-04-10 15:56:28,571 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:28,669 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:28,671 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:28,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 90 [2018-04-10 15:56:28,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-10 15:56:28,673 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:28,689 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:28,943 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:28,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 82 [2018-04-10 15:56:28,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-10 15:56:28,945 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:28,959 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:28,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 132 [2018-04-10 15:56:28,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 116 [2018-04-10 15:56:28,975 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:29,031 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:29,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 15 dim-0 vars, and 9 xjuncts. [2018-04-10 15:56:29,242 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 8 variables, input treesize:242, output treesize:927 [2018-04-10 15:56:29,505 WARN L151 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 249 DAG size of output 171 [2018-04-10 15:56:29,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:29,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:29,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 130 [2018-04-10 15:56:29,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:29,607 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:29,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:29,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 156 [2018-04-10 15:56:29,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:29,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:29,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:29,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 143 [2018-04-10 15:56:29,665 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:29,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 5 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-10 15:56:29,813 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:624, output treesize:406 [2018-04-10 15:56:30,148 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:30,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:30,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 191 [2018-04-10 15:56:30,152 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:30,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 15:56:30,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:30,178 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:30,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 15:56:30,178 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:30,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:30,264 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:30,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:30,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 157 [2018-04-10 15:56:30,268 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:30,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 15:56:30,269 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:30,289 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:30,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 15:56:30,290 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:30,305 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:30,363 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:30,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:30,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 170 [2018-04-10 15:56:30,367 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:30,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 15:56:30,368 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:30,388 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:30,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 15:56:30,388 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:30,405 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:56:30,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 3 dim-2 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2018-04-10 15:56:30,461 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 17 variables, input treesize:502, output treesize:394 [2018-04-10 15:56:34,867 WARN L148 SmtUtils]: Spent 4239ms on a formula simplification that was a NOOP. DAG size: 119 [2018-04-10 15:56:35,028 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:35,029 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:35,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 142 treesize of output 110 [2018-04-10 15:56:35,052 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 92 [2018-04-10 15:56:35,053 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:35,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 79 [2018-04-10 15:56:35,163 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 15:56:35,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 97 [2018-04-10 15:56:35,265 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-04-10 15:56:35,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 75 [2018-04-10 15:56:35,270 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 15:56:35,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 49 [2018-04-10 15:56:35,420 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:35,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2018-04-10 15:56:35,421 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:35,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2018-04-10 15:56:35,423 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:35,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2018-04-10 15:56:35,424 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:35,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2018-04-10 15:56:35,426 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:35,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 82 [2018-04-10 15:56:35,545 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:35,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 76 [2018-04-10 15:56:35,666 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:35,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2018-04-10 15:56:35,782 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:35,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 61 [2018-04-10 15:56:35,903 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:35,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 55 [2018-04-10 15:56:35,904 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:36,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2018-04-10 15:56:36,017 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:36,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-04-10 15:56:36,117 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:36,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2018-04-10 15:56:36,119 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:36,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 10 dim-1 vars, End of recursive call: 7 dim-0 vars, and 8 xjuncts. [2018-04-10 15:56:36,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:36,358 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:36,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:36,359 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:36,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:36,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 115 [2018-04-10 15:56:36,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:36,366 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:36,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-04-10 15:56:36,368 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:36,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 15:56:36,386 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:36,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 15:56:36,395 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:36,403 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:36,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:36,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:36,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:36,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:36,528 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:36,528 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:56:36,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:56:36,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 101 [2018-04-10 15:56:36,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2018-04-10 15:56:36,535 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-10 15:56:36,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-04-10 15:56:36,549 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:36,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-04-10 15:56:36,559 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:36,568 INFO L267 ElimStorePlain]: Start of recursive call 24: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:56:36,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-2 vars, End of recursive call: 28 dim-0 vars, and 10 xjuncts. [2018-04-10 15:56:36,682 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 14 variables, input treesize:402, output treesize:366 [2018-04-10 15:56:37,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 59 proven. 38 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2018-04-10 15:56:37,064 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:56:37,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-10 15:56:37,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-10 15:56:37,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-10 15:56:37,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=782, Unknown=1, NotChecked=0, Total=870 [2018-04-10 15:56:37,064 INFO L87 Difference]: Start difference. First operand 1183 states and 1344 transitions. Second operand 30 states. [2018-04-10 15:56:41,693 WARN L151 SmtUtils]: Spent 3554ms on a formula simplification. DAG size of input: 79 DAG size of output 73 [2018-04-10 15:56:42,189 WARN L151 SmtUtils]: Spent 206ms on a formula simplification. DAG size of input: 186 DAG size of output 180 [2018-04-10 15:56:58,078 WARN L148 SmtUtils]: Spent 15387ms on a formula simplification that was a NOOP. DAG size: 195 Received shutdown request... [2018-04-10 15:57:28,817 WARN L148 SmtUtils]: Spent 30641ms on a formula simplification that was a NOOP. DAG size: 237 [2018-04-10 15:57:28,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-10 15:57:28,818 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 15:57:28,823 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 15:57:28,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 03:57:28 BoogieIcfgContainer [2018-04-10 15:57:28,824 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 15:57:28,824 INFO L168 Benchmark]: Toolchain (without parser) took 175803.74 ms. Allocated memory was 404.2 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 338.1 MB in the beginning and 1.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. [2018-04-10 15:57:28,825 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 404.2 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 15:57:28,825 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.62 ms. Allocated memory is still 404.2 MB. Free memory was 338.1 MB in the beginning and 310.3 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. [2018-04-10 15:57:28,825 INFO L168 Benchmark]: Boogie Preprocessor took 45.94 ms. Allocated memory is still 404.2 MB. Free memory was 310.3 MB in the beginning and 307.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-10 15:57:28,826 INFO L168 Benchmark]: RCFGBuilder took 570.88 ms. Allocated memory was 404.2 MB in the beginning and 616.6 MB in the end (delta: 212.3 MB). Free memory was 307.6 MB in the beginning and 517.4 MB in the end (delta: -209.7 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB. [2018-04-10 15:57:28,826 INFO L168 Benchmark]: TraceAbstraction took 174894.23 ms. Allocated memory was 616.6 MB in the beginning and 1.9 GB in the end (delta: 1.3 GB). Free memory was 517.4 MB in the beginning and 1.8 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-04-10 15:57:28,827 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.15 ms. Allocated memory is still 404.2 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 289.62 ms. Allocated memory is still 404.2 MB. Free memory was 338.1 MB in the beginning and 310.3 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 45.94 ms. Allocated memory is still 404.2 MB. Free memory was 310.3 MB in the beginning and 307.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 570.88 ms. Allocated memory was 404.2 MB in the beginning and 616.6 MB in the end (delta: 212.3 MB). Free memory was 307.6 MB in the beginning and 517.4 MB in the end (delta: -209.7 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 174894.23 ms. Allocated memory was 616.6 MB in the beginning and 1.9 GB in the end (delta: 1.3 GB). Free memory was 517.4 MB in the beginning and 1.8 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 581]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 581]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 581]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 577]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 583]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 577]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 581]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 581]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 581]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 577]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 577]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 583]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 592]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 592). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 595]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 596]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 596). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 594]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 595]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 586]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 586). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 594]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 585]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 585). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 593]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 593]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 592]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 592). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 594]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 595]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 595]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 596]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 596). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 586]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 586). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 593]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 594]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 593]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 561]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 567]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 558]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 558). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 541]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 562]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 559]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 564]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 558]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 558). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 559]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 561]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 563]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 564]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 567]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 541]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 559]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 562]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 559]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 563]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 572]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 572]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 573]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 572]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 572]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 573]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (1183states) and interpolant automaton (currently 28 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (302 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 225 locations, 91 error locations. TIMEOUT Result, 174.8s OverallTime, 80 OverallIterations, 21 TraceHistogramMax, 117.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11918 SDtfs, 9817 SDslu, 67268 SDs, 0 SdLazy, 48378 SolverSat, 1029 SolverUnsat, 641 SolverUnknown, 0 SolverNotchecked, 30.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10120 GetRequests, 8694 SyntacticMatches, 21 SemanticMatches, 1405 ConstructedPredicates, 50 IntricatePredicates, 0 DeprecatedPredicates, 6445 ImplicationChecksByTransitivity, 102.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1218occurred in iteration=77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 79 MinimizatonAttempts, 1989 StatesRemovedByMinimization, 72 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 51.7s InterpolantComputationTime, 21434 NumberOfCodeBlocks, 20678 NumberOfCodeBlocksAsserted, 137 NumberOfCheckSat, 14201 ConstructedInterpolants, 5195 QuantifiedInterpolants, 40510204 SizeOfPredicates, 600 NumberOfNonLiveVariables, 29207 ConjunctsInSsa, 1816 ConjunctsInUnsatCore, 98 InterpolantComputations, 61 PerfectInterpolantSequences, 66409/79463 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/complex_data_creation_test01_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_15-57-28-834.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test01_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_15-57-28-834.csv Completed graceful shutdown