java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 17:25:14,111 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 17:25:14,112 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 17:25:14,124 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 17:25:14,124 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 17:25:14,125 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 17:25:14,125 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 17:25:14,127 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 17:25:14,128 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 17:25:14,129 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 17:25:14,130 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 17:25:14,130 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 17:25:14,131 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 17:25:14,132 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 17:25:14,132 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 17:25:14,134 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 17:25:14,135 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 17:25:14,141 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 17:25:14,142 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 17:25:14,143 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 17:25:14,145 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 17:25:14,145 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 17:25:14,145 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 17:25:14,146 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 17:25:14,146 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 17:25:14,147 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 17:25:14,147 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 17:25:14,148 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 17:25:14,148 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 17:25:14,148 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 17:25:14,149 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 17:25:14,149 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-11 17:25:14,168 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 17:25:14,168 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 17:25:14,169 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 17:25:14,169 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 17:25:14,170 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 17:25:14,170 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 17:25:14,170 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 17:25:14,170 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 17:25:14,170 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 17:25:14,170 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 17:25:14,170 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 17:25:14,170 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 17:25:14,171 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 17:25:14,171 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 17:25:14,171 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 17:25:14,171 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 17:25:14,171 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 17:25:14,171 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 17:25:14,171 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 17:25:14,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 17:25:14,171 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 17:25:14,172 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 17:25:14,172 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 17:25:14,172 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 17:25:14,197 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 17:25:14,205 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 17:25:14,207 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 17:25:14,208 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 17:25:14,209 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 17:25:14,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,508 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG638465d47 [2018-04-11 17:25:14,643 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 17:25:14,643 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 17:25:14,644 INFO L168 CDTParser]: Scanning dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,651 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 17:25:14,651 INFO L215 ultiparseSymbolTable]: [2018-04-11 17:25:14,652 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 17:25:14,652 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,652 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 17:25:14,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__register_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsword_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ssize_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_once_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__off_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____nlink_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_attr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int8_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__timer_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____sig_atomic_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__wchar_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____socklen_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fd_mask in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____useconds_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_condattr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsfilcnt64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ldiv_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ino_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____time_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____timer_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_mutexattr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____key_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint8_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____daddr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__loff_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int8_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsfilcnt_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsblkcnt64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____rlim_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__quad_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int16_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fsid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__mode_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_cond_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_short in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____clock_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_spinlock_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__div_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__size_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____clockid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__suseconds_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____loff_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__uid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fd_set in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____mode_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__blksize_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__clock_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint32_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____intptr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_long in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int16_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____ino_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_short in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__gid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__SLL in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____sigset_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__caddr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int32_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_barrierattr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__blkcnt_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__sigset_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ulong in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_long in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____caddr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_key_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_char in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____dev_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsblkcnt_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int16_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__lldiv_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint16_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____id_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____quad_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__daddr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,657 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____qaddr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,657 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____gid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,657 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____blksize_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,657 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____syscall_ulong_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,657 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_quad_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,657 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_barrier_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,657 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fsblkcnt_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,657 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____pid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,657 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_quad_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,657 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____off64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,657 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____suseconds_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,658 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ushort in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,658 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_char in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,658 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____rlim64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,658 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,658 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____blkcnt_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,658 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fd_mask in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,658 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_mutex_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,658 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int32_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,658 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____syscall_slong_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,658 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__time_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,658 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_int in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,658 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____pthread_slist_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,659 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int8_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,659 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__idtype_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,659 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__key_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,659 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__clockid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,659 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____ssize_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,659 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_rwlock_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,659 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__uint in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,659 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__nlink_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,659 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int32_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,659 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__id_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,659 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____off_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,659 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__dev_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,660 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fsfilcnt_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,660 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_rwlockattr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,660 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____blkcnt64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,660 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,660 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____ino64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:14,674 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG638465d47 [2018-04-11 17:25:14,678 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 17:25:14,679 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 17:25:14,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 17:25:14,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 17:25:14,685 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 17:25:14,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 05:25:14" (1/1) ... [2018-04-11 17:25:14,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b1b39bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:25:14, skipping insertion in model container [2018-04-11 17:25:14,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 05:25:14" (1/1) ... [2018-04-11 17:25:14,697 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 17:25:14,720 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 17:25:14,853 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 17:25:14,893 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 17:25:14,899 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-11 17:25:14,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:25:14 WrapperNode [2018-04-11 17:25:14,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 17:25:14,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 17:25:14,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 17:25:14,937 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 17:25:14,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:25:14" (1/1) ... [2018-04-11 17:25:14,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:25:14" (1/1) ... [2018-04-11 17:25:14,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:25:14" (1/1) ... [2018-04-11 17:25:14,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:25:14" (1/1) ... [2018-04-11 17:25:14,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:25:14" (1/1) ... [2018-04-11 17:25:14,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:25:14" (1/1) ... [2018-04-11 17:25:14,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:25:14" (1/1) ... [2018-04-11 17:25:14,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 17:25:14,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 17:25:14,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 17:25:14,983 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 17:25:14,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:25:14" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 17:25:15,069 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 17:25:15,069 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 17:25:15,069 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 17:25:15,069 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 17:25:15,069 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 17:25:15,069 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 17:25:15,069 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 17:25:15,069 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 17:25:15,069 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 17:25:15,069 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 17:25:15,069 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 17:25:15,069 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 17:25:15,070 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 17:25:15,070 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 17:25:15,070 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 17:25:15,070 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 17:25:15,070 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 17:25:15,070 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 17:25:15,070 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 17:25:15,070 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 17:25:15,070 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 17:25:15,071 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 17:25:15,071 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 17:25:15,071 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 17:25:15,071 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 17:25:15,071 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 17:25:15,071 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 17:25:15,071 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 17:25:15,071 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 17:25:15,072 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 17:25:15,072 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 17:25:15,072 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 17:25:15,072 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 17:25:15,072 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 17:25:15,072 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 17:25:15,072 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 17:25:15,072 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 17:25:15,072 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 17:25:15,072 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 17:25:15,073 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 17:25:15,073 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 17:25:15,073 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 17:25:15,073 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 17:25:15,073 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 17:25:15,073 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 17:25:15,073 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 17:25:15,073 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 17:25:15,073 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 17:25:15,074 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 17:25:15,074 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 17:25:15,074 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 17:25:15,074 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 17:25:15,074 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 17:25:15,074 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 17:25:15,074 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 17:25:15,074 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 17:25:15,074 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 17:25:15,074 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 17:25:15,075 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 17:25:15,075 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 17:25:15,075 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 17:25:15,075 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-11 17:25:15,075 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 17:25:15,075 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 17:25:15,075 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-11 17:25:15,075 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 17:25:15,075 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 17:25:15,075 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-11 17:25:15,076 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 17:25:15,076 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 17:25:15,076 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 17:25:15,076 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 17:25:15,076 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 17:25:15,076 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 17:25:15,076 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 17:25:15,076 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 17:25:15,076 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 17:25:15,076 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 17:25:15,077 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 17:25:15,077 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 17:25:15,077 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 17:25:15,077 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 17:25:15,077 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 17:25:15,077 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 17:25:15,077 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 17:25:15,077 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 17:25:15,077 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 17:25:15,077 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 17:25:15,078 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 17:25:15,078 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 17:25:15,078 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 17:25:15,078 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 17:25:15,078 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 17:25:15,078 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 17:25:15,078 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 17:25:15,078 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 17:25:15,078 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 17:25:15,078 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 17:25:15,079 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 17:25:15,079 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 17:25:15,079 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 17:25:15,079 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 17:25:15,079 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 17:25:15,079 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 17:25:15,079 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 17:25:15,079 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 17:25:15,079 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 17:25:15,079 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 17:25:15,079 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 17:25:15,080 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 17:25:15,080 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 17:25:15,080 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 17:25:15,080 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 17:25:15,080 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 17:25:15,080 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 17:25:15,080 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 17:25:15,080 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 17:25:15,080 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 17:25:15,496 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 17:25:15,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 05:25:15 BoogieIcfgContainer [2018-04-11 17:25:15,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 17:25:15,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 17:25:15,497 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 17:25:15,499 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 17:25:15,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 05:25:14" (1/3) ... [2018-04-11 17:25:15,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71734559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 05:25:15, skipping insertion in model container [2018-04-11 17:25:15,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:25:14" (2/3) ... [2018-04-11 17:25:15,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71734559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 05:25:15, skipping insertion in model container [2018-04-11 17:25:15,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 05:25:15" (3/3) ... [2018-04-11 17:25:15,502 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:15,508 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 17:25:15,514 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 57 error locations. [2018-04-11 17:25:15,539 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 17:25:15,540 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 17:25:15,540 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 17:25:15,540 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 17:25:15,540 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 17:25:15,540 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 17:25:15,540 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 17:25:15,540 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 17:25:15,540 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 17:25:15,541 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 17:25:15,551 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2018-04-11 17:25:15,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 17:25:15,558 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:15,558 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:15,558 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:15,561 INFO L82 PathProgramCache]: Analyzing trace with hash -401927193, now seen corresponding path program 1 times [2018-04-11 17:25:15,562 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:15,562 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:15,595 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:15,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:15,595 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:15,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:15,666 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:25:15,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 17:25:15,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 17:25:15,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 17:25:15,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 17:25:15,679 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 4 states. [2018-04-11 17:25:15,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:15,867 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions. [2018-04-11 17:25:15,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 17:25:15,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 17:25:15,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:15,877 INFO L225 Difference]: With dead ends: 179 [2018-04-11 17:25:15,878 INFO L226 Difference]: Without dead ends: 170 [2018-04-11 17:25:15,879 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:25:15,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-04-11 17:25:15,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 126. [2018-04-11 17:25:15,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-11 17:25:15,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 133 transitions. [2018-04-11 17:25:15,914 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 133 transitions. Word has length 8 [2018-04-11 17:25:15,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:15,915 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 133 transitions. [2018-04-11 17:25:15,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 17:25:15,915 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2018-04-11 17:25:15,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 17:25:15,915 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:15,915 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:15,915 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:15,916 INFO L82 PathProgramCache]: Analyzing trace with hash -401927192, now seen corresponding path program 1 times [2018-04-11 17:25:15,916 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:15,916 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:15,917 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:15,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:15,918 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:15,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:15,978 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:25:15,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 17:25:15,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 17:25:15,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 17:25:15,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 17:25:15,980 INFO L87 Difference]: Start difference. First operand 126 states and 133 transitions. Second operand 4 states. [2018-04-11 17:25:16,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:16,099 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-04-11 17:25:16,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 17:25:16,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 17:25:16,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:16,100 INFO L225 Difference]: With dead ends: 153 [2018-04-11 17:25:16,100 INFO L226 Difference]: Without dead ends: 153 [2018-04-11 17:25:16,101 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:25:16,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-11 17:25:16,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 123. [2018-04-11 17:25:16,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 17:25:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2018-04-11 17:25:16,109 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 8 [2018-04-11 17:25:16,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:16,109 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2018-04-11 17:25:16,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 17:25:16,109 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2018-04-11 17:25:16,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 17:25:16,110 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:16,110 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:16,110 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:16,110 INFO L82 PathProgramCache]: Analyzing trace with hash -166598540, now seen corresponding path program 1 times [2018-04-11 17:25:16,111 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:16,111 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:16,112 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:16,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:16,112 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:16,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:16,136 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:25:16,136 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:25:16,137 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:25:16,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:16,176 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:25:16,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:25:16,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:16,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:16,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 17:25:16,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:16,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:16,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 17:25:16,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:16,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:16,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-11 17:25:16,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:16,241 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:25:16,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 17:25:16,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 17:25:16,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 17:25:16,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 17:25:16,242 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 6 states. [2018-04-11 17:25:16,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:16,430 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2018-04-11 17:25:16,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 17:25:16,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-04-11 17:25:16,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:16,431 INFO L225 Difference]: With dead ends: 137 [2018-04-11 17:25:16,431 INFO L226 Difference]: Without dead ends: 137 [2018-04-11 17:25:16,432 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-04-11 17:25:16,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-11 17:25:16,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 118. [2018-04-11 17:25:16,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 17:25:16,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2018-04-11 17:25:16,438 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 16 [2018-04-11 17:25:16,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:16,438 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2018-04-11 17:25:16,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 17:25:16,438 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2018-04-11 17:25:16,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 17:25:16,439 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:16,439 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:16,439 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:16,439 INFO L82 PathProgramCache]: Analyzing trace with hash -166598539, now seen corresponding path program 1 times [2018-04-11 17:25:16,439 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:16,439 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:16,440 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:16,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:16,441 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:16,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:16,456 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:25:16,456 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:25:16,456 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:25:16,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:16,481 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:25:16,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-11 17:25:16,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:16,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:25:16,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:16,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:16,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 17:25:16,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:16,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 17:25:16,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:16,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:16,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:16,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 17:25:16,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:16,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:16,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-04-11 17:25:16,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:16,583 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:25:16,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 17:25:16,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 17:25:16,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 17:25:16,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 17:25:16,584 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand 7 states. [2018-04-11 17:25:16,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:16,955 INFO L93 Difference]: Finished difference Result 206 states and 223 transitions. [2018-04-11 17:25:16,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 17:25:16,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-04-11 17:25:16,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:16,957 INFO L225 Difference]: With dead ends: 206 [2018-04-11 17:25:16,958 INFO L226 Difference]: Without dead ends: 206 [2018-04-11 17:25:16,958 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-11 17:25:16,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-04-11 17:25:16,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 164. [2018-04-11 17:25:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-11 17:25:16,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 194 transitions. [2018-04-11 17:25:16,964 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 194 transitions. Word has length 16 [2018-04-11 17:25:16,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:16,964 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 194 transitions. [2018-04-11 17:25:16,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 17:25:16,964 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 194 transitions. [2018-04-11 17:25:16,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 17:25:16,964 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:16,964 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:16,967 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:16,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1187407017, now seen corresponding path program 1 times [2018-04-11 17:25:16,967 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:16,967 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:16,968 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:16,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:16,968 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:16,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:16,998 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:25:16,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 17:25:16,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 17:25:16,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 17:25:16,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:25:16,999 INFO L87 Difference]: Start difference. First operand 164 states and 194 transitions. Second operand 5 states. [2018-04-11 17:25:17,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:17,159 INFO L93 Difference]: Finished difference Result 279 states and 331 transitions. [2018-04-11 17:25:17,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 17:25:17,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-11 17:25:17,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:17,161 INFO L225 Difference]: With dead ends: 279 [2018-04-11 17:25:17,161 INFO L226 Difference]: Without dead ends: 279 [2018-04-11 17:25:17,161 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 17:25:17,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-04-11 17:25:17,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 163. [2018-04-11 17:25:17,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-04-11 17:25:17,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 192 transitions. [2018-04-11 17:25:17,169 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 192 transitions. Word has length 18 [2018-04-11 17:25:17,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:17,169 INFO L459 AbstractCegarLoop]: Abstraction has 163 states and 192 transitions. [2018-04-11 17:25:17,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 17:25:17,169 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 192 transitions. [2018-04-11 17:25:17,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 17:25:17,170 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:17,170 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:17,170 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:17,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1187407016, now seen corresponding path program 1 times [2018-04-11 17:25:17,170 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:17,170 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:17,171 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:17,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:17,172 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:17,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:17,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:17,221 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:25:17,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 17:25:17,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 17:25:17,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 17:25:17,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:25:17,222 INFO L87 Difference]: Start difference. First operand 163 states and 192 transitions. Second operand 5 states. [2018-04-11 17:25:17,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:17,389 INFO L93 Difference]: Finished difference Result 286 states and 340 transitions. [2018-04-11 17:25:17,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 17:25:17,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-11 17:25:17,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:17,391 INFO L225 Difference]: With dead ends: 286 [2018-04-11 17:25:17,391 INFO L226 Difference]: Without dead ends: 286 [2018-04-11 17:25:17,391 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 17:25:17,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-04-11 17:25:17,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 162. [2018-04-11 17:25:17,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-04-11 17:25:17,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 190 transitions. [2018-04-11 17:25:17,399 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 190 transitions. Word has length 18 [2018-04-11 17:25:17,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:17,399 INFO L459 AbstractCegarLoop]: Abstraction has 162 states and 190 transitions. [2018-04-11 17:25:17,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 17:25:17,400 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 190 transitions. [2018-04-11 17:25:17,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 17:25:17,400 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:17,400 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:17,400 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:17,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1810792676, now seen corresponding path program 1 times [2018-04-11 17:25:17,400 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:17,400 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:17,401 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:17,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:17,401 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:17,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:17,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:17,434 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:25:17,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 17:25:17,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 17:25:17,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 17:25:17,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 17:25:17,435 INFO L87 Difference]: Start difference. First operand 162 states and 190 transitions. Second operand 4 states. [2018-04-11 17:25:17,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:17,510 INFO L93 Difference]: Finished difference Result 179 states and 198 transitions. [2018-04-11 17:25:17,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 17:25:17,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-04-11 17:25:17,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:17,511 INFO L225 Difference]: With dead ends: 179 [2018-04-11 17:25:17,512 INFO L226 Difference]: Without dead ends: 179 [2018-04-11 17:25:17,512 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:25:17,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-04-11 17:25:17,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 161. [2018-04-11 17:25:17,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-11 17:25:17,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 189 transitions. [2018-04-11 17:25:17,515 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 189 transitions. Word has length 19 [2018-04-11 17:25:17,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:17,515 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 189 transitions. [2018-04-11 17:25:17,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 17:25:17,515 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 189 transitions. [2018-04-11 17:25:17,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 17:25:17,516 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:17,516 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:17,516 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:17,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1810792677, now seen corresponding path program 1 times [2018-04-11 17:25:17,516 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:17,516 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:17,517 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:17,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:17,517 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:17,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:17,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:17,569 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:25:17,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 17:25:17,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 17:25:17,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 17:25:17,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 17:25:17,570 INFO L87 Difference]: Start difference. First operand 161 states and 189 transitions. Second operand 4 states. [2018-04-11 17:25:17,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:17,658 INFO L93 Difference]: Finished difference Result 180 states and 201 transitions. [2018-04-11 17:25:17,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 17:25:17,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-04-11 17:25:17,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:17,658 INFO L225 Difference]: With dead ends: 180 [2018-04-11 17:25:17,659 INFO L226 Difference]: Without dead ends: 180 [2018-04-11 17:25:17,659 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:25:17,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-04-11 17:25:17,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 158. [2018-04-11 17:25:17,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-11 17:25:17,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2018-04-11 17:25:17,663 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 19 [2018-04-11 17:25:17,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:17,663 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2018-04-11 17:25:17,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 17:25:17,663 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2018-04-11 17:25:17,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 17:25:17,664 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:17,664 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:17,664 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:17,664 INFO L82 PathProgramCache]: Analyzing trace with hash 29390169, now seen corresponding path program 1 times [2018-04-11 17:25:17,664 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:17,664 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:17,665 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:17,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:17,666 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:17,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:17,680 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:25:17,680 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:25:17,680 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:25:17,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:17,716 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:25:17,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 6 treesize of output 5 [2018-04-11 17:25:17,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:17,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:17,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 17:25:17,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:25:17,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:25:17,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:17,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:17,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:25:17,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:25:17,766 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:17,767 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:17,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:17,773 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:34, output treesize:20 [2018-04-11 17:25:17,783 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-11 17:25:17,784 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 11 treesize of output 7 [2018-04-11 17:25:17,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:17,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:17,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:17,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2018-04-11 17:25:17,808 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-11 17:25:17,811 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 24 treesize of output 23 [2018-04-11 17:25:17,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:17,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:17,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:17,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2018-04-11 17:25:17,850 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2018-04-11 17:25:17,853 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 5 [2018-04-11 17:25:17,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:17,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:17,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:17,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:5 [2018-04-11 17:25:17,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:17,873 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:25:17,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 17:25:17,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 17:25:17,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 17:25:17,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-11 17:25:17,874 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand 11 states. [2018-04-11 17:25:18,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:18,338 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2018-04-11 17:25:18,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 17:25:18,338 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-04-11 17:25:18,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:18,339 INFO L225 Difference]: With dead ends: 185 [2018-04-11 17:25:18,339 INFO L226 Difference]: Without dead ends: 185 [2018-04-11 17:25:18,340 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2018-04-11 17:25:18,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-04-11 17:25:18,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 160. [2018-04-11 17:25:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-11 17:25:18,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 189 transitions. [2018-04-11 17:25:18,344 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 189 transitions. Word has length 22 [2018-04-11 17:25:18,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:18,344 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 189 transitions. [2018-04-11 17:25:18,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 17:25:18,344 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 189 transitions. [2018-04-11 17:25:18,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 17:25:18,345 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:18,345 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:18,345 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:18,345 INFO L82 PathProgramCache]: Analyzing trace with hash 29390170, now seen corresponding path program 1 times [2018-04-11 17:25:18,345 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:18,345 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:18,347 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:18,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:18,347 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:18,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:18,360 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:25:18,360 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:25:18,360 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:25:18,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:18,390 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:25:18,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:25:18,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:18,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:18,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 17:25:18,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:25:18,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:25:18,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:18,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:18,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:25:18,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:25:18,449 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:18,451 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:18,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:18,458 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2018-04-11 17:25:18,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, 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-11 17:25:18,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:18,512 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 21 treesize of output 28 [2018-04-11 17:25:18,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:18,536 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-11 17:25:18,537 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:18,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:18,574 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 28 treesize of output 56 [2018-04-11 17:25:18,583 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:18,585 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 30 treesize of output 39 [2018-04-11 17:25:18,586 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:18,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-04-11 17:25:18,611 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:18,623 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:18,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:18,634 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:53, output treesize:57 [2018-04-11 17:25:18,671 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 91 [2018-04-11 17:25:18,676 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 84 treesize of output 65 [2018-04-11 17:25:18,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:18,699 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 49 [2018-04-11 17:25:18,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:18,723 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:18,725 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 76 treesize of output 57 [2018-04-11 17:25:18,726 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:18,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 17:25:18,793 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 58 treesize of output 44 [2018-04-11 17:25:18,796 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 28 treesize of output 7 [2018-04-11 17:25:18,796 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:18,804 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 7 treesize of output 3 [2018-04-11 17:25:18,804 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:18,807 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:18,813 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 54 treesize of output 48 [2018-04-11 17:25:18,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:18,817 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2018-04-11 17:25:18,817 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:18,829 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:18,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:18,835 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:107, output treesize:9 [2018-04-11 17:25:18,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:18,849 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:25:18,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 17:25:18,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 17:25:18,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 17:25:18,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-04-11 17:25:18,849 INFO L87 Difference]: Start difference. First operand 160 states and 189 transitions. Second operand 11 states. [2018-04-11 17:25:19,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:19,329 INFO L93 Difference]: Finished difference Result 208 states and 231 transitions. [2018-04-11 17:25:19,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 17:25:19,330 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-04-11 17:25:19,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:19,330 INFO L225 Difference]: With dead ends: 208 [2018-04-11 17:25:19,331 INFO L226 Difference]: Without dead ends: 208 [2018-04-11 17:25:19,331 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=219, Invalid=431, Unknown=0, NotChecked=0, Total=650 [2018-04-11 17:25:19,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-04-11 17:25:19,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 155. [2018-04-11 17:25:19,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-11 17:25:19,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 183 transitions. [2018-04-11 17:25:19,335 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 183 transitions. Word has length 22 [2018-04-11 17:25:19,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:19,335 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 183 transitions. [2018-04-11 17:25:19,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 17:25:19,335 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 183 transitions. [2018-04-11 17:25:19,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 17:25:19,336 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:19,336 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:19,336 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:19,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1340356530, now seen corresponding path program 1 times [2018-04-11 17:25:19,337 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:19,337 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:19,338 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:19,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:19,338 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:19,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:19,350 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:25:19,350 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:25:19,350 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:25:19,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:19,375 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:25:19,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:25:19,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:25:19,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:19,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:19,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:25:19,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:25:19,398 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:19,399 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:19,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:19,403 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-11 17:25:19,414 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 21 treesize of output 16 [2018-04-11 17:25:19,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:19,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 17:25:19,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:19,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:19,430 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 21 treesize of output 16 [2018-04-11 17:25:19,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:19,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 17:25:19,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:19,435 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:19,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:19,442 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-11 17:25:19,472 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 24 treesize of output 18 [2018-04-11 17:25:19,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:19,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:19,475 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:19,476 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 18 treesize of output 19 [2018-04-11 17:25:19,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:19,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:19,487 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 24 treesize of output 18 [2018-04-11 17:25:19,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:19,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:19,490 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:19,490 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 18 treesize of output 19 [2018-04-11 17:25:19,491 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:19,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:19,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:19,499 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:59, output treesize:7 [2018-04-11 17:25:19,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:19,505 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:25:19,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 17:25:19,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 17:25:19,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 17:25:19,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-11 17:25:19,506 INFO L87 Difference]: Start difference. First operand 155 states and 183 transitions. Second operand 8 states. [2018-04-11 17:25:19,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:19,752 INFO L93 Difference]: Finished difference Result 178 states and 199 transitions. [2018-04-11 17:25:19,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 17:25:19,752 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-04-11 17:25:19,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:19,753 INFO L225 Difference]: With dead ends: 178 [2018-04-11 17:25:19,753 INFO L226 Difference]: Without dead ends: 178 [2018-04-11 17:25:19,753 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-04-11 17:25:19,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-11 17:25:19,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 160. [2018-04-11 17:25:19,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-11 17:25:19,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 189 transitions. [2018-04-11 17:25:19,756 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 189 transitions. Word has length 24 [2018-04-11 17:25:19,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:19,756 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 189 transitions. [2018-04-11 17:25:19,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 17:25:19,756 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 189 transitions. [2018-04-11 17:25:19,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 17:25:19,757 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:19,757 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:19,757 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:19,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1381455388, now seen corresponding path program 1 times [2018-04-11 17:25:19,757 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:19,757 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:19,758 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:19,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:19,759 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:19,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:19,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:19,808 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:25:19,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 17:25:19,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 17:25:19,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 17:25:19,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:25:19,809 INFO L87 Difference]: Start difference. First operand 160 states and 189 transitions. Second operand 5 states. [2018-04-11 17:25:19,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:19,914 INFO L93 Difference]: Finished difference Result 196 states and 215 transitions. [2018-04-11 17:25:19,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 17:25:19,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-11 17:25:19,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:19,915 INFO L225 Difference]: With dead ends: 196 [2018-04-11 17:25:19,915 INFO L226 Difference]: Without dead ends: 196 [2018-04-11 17:25:19,916 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 17:25:19,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-04-11 17:25:19,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 138. [2018-04-11 17:25:19,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-11 17:25:19,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 154 transitions. [2018-04-11 17:25:19,919 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 154 transitions. Word has length 25 [2018-04-11 17:25:19,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:19,919 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 154 transitions. [2018-04-11 17:25:19,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 17:25:19,919 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 154 transitions. [2018-04-11 17:25:19,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-11 17:25:19,920 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:19,920 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:19,920 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:19,920 INFO L82 PathProgramCache]: Analyzing trace with hash 667065395, now seen corresponding path program 1 times [2018-04-11 17:25:19,920 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:19,920 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:19,921 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:19,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:19,921 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:19,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:19,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:19,973 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:25:19,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 17:25:19,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 17:25:19,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 17:25:19,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 17:25:19,974 INFO L87 Difference]: Start difference. First operand 138 states and 154 transitions. Second operand 6 states. [2018-04-11 17:25:20,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:20,113 INFO L93 Difference]: Finished difference Result 206 states and 226 transitions. [2018-04-11 17:25:20,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 17:25:20,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-04-11 17:25:20,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:20,114 INFO L225 Difference]: With dead ends: 206 [2018-04-11 17:25:20,114 INFO L226 Difference]: Without dead ends: 206 [2018-04-11 17:25:20,114 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-11 17:25:20,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-04-11 17:25:20,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 151. [2018-04-11 17:25:20,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-04-11 17:25:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 171 transitions. [2018-04-11 17:25:20,117 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 171 transitions. Word has length 27 [2018-04-11 17:25:20,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:20,118 INFO L459 AbstractCegarLoop]: Abstraction has 151 states and 171 transitions. [2018-04-11 17:25:20,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 17:25:20,118 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 171 transitions. [2018-04-11 17:25:20,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 17:25:20,118 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:20,119 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:20,119 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:20,119 INFO L82 PathProgramCache]: Analyzing trace with hash -2018605973, now seen corresponding path program 1 times [2018-04-11 17:25:20,119 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:20,119 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:20,120 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:20,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:20,120 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:20,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:20,131 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:25:20,131 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:25:20,131 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:25:20,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:20,152 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:25:20,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:25:20,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:25:20,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:20,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:20,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:20,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-04-11 17:25:20,195 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-11 17:25:20,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 17:25:20,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:20,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:20,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:20,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-04-11 17:25:20,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:20,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:25:20,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 17:25:20,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 17:25:20,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 17:25:20,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 17:25:20,207 INFO L87 Difference]: Start difference. First operand 151 states and 171 transitions. Second operand 9 states. [2018-04-11 17:25:20,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:20,340 INFO L93 Difference]: Finished difference Result 196 states and 217 transitions. [2018-04-11 17:25:20,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 17:25:20,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-04-11 17:25:20,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:20,340 INFO L225 Difference]: With dead ends: 196 [2018-04-11 17:25:20,341 INFO L226 Difference]: Without dead ends: 196 [2018-04-11 17:25:20,341 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2018-04-11 17:25:20,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-04-11 17:25:20,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 155. [2018-04-11 17:25:20,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-11 17:25:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 175 transitions. [2018-04-11 17:25:20,344 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 175 transitions. Word has length 30 [2018-04-11 17:25:20,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:20,344 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 175 transitions. [2018-04-11 17:25:20,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 17:25:20,345 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 175 transitions. [2018-04-11 17:25:20,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 17:25:20,345 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:20,345 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:20,345 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:20,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1797163218, now seen corresponding path program 1 times [2018-04-11 17:25:20,346 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:20,346 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:20,347 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:20,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:20,347 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:20,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:20,357 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:25:20,357 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:25:20,357 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:25:20,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:20,379 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:25:20,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:20,387 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:20,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 17:25:20,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:20,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:20,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-11 17:25:20,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:25:20,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:25:20,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:20,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:20,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:20,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-11 17:25:20,439 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 31 treesize of output 24 [2018-04-11 17:25:20,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:20,443 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 24 treesize of output 33 [2018-04-11 17:25:20,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:20,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:20,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:20,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-04-11 17:25:20,532 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 34 treesize of output 26 [2018-04-11 17:25:20,534 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:20,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:20,549 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 19 [2018-04-11 17:25:20,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:20,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:20,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:20,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-04-11 17:25:20,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:20,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:25:20,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 17:25:20,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 17:25:20,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 17:25:20,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-04-11 17:25:20,584 INFO L87 Difference]: Start difference. First operand 155 states and 175 transitions. Second operand 11 states. [2018-04-11 17:25:21,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:21,001 INFO L93 Difference]: Finished difference Result 185 states and 206 transitions. [2018-04-11 17:25:21,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 17:25:21,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-04-11 17:25:21,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:21,002 INFO L225 Difference]: With dead ends: 185 [2018-04-11 17:25:21,002 INFO L226 Difference]: Without dead ends: 185 [2018-04-11 17:25:21,002 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2018-04-11 17:25:21,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-04-11 17:25:21,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 160. [2018-04-11 17:25:21,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-11 17:25:21,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 182 transitions. [2018-04-11 17:25:21,004 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 182 transitions. Word has length 31 [2018-04-11 17:25:21,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:21,004 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 182 transitions. [2018-04-11 17:25:21,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 17:25:21,004 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 182 transitions. [2018-04-11 17:25:21,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 17:25:21,005 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:21,005 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:21,005 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:21,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1797163219, now seen corresponding path program 1 times [2018-04-11 17:25:21,005 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:21,005 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:21,006 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:21,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:21,006 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:21,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:21,016 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:25:21,016 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:25:21,016 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:25:21,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:21,035 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:25:21,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:25:21,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:21,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:21,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:25:21,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 17:25:21,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:21,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:21,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-04-11 17:25:21,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:25:21,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:25:21,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:21,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:21,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 11 treesize of output 8 [2018-04-11 17:25:21,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:25:21,119 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:21,143 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:21,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:21,155 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:35 [2018-04-11 17:25:21,173 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 23 treesize of output 18 [2018-04-11 17:25:21,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:21,177 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 25 [2018-04-11 17:25:21,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:21,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:21,199 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 21 [2018-04-11 17:25:21,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:21,202 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:21,203 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 21 treesize of output 37 [2018-04-11 17:25:21,203 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:21,209 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:21,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:21,221 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2018-04-11 17:25:21,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 26 treesize of output 20 [2018-04-11 17:25:21,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:21,303 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:21,305 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 15 [2018-04-11 17:25:21,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:21,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:21,327 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 31 treesize of output 23 [2018-04-11 17:25:21,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:21,331 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:21,332 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:21,333 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 23 treesize of output 19 [2018-04-11 17:25:21,333 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:21,339 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:21,347 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-11 17:25:21,347 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:73, output treesize:14 [2018-04-11 17:25:21,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:21,378 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:25:21,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-11 17:25:21,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 17:25:21,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 17:25:21,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-04-11 17:25:21,379 INFO L87 Difference]: Start difference. First operand 160 states and 182 transitions. Second operand 13 states. [2018-04-11 17:25:22,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:22,192 INFO L93 Difference]: Finished difference Result 211 states and 230 transitions. [2018-04-11 17:25:22,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 17:25:22,193 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-04-11 17:25:22,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:22,194 INFO L225 Difference]: With dead ends: 211 [2018-04-11 17:25:22,194 INFO L226 Difference]: Without dead ends: 211 [2018-04-11 17:25:22,194 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2018-04-11 17:25:22,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-04-11 17:25:22,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 162. [2018-04-11 17:25:22,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-04-11 17:25:22,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 183 transitions. [2018-04-11 17:25:22,198 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 183 transitions. Word has length 31 [2018-04-11 17:25:22,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:22,198 INFO L459 AbstractCegarLoop]: Abstraction has 162 states and 183 transitions. [2018-04-11 17:25:22,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 17:25:22,198 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 183 transitions. [2018-04-11 17:25:22,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 17:25:22,199 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:22,199 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:22,199 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:22,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1604260488, now seen corresponding path program 1 times [2018-04-11 17:25:22,199 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:22,199 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:22,200 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:22,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:22,200 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:22,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:22,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:22,319 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:25:22,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 17:25:22,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 17:25:22,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 17:25:22,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-04-11 17:25:22,320 INFO L87 Difference]: Start difference. First operand 162 states and 183 transitions. Second operand 9 states. [2018-04-11 17:25:22,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:22,618 INFO L93 Difference]: Finished difference Result 226 states and 246 transitions. [2018-04-11 17:25:22,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 17:25:22,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-04-11 17:25:22,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:22,619 INFO L225 Difference]: With dead ends: 226 [2018-04-11 17:25:22,619 INFO L226 Difference]: Without dead ends: 226 [2018-04-11 17:25:22,619 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-04-11 17:25:22,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-04-11 17:25:22,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 169. [2018-04-11 17:25:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-04-11 17:25:22,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 192 transitions. [2018-04-11 17:25:22,623 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 192 transitions. Word has length 34 [2018-04-11 17:25:22,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:22,623 INFO L459 AbstractCegarLoop]: Abstraction has 169 states and 192 transitions. [2018-04-11 17:25:22,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 17:25:22,623 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 192 transitions. [2018-04-11 17:25:22,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 17:25:22,624 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:22,624 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:22,624 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:22,624 INFO L82 PathProgramCache]: Analyzing trace with hash 777452042, now seen corresponding path program 1 times [2018-04-11 17:25:22,624 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:22,624 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:22,625 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:22,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:22,625 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:22,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:22,639 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:25:22,639 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:25:22,640 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:25:22,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:22,679 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:25:22,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:22,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:22,694 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 17 treesize of output 24 [2018-04-11 17:25:22,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:22,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:22,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-11 17:25:22,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:25:22,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 8 treesize of output 7 [2018-04-11 17:25:22,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:22,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:22,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:22,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-11 17:25:22,747 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 39 treesize of output 35 [2018-04-11 17:25:22,749 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-11 17:25:22,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:22,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:22,780 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-11 17:25:22,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-11 17:25:22,799 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 38 treesize of output 26 [2018-04-11 17:25:22,804 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 19 treesize of output 10 [2018-04-11 17:25:22,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:22,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 17:25:22,811 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:22,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:22,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:22,819 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-04-11 17:25:22,841 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:22,842 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:25:22,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 17:25:22,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 17:25:22,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 17:25:22,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-04-11 17:25:22,843 INFO L87 Difference]: Start difference. First operand 169 states and 192 transitions. Second operand 9 states. [2018-04-11 17:25:23,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:23,126 INFO L93 Difference]: Finished difference Result 178 states and 203 transitions. [2018-04-11 17:25:23,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 17:25:23,127 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-04-11 17:25:23,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:23,127 INFO L225 Difference]: With dead ends: 178 [2018-04-11 17:25:23,127 INFO L226 Difference]: Without dead ends: 178 [2018-04-11 17:25:23,127 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-04-11 17:25:23,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-11 17:25:23,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 160. [2018-04-11 17:25:23,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-11 17:25:23,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 183 transitions. [2018-04-11 17:25:23,129 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 183 transitions. Word has length 34 [2018-04-11 17:25:23,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:23,130 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 183 transitions. [2018-04-11 17:25:23,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 17:25:23,130 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 183 transitions. [2018-04-11 17:25:23,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 17:25:23,130 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:23,130 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:23,130 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:23,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1756971365, now seen corresponding path program 1 times [2018-04-11 17:25:23,130 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:23,130 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:23,131 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:23,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:23,131 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:23,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:23,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:23,234 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:25:23,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 17:25:23,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 17:25:23,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 17:25:23,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-11 17:25:23,235 INFO L87 Difference]: Start difference. First operand 160 states and 183 transitions. Second operand 11 states. [2018-04-11 17:25:23,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:23,577 INFO L93 Difference]: Finished difference Result 211 states and 229 transitions. [2018-04-11 17:25:23,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 17:25:23,577 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-04-11 17:25:23,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:23,578 INFO L225 Difference]: With dead ends: 211 [2018-04-11 17:25:23,578 INFO L226 Difference]: Without dead ends: 211 [2018-04-11 17:25:23,578 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2018-04-11 17:25:23,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-04-11 17:25:23,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 168. [2018-04-11 17:25:23,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-11 17:25:23,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 191 transitions. [2018-04-11 17:25:23,582 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 191 transitions. Word has length 35 [2018-04-11 17:25:23,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:23,582 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 191 transitions. [2018-04-11 17:25:23,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 17:25:23,582 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 191 transitions. [2018-04-11 17:25:23,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 17:25:23,583 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:23,583 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:23,583 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:23,583 INFO L82 PathProgramCache]: Analyzing trace with hash 854380635, now seen corresponding path program 1 times [2018-04-11 17:25:23,583 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:23,583 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:23,584 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:23,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:23,584 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:23,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:23,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:23,628 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:25:23,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 17:25:23,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 17:25:23,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 17:25:23,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:25:23,629 INFO L87 Difference]: Start difference. First operand 168 states and 191 transitions. Second operand 5 states. [2018-04-11 17:25:23,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:23,696 INFO L93 Difference]: Finished difference Result 204 states and 228 transitions. [2018-04-11 17:25:23,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 17:25:23,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-04-11 17:25:23,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:23,697 INFO L225 Difference]: With dead ends: 204 [2018-04-11 17:25:23,697 INFO L226 Difference]: Without dead ends: 204 [2018-04-11 17:25:23,697 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 17:25:23,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-11 17:25:23,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 177. [2018-04-11 17:25:23,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-04-11 17:25:23,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 204 transitions. [2018-04-11 17:25:23,699 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 204 transitions. Word has length 35 [2018-04-11 17:25:23,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:23,699 INFO L459 AbstractCegarLoop]: Abstraction has 177 states and 204 transitions. [2018-04-11 17:25:23,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 17:25:23,699 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 204 transitions. [2018-04-11 17:25:23,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 17:25:23,700 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:23,700 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:23,700 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:23,700 INFO L82 PathProgramCache]: Analyzing trace with hash 287564991, now seen corresponding path program 1 times [2018-04-11 17:25:23,700 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:23,700 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:23,701 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:23,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:23,701 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:23,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:23,709 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:25:23,709 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:25:23,709 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:25:23,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:23,732 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:25:23,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:25:23,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:23,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:23,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-04-11 17:25:23,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:25:23,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:25:23,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:23,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:23,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:25:23,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:25:23,790 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:23,791 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:23,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:23,800 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-04-11 17:25:23,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-11 17:25:23,813 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 11 treesize of output 7 [2018-04-11 17:25:23,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:23,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:23,822 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-11 17:25:23,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-04-11 17:25:23,857 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-11 17:25:23,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:23,861 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 21 treesize of output 28 [2018-04-11 17:25:23,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:23,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 17:25:23,873 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:23,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:23,885 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-11 17:25:23,885 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:31 [2018-04-11 17:25:23,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:25:23,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:25:23,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:23,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:23,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 30 treesize of output 57 [2018-04-11 17:25:23,982 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 32 treesize of output 40 [2018-04-11 17:25:23,984 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:25:24,078 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 27 treesize of output 26 [2018-04-11 17:25:24,079 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:24,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:24,168 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 4 case distinctions, treesize of input 29 treesize of output 51 [2018-04-11 17:25:24,170 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 17:25:24,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 35 [2018-04-11 17:25:24,247 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 17:25:24,290 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-04-11 17:25:24,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 19 dim-0 vars, and 5 xjuncts. [2018-04-11 17:25:24,338 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:53, output treesize:220 [2018-04-11 17:25:27,526 WARN L151 SmtUtils]: Spent 3160ms on a formula simplification. DAG size of input: 128 DAG size of output 107 [2018-04-11 17:25:27,686 WARN L148 SmtUtils]: Spent 118ms on a formula simplification that was a NOOP. DAG size: 107 [2018-04-11 17:25:27,705 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 62 treesize of output 72 [2018-04-11 17:25:27,709 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 68 treesize of output 63 [2018-04-11 17:25:27,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:27,766 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 63 treesize of output 58 [2018-04-11 17:25:27,767 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:27,810 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 1 case distinctions, treesize of input 58 treesize of output 56 [2018-04-11 17:25:27,811 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 17:25:27,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 17:25:27,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 62 treesize of output 58 [2018-04-11 17:25:27,943 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:27,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 17:25:27,943 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:27,955 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:28,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2018-04-11 17:25:28,041 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:28,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 17:25:28,042 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:28,052 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:28,121 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 57 treesize of output 61 [2018-04-11 17:25:28,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:28,125 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 53 treesize of output 47 [2018-04-11 17:25:28,125 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:28,161 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:28,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 4 dim-2 vars, End of recursive call: 23 dim-0 vars, and 6 xjuncts. [2018-04-11 17:25:28,241 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 19 variables, input treesize:240, output treesize:289 [2018-04-11 17:25:30,540 WARN L151 SmtUtils]: Spent 2258ms on a formula simplification. DAG size of input: 139 DAG size of output 115 [2018-04-11 17:25:30,611 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 41 treesize of output 43 [2018-04-11 17:25:30,624 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 39 treesize of output 32 [2018-04-11 17:25:30,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:30,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:30,665 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:30,668 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 35 treesize of output 30 [2018-04-11 17:25:30,668 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:30,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:30,721 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 64 [2018-04-11 17:25:30,735 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 45 treesize of output 40 [2018-04-11 17:25:30,735 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:30,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:30,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:30,779 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:30,780 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 0 case distinctions, treesize of input 40 treesize of output 44 [2018-04-11 17:25:30,781 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:30,840 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:30,840 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 41 treesize of output 37 [2018-04-11 17:25:30,840 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:30,875 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 1 case distinctions, treesize of input 31 treesize of output 32 [2018-04-11 17:25:30,875 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-11 17:25:30,959 INFO L267 ElimStorePlain]: Start of recursive call 5: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 17:25:31,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 68 [2018-04-11 17:25:31,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:31,019 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:31,020 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 37 treesize of output 32 [2018-04-11 17:25:31,021 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:31,115 INFO L267 ElimStorePlain]: Start of recursive call 10: 13 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:31,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:31,149 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 20 variables, input treesize:158, output treesize:5 [2018-04-11 17:25:31,189 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:31,190 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:25:31,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 17:25:31,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 17:25:31,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 17:25:31,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-04-11 17:25:31,190 INFO L87 Difference]: Start difference. First operand 177 states and 204 transitions. Second operand 15 states. [2018-04-11 17:25:31,846 WARN L151 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 112 DAG size of output 104 [2018-04-11 17:25:32,060 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 166 DAG size of output 113 [2018-04-11 17:25:32,360 WARN L151 SmtUtils]: Spent 215ms on a formula simplification. DAG size of input: 233 DAG size of output 158 [2018-04-11 17:25:32,798 WARN L151 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 225 DAG size of output 96 [2018-04-11 17:25:33,052 WARN L151 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 228 DAG size of output 99 [2018-04-11 17:25:33,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:33,483 INFO L93 Difference]: Finished difference Result 251 states and 278 transitions. [2018-04-11 17:25:33,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 17:25:33,484 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-04-11 17:25:33,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:33,484 INFO L225 Difference]: With dead ends: 251 [2018-04-11 17:25:33,485 INFO L226 Difference]: Without dead ends: 251 [2018-04-11 17:25:33,485 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=257, Invalid=865, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 17:25:33,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-04-11 17:25:33,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 199. [2018-04-11 17:25:33,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-11 17:25:33,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 231 transitions. [2018-04-11 17:25:33,488 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 231 transitions. Word has length 36 [2018-04-11 17:25:33,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:33,488 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 231 transitions. [2018-04-11 17:25:33,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 17:25:33,488 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 231 transitions. [2018-04-11 17:25:33,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 17:25:33,488 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:33,488 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:33,488 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:33,488 INFO L82 PathProgramCache]: Analyzing trace with hash 287564992, now seen corresponding path program 1 times [2018-04-11 17:25:33,488 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:33,488 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:33,489 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:33,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:33,489 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:33,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:33,499 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:25:33,499 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:25:33,499 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:25:33,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:33,522 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:25:33,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:25:33,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:33,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:33,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:25:33,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:25:33,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:33,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:33,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:33,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 17:25:33,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:33,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:33,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-11 17:25:33,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:25:33,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-11 17:25:33,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:33,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:33,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:25:33,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:25:33,633 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:33,634 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:33,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:33,640 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2018-04-11 17:25:33,663 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 36 treesize of output 37 [2018-04-11 17:25:33,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-11 17:25:33,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:33,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:33,683 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 52 treesize of output 56 [2018-04-11 17:25:33,684 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-11 17:25:33,684 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:33,689 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:33,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:33,697 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:83, output treesize:67 [2018-04-11 17:25:33,803 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 55 treesize of output 79 [2018-04-11 17:25:33,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2018-04-11 17:25:33,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:33,879 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:33,881 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 47 treesize of output 41 [2018-04-11 17:25:33,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:33,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 17:25:33,996 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:33,998 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 92 treesize of output 102 [2018-04-11 17:25:34,001 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:34,001 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 35 treesize of output 23 [2018-04-11 17:25:34,001 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:34,014 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:34,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 114 [2018-04-11 17:25:34,041 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 17:25:34,042 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:34,095 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 80 treesize of output 79 [2018-04-11 17:25:34,095 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:34,131 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:34,134 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:34,135 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 70 treesize of output 72 [2018-04-11 17:25:34,137 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:34,137 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 35 treesize of output 50 [2018-04-11 17:25:34,137 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:34,146 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:34,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-04-11 17:25:34,192 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:93, output treesize:240 [2018-04-11 17:25:34,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:34,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:34,440 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 69 [2018-04-11 17:25:34,449 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 67 [2018-04-11 17:25:34,450 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:25:34,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:34,479 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 52 treesize of output 46 [2018-04-11 17:25:34,479 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:34,531 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:34,531 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 40 treesize of output 30 [2018-04-11 17:25:34,532 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:34,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:34,573 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 1 case distinctions, treesize of input 45 treesize of output 49 [2018-04-11 17:25:34,576 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 45 treesize of output 38 [2018-04-11 17:25:34,576 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:34,595 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 30 treesize of output 25 [2018-04-11 17:25:34,595 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:34,609 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:34,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-04-11 17:25:34,609 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:34,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:34,621 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 22 treesize of output 16 [2018-04-11 17:25:34,621 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:34,629 INFO L267 ElimStorePlain]: Start of recursive call 6: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:34,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:34,637 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:110, output treesize:16 [2018-04-11 17:25:34,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:34,677 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:25:34,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 17:25:34,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 17:25:34,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 17:25:34,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-04-11 17:25:34,677 INFO L87 Difference]: Start difference. First operand 199 states and 231 transitions. Second operand 17 states. [2018-04-11 17:25:36,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:36,265 INFO L93 Difference]: Finished difference Result 280 states and 310 transitions. [2018-04-11 17:25:36,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 17:25:36,266 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-04-11 17:25:36,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:36,267 INFO L225 Difference]: With dead ends: 280 [2018-04-11 17:25:36,267 INFO L226 Difference]: Without dead ends: 280 [2018-04-11 17:25:36,267 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=209, Invalid=847, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 17:25:36,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-04-11 17:25:36,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 216. [2018-04-11 17:25:36,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-04-11 17:25:36,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 252 transitions. [2018-04-11 17:25:36,270 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 252 transitions. Word has length 36 [2018-04-11 17:25:36,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:36,270 INFO L459 AbstractCegarLoop]: Abstraction has 216 states and 252 transitions. [2018-04-11 17:25:36,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 17:25:36,270 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 252 transitions. [2018-04-11 17:25:36,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 17:25:36,271 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:36,271 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:36,271 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:36,271 INFO L82 PathProgramCache]: Analyzing trace with hash -585558576, now seen corresponding path program 1 times [2018-04-11 17:25:36,271 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:36,271 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:36,272 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:36,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:36,272 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:36,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:36,280 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:25:36,280 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:25:36,280 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:25:36,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:36,297 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:25:36,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:25:36,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:25:36,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:25:36,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:25:36,352 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,353 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,357 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-11 17:25:36,365 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 21 treesize of output 16 [2018-04-11 17:25:36,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:36,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 17:25:36,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,379 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 21 treesize of output 16 [2018-04-11 17:25:36,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:36,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 17:25:36,381 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,384 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,390 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-04-11 17:25:36,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:25:36,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:25:36,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:53 [2018-04-11 17:25:36,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:36,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:36,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 17:25:36,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:55 [2018-04-11 17:25:36,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 9 treesize of output 7 [2018-04-11 17:25:36,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 17:25:36,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:46 [2018-04-11 17:25:36,501 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-11 17:25:36,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:25:36,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,519 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 37 [2018-04-11 17:25:36,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:25:36,521 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,524 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,533 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:71, output treesize:90 [2018-04-11 17:25:36,550 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 86 treesize of output 74 [2018-04-11 17:25:36,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:36,554 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 73 treesize of output 88 [2018-04-11 17:25:36,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,578 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 92 treesize of output 85 [2018-04-11 17:25:36,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:36,580 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:36,581 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 77 treesize of output 101 [2018-04-11 17:25:36,581 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,589 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,600 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:116, output treesize:108 [2018-04-11 17:25:36,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:25:36,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:36,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:126, output treesize:121 [2018-04-11 17:25:36,721 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:36,722 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 110 treesize of output 94 [2018-04-11 17:25:36,724 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:36,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:36,725 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 30 treesize of output 29 [2018-04-11 17:25:36,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:36,735 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:36,736 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 53 treesize of output 47 [2018-04-11 17:25:36,737 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:36,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:36,781 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 57 treesize of output 43 [2018-04-11 17:25:36,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:36,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:36,814 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:36,814 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 24 treesize of output 31 [2018-04-11 17:25:36,814 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,822 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:36,822 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 16 treesize of output 1 [2018-04-11 17:25:36,822 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,826 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:36,830 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:137, output treesize:7 [2018-04-11 17:25:36,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:36,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:25:36,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 17:25:36,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 17:25:36,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 17:25:36,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=254, Unknown=6, NotChecked=0, Total=306 [2018-04-11 17:25:36,858 INFO L87 Difference]: Start difference. First operand 216 states and 252 transitions. Second operand 18 states. [2018-04-11 17:25:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:37,851 INFO L93 Difference]: Finished difference Result 257 states and 291 transitions. [2018-04-11 17:25:37,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 17:25:37,851 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2018-04-11 17:25:37,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:37,851 INFO L225 Difference]: With dead ends: 257 [2018-04-11 17:25:37,851 INFO L226 Difference]: Without dead ends: 257 [2018-04-11 17:25:37,852 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=228, Invalid=1020, Unknown=12, NotChecked=0, Total=1260 [2018-04-11 17:25:37,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-04-11 17:25:37,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 236. [2018-04-11 17:25:37,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-11 17:25:37,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 273 transitions. [2018-04-11 17:25:37,854 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 273 transitions. Word has length 37 [2018-04-11 17:25:37,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:37,854 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 273 transitions. [2018-04-11 17:25:37,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 17:25:37,854 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 273 transitions. [2018-04-11 17:25:37,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 17:25:37,855 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:37,855 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:37,855 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:37,855 INFO L82 PathProgramCache]: Analyzing trace with hash -58521746, now seen corresponding path program 1 times [2018-04-11 17:25:37,855 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:37,855 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:37,855 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:37,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:37,856 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:37,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:37,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:37,875 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:25:37,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 17:25:37,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 17:25:37,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 17:25:37,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:25:37,876 INFO L87 Difference]: Start difference. First operand 236 states and 273 transitions. Second operand 5 states. [2018-04-11 17:25:37,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:38,000 INFO L93 Difference]: Finished difference Result 257 states and 286 transitions. [2018-04-11 17:25:38,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 17:25:38,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-04-11 17:25:38,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:38,001 INFO L225 Difference]: With dead ends: 257 [2018-04-11 17:25:38,001 INFO L226 Difference]: Without dead ends: 257 [2018-04-11 17:25:38,001 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 17:25:38,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-04-11 17:25:38,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 225. [2018-04-11 17:25:38,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-04-11 17:25:38,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 257 transitions. [2018-04-11 17:25:38,003 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 257 transitions. Word has length 39 [2018-04-11 17:25:38,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:38,003 INFO L459 AbstractCegarLoop]: Abstraction has 225 states and 257 transitions. [2018-04-11 17:25:38,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 17:25:38,004 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 257 transitions. [2018-04-11 17:25:38,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 17:25:38,004 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:38,004 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:38,004 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:38,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1377853024, now seen corresponding path program 1 times [2018-04-11 17:25:38,004 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:38,004 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:38,005 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:38,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:38,005 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:38,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:38,017 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:25:38,017 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:25:38,017 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:25:38,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:38,051 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:25:38,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 6 treesize of output 5 [2018-04-11 17:25:38,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:38,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:38,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:25:38,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 17:25:38,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:38,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:25:38,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:38,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:38,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2018-04-11 17:25:38,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:25:38,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 8 treesize of output 7 [2018-04-11 17:25:38,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:38,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:38,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 11 treesize of output 8 [2018-04-11 17:25:38,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:25:38,119 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:38,124 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:38,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:38,135 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:43 [2018-04-11 17:25:38,149 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-11 17:25:38,151 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 11 treesize of output 7 [2018-04-11 17:25:38,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:38,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:38,161 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-11 17:25:38,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:39 [2018-04-11 17:25:38,186 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 32 treesize of output 42 [2018-04-11 17:25:38,188 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 33 treesize of output 32 [2018-04-11 17:25:38,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:38,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:38,215 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-11 17:25:38,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2018-04-11 17:25:38,241 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2018-04-11 17:25:38,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 17:25:38,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-11 17:25:38,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:84 [2018-04-11 17:25:38,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 86 [2018-04-11 17:25:38,310 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:38,311 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 0 case distinctions, treesize of input 61 treesize of output 61 [2018-04-11 17:25:38,311 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:38,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:38,444 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:38,444 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:38,447 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 58 treesize of output 72 [2018-04-11 17:25:38,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:38,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 56 treesize of output 55 [2018-04-11 17:25:38,554 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:38,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 17:25:38,761 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 61 treesize of output 58 [2018-04-11 17:25:38,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-11 17:25:38,762 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:38,774 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:38,776 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 55 treesize of output 52 [2018-04-11 17:25:38,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:25:38,778 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:38,788 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:38,791 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-11 17:25:38,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:25:38,792 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:38,803 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:38,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 74 treesize of output 71 [2018-04-11 17:25:38,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:25:38,807 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:38,820 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:38,822 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-11 17:25:38,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:25:38,824 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:38,833 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:38,924 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 4 case distinctions, treesize of input 70 treesize of output 84 [2018-04-11 17:25:38,927 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 75 treesize of output 74 [2018-04-11 17:25:38,927 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:38,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 69 [2018-04-11 17:25:38,972 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-04-11 17:25:39,005 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:25:39,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-2 vars, End of recursive call: 24 dim-0 vars, and 6 xjuncts. [2018-04-11 17:25:39,094 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 11 variables, input treesize:134, output treesize:310 [2018-04-11 17:25:39,237 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 163 DAG size of output 140 [2018-04-11 17:25:39,491 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 91 [2018-04-11 17:25:39,494 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:39,494 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 80 treesize of output 74 [2018-04-11 17:25:39,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:39,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:39,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:39,559 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:39,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 79 [2018-04-11 17:25:39,569 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 17:25:39,693 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 68 treesize of output 63 [2018-04-11 17:25:39,693 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:39,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 69 [2018-04-11 17:25:39,803 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-11 17:25:39,924 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 63 treesize of output 51 [2018-04-11 17:25:39,924 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-11 17:25:40,042 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:40,042 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 59 treesize of output 53 [2018-04-11 17:25:40,042 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,044 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:40,044 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 65 treesize of output 59 [2018-04-11 17:25:40,044 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:40,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:40,156 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:40,157 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 72 treesize of output 70 [2018-04-11 17:25:40,158 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:40,267 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 52 treesize of output 47 [2018-04-11 17:25:40,268 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: 5 dim-0 vars, and 8 xjuncts. [2018-04-11 17:25:40,555 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 69 treesize of output 61 [2018-04-11 17:25:40,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 17:25:40,561 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,574 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:40,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-11 17:25:40,575 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,583 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,766 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 47 treesize of output 43 [2018-04-11 17:25:40,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:25:40,768 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:25:40,777 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,784 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,786 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 51 treesize of output 47 [2018-04-11 17:25:40,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:25:40,788 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:25:40,807 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,818 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,821 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 53 treesize of output 49 [2018-04-11 17:25:40,823 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 5 treesize of output 1 [2018-04-11 17:25:40,823 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:25:40,833 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,841 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,843 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 52 treesize of output 48 [2018-04-11 17:25:40,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:25:40,845 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,857 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 5 treesize of output 1 [2018-04-11 17:25:40,857 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,865 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,867 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 47 treesize of output 43 [2018-04-11 17:25:40,868 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 5 treesize of output 1 [2018-04-11 17:25:40,869 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,878 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 5 treesize of output 1 [2018-04-11 17:25:40,878 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,885 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,887 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 47 treesize of output 43 [2018-04-11 17:25:40,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:25:40,888 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:25:40,897 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,903 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:40,906 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 42 treesize of output 42 [2018-04-11 17:25:40,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:25:40,907 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:25:40,917 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,923 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,925 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 53 treesize of output 49 [2018-04-11 17:25:40,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:25:40,926 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,937 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 5 treesize of output 1 [2018-04-11 17:25:40,938 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:40,946 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:41,078 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 83 treesize of output 68 [2018-04-11 17:25:41,079 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-11 17:25:41,080 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:41,090 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:41,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 17:25:41,090 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:41,099 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:41,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 39 treesize of output 35 [2018-04-11 17:25:41,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 17:25:41,225 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:41,231 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:41,352 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 42 treesize of output 38 [2018-04-11 17:25:41,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:25:41,353 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:41,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 17:25:41,360 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:41,365 INFO L267 ElimStorePlain]: Start of recursive call 44: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:41,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 88 [2018-04-11 17:25:41,496 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:41,496 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:41,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:41,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 63 [2018-04-11 17:25:41,508 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:41,644 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 69 treesize of output 64 [2018-04-11 17:25:41,644 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:41,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:41,768 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 73 treesize of output 62 [2018-04-11 17:25:41,769 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:41,899 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 77 treesize of output 72 [2018-04-11 17:25:41,919 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:42,040 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:42,041 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:42,042 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 69 treesize of output 69 [2018-04-11 17:25:42,042 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:42,176 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:42,177 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 72 treesize of output 68 [2018-04-11 17:25:42,177 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:42,296 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:42,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:42,298 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 0 case distinctions, treesize of input 64 treesize of output 58 [2018-04-11 17:25:42,298 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:42,415 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:42,416 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:42,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:42,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 63 [2018-04-11 17:25:42,418 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:42,557 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 54 treesize of output 46 [2018-04-11 17:25:42,558 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:42,663 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:42,664 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:42,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:42,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 63 [2018-04-11 17:25:42,667 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:42,773 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:42,774 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:42,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:42,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 59 [2018-04-11 17:25:42,777 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:42,878 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:42,878 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 56 treesize of output 52 [2018-04-11 17:25:42,878 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:42,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2018-04-11 17:25:42,974 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:43,065 INFO L267 ElimStorePlain]: Start of recursive call 47: 13 dim-1 vars, End of recursive call: 8 dim-0 vars, and 8 xjuncts. [2018-04-11 17:25:43,296 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 42 treesize of output 46 [2018-04-11 17:25:43,298 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 42 treesize of output 37 [2018-04-11 17:25:43,298 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:43,321 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 37 treesize of output 32 [2018-04-11 17:25:43,321 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:43,346 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 38 treesize of output 34 [2018-04-11 17:25:43,346 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:43,365 INFO L267 ElimStorePlain]: Start of recursive call 61: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:25:43,369 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 42 treesize of output 46 [2018-04-11 17:25:43,372 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 42 treesize of output 37 [2018-04-11 17:25:43,372 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:43,399 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 38 treesize of output 34 [2018-04-11 17:25:43,399 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:43,435 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 37 treesize of output 32 [2018-04-11 17:25:43,435 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:43,454 INFO L267 ElimStorePlain]: Start of recursive call 65: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:25:43,459 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 38 treesize of output 42 [2018-04-11 17:25:43,462 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 38 treesize of output 33 [2018-04-11 17:25:43,462 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:43,485 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 34 treesize of output 30 [2018-04-11 17:25:43,486 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:43,509 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 28 [2018-04-11 17:25:43,509 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:43,528 INFO L267 ElimStorePlain]: Start of recursive call 69: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:25:43,533 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 1 case distinctions, treesize of input 46 treesize of output 50 [2018-04-11 17:25:43,536 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 46 treesize of output 41 [2018-04-11 17:25:43,536 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:43,566 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 41 treesize of output 36 [2018-04-11 17:25:43,567 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:43,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, 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 38 [2018-04-11 17:25:43,610 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:43,655 INFO L267 ElimStorePlain]: Start of recursive call 73: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:25:43,657 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 46 treesize of output 42 [2018-04-11 17:25:43,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:25:43,659 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:43,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:25:43,668 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:43,675 INFO L267 ElimStorePlain]: Start of recursive call 77: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:43,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-04-11 17:25:43,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:25:43,677 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:43,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:25:43,685 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:43,691 INFO L267 ElimStorePlain]: Start of recursive call 80: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:43,693 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 46 treesize of output 42 [2018-04-11 17:25:43,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:25:43,694 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:43,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-11 17:25:43,702 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:43,709 INFO L267 ElimStorePlain]: Start of recursive call 83: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:43,711 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 50 treesize of output 46 [2018-04-11 17:25:43,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:25:43,712 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:43,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:25:43,722 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:43,730 INFO L267 ElimStorePlain]: Start of recursive call 86: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:43,936 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 58 treesize of output 52 [2018-04-11 17:25:43,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:43,938 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:43,939 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 18 treesize of output 13 [2018-04-11 17:25:43,939 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:43,947 INFO L267 ElimStorePlain]: Start of recursive call 89: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:44,135 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 35 treesize of output 31 [2018-04-11 17:25:44,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 17:25:44,136 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:44,141 INFO L267 ElimStorePlain]: Start of recursive call 91: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:44,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 27 dim-0 vars, 10 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-04-11 17:25:44,333 INFO L202 ElimStorePlain]: Needed 92 recursive calls to eliminate 37 variables, input treesize:386, output treesize:51 [2018-04-11 17:25:44,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:44,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:44,384 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 23 treesize of output 30 [2018-04-11 17:25:44,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:44,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:44,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:44,393 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 17 treesize of output 24 [2018-04-11 17:25:44,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:44,400 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 2 xjuncts. [2018-04-11 17:25:44,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2018-04-11 17:25:44,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:44,465 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:25:44,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 17:25:44,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 17:25:44,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 17:25:44,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-04-11 17:25:44,465 INFO L87 Difference]: Start difference. First operand 225 states and 257 transitions. Second operand 17 states. [2018-04-11 17:25:45,163 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 150 DAG size of output 148 [2018-04-11 17:25:45,451 WARN L151 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 220 DAG size of output 152 [2018-04-11 17:25:45,782 WARN L151 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 228 DAG size of output 156 [2018-04-11 17:25:46,045 WARN L151 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 228 DAG size of output 156 [2018-04-11 17:25:46,302 WARN L151 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 243 DAG size of output 170 [2018-04-11 17:25:47,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:47,331 INFO L93 Difference]: Finished difference Result 396 states and 435 transitions. [2018-04-11 17:25:47,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 17:25:47,331 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-04-11 17:25:47,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:47,332 INFO L225 Difference]: With dead ends: 396 [2018-04-11 17:25:47,332 INFO L226 Difference]: Without dead ends: 396 [2018-04-11 17:25:47,332 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=253, Invalid=1079, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 17:25:47,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-04-11 17:25:47,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 236. [2018-04-11 17:25:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-11 17:25:47,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 271 transitions. [2018-04-11 17:25:47,336 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 271 transitions. Word has length 40 [2018-04-11 17:25:47,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:47,336 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 271 transitions. [2018-04-11 17:25:47,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 17:25:47,337 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 271 transitions. [2018-04-11 17:25:47,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 17:25:47,337 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:47,337 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:47,337 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:47,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1377853023, now seen corresponding path program 1 times [2018-04-11 17:25:47,338 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:47,338 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:47,339 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:47,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:47,339 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:47,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:47,354 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:25:47,354 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:25:47,354 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:25:47,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:47,395 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:25:47,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:25:47,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:47,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:47,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-04-11 17:25:47,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:25:47,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:25:47,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:47,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:47,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:25:47,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:25:47,442 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:47,443 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:47,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:47,448 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26 [2018-04-11 17:25:47,480 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 36 treesize of output 50 [2018-04-11 17:25:47,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 37 treesize of output 36 [2018-04-11 17:25:47,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:47,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:47,523 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 51 [2018-04-11 17:25:47,525 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-11 17:25:47,525 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:47,544 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:47,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:47,552 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:75, output treesize:59 [2018-04-11 17:25:47,610 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 54 treesize of output 60 [2018-04-11 17:25:47,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:47,613 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:47,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 49 treesize of output 73 [2018-04-11 17:25:47,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:47,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:47,656 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 65 [2018-04-11 17:25:47,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:47,660 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 61 treesize of output 72 [2018-04-11 17:25:47,660 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:47,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:47,679 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:47,681 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 41 treesize of output 47 [2018-04-11 17:25:47,681 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:47,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:25:47,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 17:25:47,716 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:101, output treesize:144 [2018-04-11 17:25:47,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2018-04-11 17:25:47,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:47,846 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:47,846 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 28 treesize of output 19 [2018-04-11 17:25:47,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:47,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:47,891 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 95 [2018-04-11 17:25:47,893 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:47,893 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 88 treesize of output 78 [2018-04-11 17:25:47,893 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:47,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:47,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:47,925 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:47,925 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:47,925 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:47,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 89 [2018-04-11 17:25:47,927 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:47,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:47,958 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 72 treesize of output 66 [2018-04-11 17:25:47,958 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:47,979 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:25:48,009 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 60 treesize of output 48 [2018-04-11 17:25:48,011 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 21 treesize of output 13 [2018-04-11 17:25:48,011 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:48,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:48,019 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 13 treesize of output 6 [2018-04-11 17:25:48,019 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:48,026 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:48,030 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 52 treesize of output 50 [2018-04-11 17:25:48,032 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 46 treesize of output 37 [2018-04-11 17:25:48,032 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:48,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:48,051 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 37 treesize of output 31 [2018-04-11 17:25:48,052 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:48,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:48,068 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 37 treesize of output 27 [2018-04-11 17:25:48,068 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:48,079 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:48,102 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 44 treesize of output 38 [2018-04-11 17:25:48,103 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:48,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:48,105 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 18 treesize of output 16 [2018-04-11 17:25:48,105 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:48,112 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:48,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-11 17:25:48,131 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 12 variables, input treesize:178, output treesize:37 [2018-04-11 17:25:48,172 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 18 treesize of output 17 [2018-04-11 17:25:48,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:48,181 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 15 treesize of output 14 [2018-04-11 17:25:48,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:48,189 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 2 xjuncts. [2018-04-11 17:25:48,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:32 [2018-04-11 17:25:48,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:48,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:25:48,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 17:25:48,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 17:25:48,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 17:25:48,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=224, Unknown=1, NotChecked=0, Total=272 [2018-04-11 17:25:48,251 INFO L87 Difference]: Start difference. First operand 236 states and 271 transitions. Second operand 17 states. [2018-04-11 17:25:49,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:49,613 INFO L93 Difference]: Finished difference Result 373 states and 409 transitions. [2018-04-11 17:25:49,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 17:25:49,614 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-04-11 17:25:49,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:49,615 INFO L225 Difference]: With dead ends: 373 [2018-04-11 17:25:49,615 INFO L226 Difference]: Without dead ends: 373 [2018-04-11 17:25:49,615 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=1026, Unknown=3, NotChecked=0, Total=1260 [2018-04-11 17:25:49,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-04-11 17:25:49,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 236. [2018-04-11 17:25:49,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-11 17:25:49,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 269 transitions. [2018-04-11 17:25:49,618 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 269 transitions. Word has length 40 [2018-04-11 17:25:49,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:49,619 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 269 transitions. [2018-04-11 17:25:49,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 17:25:49,619 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 269 transitions. [2018-04-11 17:25:49,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 17:25:49,619 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:49,619 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:49,620 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:49,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1591944237, now seen corresponding path program 1 times [2018-04-11 17:25:49,620 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:49,620 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:49,621 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:49,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:49,621 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:49,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:49,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:49,703 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:25:49,703 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:25:49,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:49,718 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:25:49,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:25:49,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:49,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:49,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-04-11 17:25:49,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:25:49,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:25:49,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:49,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:49,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:49,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-11 17:25:49,804 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 22 treesize of output 17 [2018-04-11 17:25:49,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:49,807 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 17 treesize of output 24 [2018-04-11 17:25:49,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:49,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:49,833 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-11 17:25:49,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-04-11 17:25:49,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, 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 7 [2018-04-11 17:25:49,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:49,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:49,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:30 [2018-04-11 17:25:49,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-11 17:25:49,933 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:49,933 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 19 treesize of output 14 [2018-04-11 17:25:49,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:49,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:49,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:49,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:4 [2018-04-11 17:25:49,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 17:25:49,979 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:25:49,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 20 [2018-04-11 17:25:49,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 17:25:49,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 17:25:49,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2018-04-11 17:25:49,980 INFO L87 Difference]: Start difference. First operand 236 states and 269 transitions. Second operand 20 states. [2018-04-11 17:25:50,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:50,794 INFO L93 Difference]: Finished difference Result 301 states and 329 transitions. [2018-04-11 17:25:50,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 17:25:50,794 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2018-04-11 17:25:50,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:50,795 INFO L225 Difference]: With dead ends: 301 [2018-04-11 17:25:50,795 INFO L226 Difference]: Without dead ends: 301 [2018-04-11 17:25:50,795 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=251, Invalid=1641, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 17:25:50,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-04-11 17:25:50,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 251. [2018-04-11 17:25:50,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-04-11 17:25:50,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 283 transitions. [2018-04-11 17:25:50,799 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 283 transitions. Word has length 41 [2018-04-11 17:25:50,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:50,799 INFO L459 AbstractCegarLoop]: Abstraction has 251 states and 283 transitions. [2018-04-11 17:25:50,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 17:25:50,799 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 283 transitions. [2018-04-11 17:25:50,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 17:25:50,800 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:50,800 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:50,800 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:50,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1176462409, now seen corresponding path program 2 times [2018-04-11 17:25:50,800 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:50,800 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:50,801 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:50,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:50,801 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:50,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:50,814 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:25:50,814 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:25:50,814 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:25:50,815 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 17:25:50,839 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 17:25:50,840 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:25:50,842 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:25:50,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:25:50,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:50,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:50,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 17:25:50,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:25:50,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:50,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:50,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 17:25:50,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:50,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:50,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:19 [2018-04-11 17:25:50,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:50,893 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 15 [2018-04-11 17:25:50,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:50,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:50,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:50,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:50,908 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 22 treesize of output 34 [2018-04-11 17:25:50,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:50,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:50,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-04-11 17:25:50,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:25:50,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:25:50,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:50,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:50,950 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-11 17:25:50,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:46 [2018-04-11 17:25:50,996 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 28 treesize of output 38 [2018-04-11 17:25:50,999 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 29 treesize of output 28 [2018-04-11 17:25:50,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:51,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:51,031 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-11 17:25:51,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:67 [2018-04-11 17:25:51,132 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 18 treesize of output 34 [2018-04-11 17:25:51,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 17:25:51,147 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-11 17:25:51,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:82, output treesize:65 [2018-04-11 17:25:51,180 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 46 [2018-04-11 17:25:51,183 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 40 treesize of output 39 [2018-04-11 17:25:51,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:51,197 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:51,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:51,198 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 32 [2018-04-11 17:25:51,198 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:51,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:25:51,236 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:51,243 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 55 treesize of output 60 [2018-04-11 17:25:51,246 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:51,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 70 [2018-04-11 17:25:51,246 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:51,258 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:51,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:51,275 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 4 case distinctions, treesize of input 61 treesize of output 85 [2018-04-11 17:25:51,277 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 70 treesize of output 69 [2018-04-11 17:25:51,278 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:51,303 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:51,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-04-11 17:25:51,326 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:99, output treesize:159 [2018-04-11 17:25:51,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:51,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:51,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:51,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:51,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:51,572 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:51,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 124 [2018-04-11 17:25:51,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:51,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:51,646 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:51,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:51,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 61 treesize of output 65 [2018-04-11 17:25:51,650 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:51,654 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 19 treesize of output 29 [2018-04-11 17:25:51,655 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:25:51,664 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:51,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-04-11 17:25:51,665 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:51,670 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:25:51,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 49 treesize of output 55 [2018-04-11 17:25:51,696 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 47 treesize of output 40 [2018-04-11 17:25:51,696 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:51,731 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:51,731 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 36 treesize of output 28 [2018-04-11 17:25:51,731 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:51,762 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:51,762 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 21 [2018-04-11 17:25:51,762 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:51,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:51,791 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:51,791 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 39 treesize of output 36 [2018-04-11 17:25:51,792 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:51,821 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 23 treesize of output 14 [2018-04-11 17:25:51,821 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:51,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:51,842 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:51,843 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 35 treesize of output 26 [2018-04-11 17:25:51,843 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:51,858 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:51,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:25:51,859 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:25:51,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-04-11 17:25:51,860 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 17:25:51,870 INFO L267 ElimStorePlain]: Start of recursive call 6: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:51,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:25:51,880 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 17 variables, input treesize:240, output treesize:10 [2018-04-11 17:25:51,904 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:51,904 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:25:51,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 17:25:51,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 17:25:51,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 17:25:51,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-04-11 17:25:51,905 INFO L87 Difference]: Start difference. First operand 251 states and 283 transitions. Second operand 18 states. [2018-04-11 17:25:54,766 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 126 DAG size of output 114 [2018-04-11 17:25:55,370 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 159 DAG size of output 126 [2018-04-11 17:25:55,854 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 181 DAG size of output 107 [2018-04-11 17:25:56,044 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 176 DAG size of output 102 [2018-04-11 17:25:56,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:56,416 INFO L93 Difference]: Finished difference Result 275 states and 299 transitions. [2018-04-11 17:25:56,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 17:25:56,417 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 42 [2018-04-11 17:25:56,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:56,417 INFO L225 Difference]: With dead ends: 275 [2018-04-11 17:25:56,417 INFO L226 Difference]: Without dead ends: 275 [2018-04-11 17:25:56,418 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 17:25:56,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-11 17:25:56,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 241. [2018-04-11 17:25:56,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-04-11 17:25:56,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 268 transitions. [2018-04-11 17:25:56,420 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 268 transitions. Word has length 42 [2018-04-11 17:25:56,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:56,420 INFO L459 AbstractCegarLoop]: Abstraction has 241 states and 268 transitions. [2018-04-11 17:25:56,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 17:25:56,420 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 268 transitions. [2018-04-11 17:25:56,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 17:25:56,420 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:56,420 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:56,420 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 17:25:56,420 INFO L82 PathProgramCache]: Analyzing trace with hash -92088635, now seen corresponding path program 1 times [2018-04-11 17:25:56,421 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:56,421 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:56,421 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:56,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:25:56,421 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 17:25:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 17:25:56,445 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-11 17:25:56,459 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-04-11 17:25:56,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 05:25:56 BoogieIcfgContainer [2018-04-11 17:25:56,474 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 17:25:56,474 INFO L168 Benchmark]: Toolchain (without parser) took 41796.20 ms. Allocated memory was 401.1 MB in the beginning and 980.9 MB in the end (delta: 579.9 MB). Free memory was 331.0 MB in the beginning and 826.7 MB in the end (delta: -495.7 MB). Peak memory consumption was 84.1 MB. Max. memory is 5.3 GB. [2018-04-11 17:25:56,475 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 401.1 MB. Free memory is still 360.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 17:25:56,475 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.25 ms. Allocated memory is still 401.1 MB. Free memory was 330.3 MB in the beginning and 301.8 MB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 5.3 GB. [2018-04-11 17:25:56,475 INFO L168 Benchmark]: Boogie Preprocessor took 45.07 ms. Allocated memory is still 401.1 MB. Free memory was 301.8 MB in the beginning and 299.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 17:25:56,476 INFO L168 Benchmark]: RCFGBuilder took 514.19 ms. Allocated memory was 401.1 MB in the beginning and 585.1 MB in the end (delta: 184.0 MB). Free memory was 299.2 MB in the beginning and 503.8 MB in the end (delta: -204.6 MB). Peak memory consumption was 24.3 MB. Max. memory is 5.3 GB. [2018-04-11 17:25:56,476 INFO L168 Benchmark]: TraceAbstraction took 40976.51 ms. Allocated memory was 585.1 MB in the beginning and 980.9 MB in the end (delta: 395.8 MB). Free memory was 503.8 MB in the beginning and 826.7 MB in the end (delta: -322.9 MB). Peak memory consumption was 73.0 MB. Max. memory is 5.3 GB. [2018-04-11 17:25:56,477 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.12 ms. Allocated memory is still 401.1 MB. Free memory is still 360.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 257.25 ms. Allocated memory is still 401.1 MB. Free memory was 330.3 MB in the beginning and 301.8 MB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 45.07 ms. Allocated memory is still 401.1 MB. Free memory was 301.8 MB in the beginning and 299.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 514.19 ms. Allocated memory was 401.1 MB in the beginning and 585.1 MB in the end (delta: 184.0 MB). Free memory was 299.2 MB in the beginning and 503.8 MB in the end (delta: -204.6 MB). Peak memory consumption was 24.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 40976.51 ms. Allocated memory was 585.1 MB in the beginning and 980.9 MB in the end (delta: 395.8 MB). Free memory was 503.8 MB in the beginning and 826.7 MB in the end (delta: -322.9 MB). Peak memory consumption was 73.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 986]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L989] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={14:0}] [L989] SLL* head = malloc(sizeof(SLL)); VAL [head={14:0}, malloc(sizeof(SLL))={14:0}] [L990] FCALL head->next = ((void*)0) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}] [L991] FCALL head->prev = ((void*)0) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}] [L992] FCALL head->data = 0 VAL [head={14:0}, malloc(sizeof(SLL))={14:0}] [L994] SLL* x = head; VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, x={14:0}] [L997] COND FALSE !(__VERIFIER_nondet_int()) [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1018] x = head VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, x={14:0}] [L1019] EXPR, FCALL x->next VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, x={14:0}, x->next={0:0}] [L1019] COND FALSE !(x->next != ((void*)0)) [L1026] EXPR, FCALL x->next VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, x={14:0}, x->next={0:0}] [L1026] SLL* y = x->next; [L1027] EXPR, FCALL malloc(sizeof(SLL)) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={14:0}, y={0:0}] [L1027] FCALL x->next = malloc(sizeof(SLL)) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={14:0}, y={0:0}] [L1028] FCALL x->data = 1 VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={14:0}, y={0:0}] [L1029] FCALL x->next = y VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={14:0}, y={0:0}] [L1030] COND FALSE !(y != ((void*)0)) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={14:0}, y={0:0}] [L1038] x = head VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={14:0}, y={0:0}] [L1041] EXPR, FCALL x->data VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={14:0}, x->data=1, y={0:0}] [L1041] COND FALSE !(x->data != 1) [L1047] EXPR, FCALL x->next VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={14:0}, x->next={0:0}, y={0:0}] [L1047] x = x->next [L1048] COND FALSE !(\read(*x)) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1056] x = head VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={14:0}, y={0:0}] [L1057] COND TRUE x != ((void*)0) [L1059] head = x VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={14:0}, y={0:0}] [L1060] EXPR, FCALL x->next VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={14:0}, x->next={0:0}, y={0:0}] [L1060] x = x->next [L1061] free(head) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1061] free(head) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1061] FCALL free(head) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1057] COND FALSE !(x != ((void*)0)) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1064] return 0; VAL [\result=0, head={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 135 locations, 57 error locations. UNSAFE Result, 40.9s OverallTime, 29 OverallIterations, 3 TraceHistogramMax, 19.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2569 SDtfs, 7949 SDslu, 8595 SDs, 0 SdLazy, 13230 SolverSat, 1000 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 799 GetRequests, 336 SyntacticMatches, 5 SemanticMatches, 458 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1970 ImplicationChecksByTransitivity, 16.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 1434 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 20.1s InterpolantComputationTime, 1327 NumberOfCodeBlocks, 1327 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 795 ConstructedInterpolants, 134 QuantifiedInterpolants, 687339 SizeOfPredicates, 197 NumberOfNonLiveVariables, 2209 ConjunctsInSsa, 457 ConjunctsInUnsatCore, 29 InterpolantComputations, 22 PerfectInterpolantSequences, 29/55 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_17-25-56-482.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_17-25-56-482.csv Received shutdown request...