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/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 15:44:31,607 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 15:44:31,609 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 15:44:31,620 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 15:44:31,620 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 15:44:31,621 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 15:44:31,622 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 15:44:31,624 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 15:44:31,626 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 15:44:31,626 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 15:44:31,627 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 15:44:31,627 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 15:44:31,628 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 15:44:31,629 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 15:44:31,630 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 15:44:31,632 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 15:44:31,634 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 15:44:31,635 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 15:44:31,636 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 15:44:31,637 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 15:44:31,639 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 15:44:31,639 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 15:44:31,639 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 15:44:31,640 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 15:44:31,641 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 15:44:31,642 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 15:44:31,642 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 15:44:31,643 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 15:44:31,644 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 15:44:31,644 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 15:44:31,644 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 15:44:31,645 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 15:44:31,669 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 15:44:31,669 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 15:44:31,670 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 15:44:31,670 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 15:44:31,670 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 15:44:31,671 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 15:44:31,671 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 15:44:31,671 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 15:44:31,671 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 15:44:31,671 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 15:44:31,671 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 15:44:31,671 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 15:44:31,671 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 15:44:31,671 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 15:44:31,671 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 15:44:31,672 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 15:44:31,672 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 15:44:31,672 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 15:44:31,672 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 15:44:31,672 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:44:31,672 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 15:44:31,672 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 15:44:31,672 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 15:44:31,672 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 15:44:31,707 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 15:44:31,718 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 15:44:31,721 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 15:44:31,723 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 15:44:31,723 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 15:44:31,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,015 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc7b676e4a [2018-04-11 15:44:32,161 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 15:44:32,161 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 15:44:32,162 INFO L168 CDTParser]: Scanning dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,168 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 15:44:32,168 INFO L215 ultiparseSymbolTable]: [2018-04-11 15:44:32,168 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 15:44:32,168 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,169 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 15:44:32,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__suseconds_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__fd_mask in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____WAIT_STATUS in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__int64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____loff_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__fsid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__ushort in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_cond_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____u_quad_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_barrier_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____blkcnt_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____clock_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,169 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____daddr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____ino64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____uint8_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____quad_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____gid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_spinlock_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____pid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____uint16_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____sigset_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____ino_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__Node in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__id_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__wchar_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____u_int in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____useconds_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__loff_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,170 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____int16_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__dev_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____key_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____int64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____clockid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_char in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_int16_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__blkcnt_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_attr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__quad_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____pthread_list_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_barrierattr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,171 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_quad_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____swblk_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_once_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____u_long in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__ulong in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____qaddr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__blksize_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____blksize_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_short in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____rlim64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_condattr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,172 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__clock_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__fd_set in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__daddr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____fsid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__gid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_long in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__mode_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____caddr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____int8_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____dev_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,173 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_mutex_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____u_short in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__size_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____rlim_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____intptr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____mode_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____time_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____timer_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__int8_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,174 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____suseconds_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_int in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____fsfilcnt_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__caddr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_mutexattr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____uint32_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_int64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____fsfilcnt64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_rwlock_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__off_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__ldiv_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,175 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__ino_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,176 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__div_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,176 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__register_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,176 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__time_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,176 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_key_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,176 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__lldiv_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,176 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__Data in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,176 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__int16_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,176 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____socklen_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,176 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____fsblkcnt_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,176 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__uid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,176 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____uint64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,176 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__ssize_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,176 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____fsblkcnt64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_int32_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____uid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____u_char in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____off64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__sigset_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_int8_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__uint in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__int32_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____id_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__fsblkcnt_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__nlink_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__fsfilcnt_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____blkcnt64_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_rwlockattr_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____int32_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__clockid_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,177 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____off_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,178 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____fd_mask in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,178 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____nlink_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,178 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__timer_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,178 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____ssize_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,178 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__key_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,178 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____sig_atomic_t in dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,191 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc7b676e4a [2018-04-11 15:44:32,195 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 15:44:32,196 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 15:44:32,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 15:44:32,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 15:44:32,201 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 15:44:32,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:44:32" (1/1) ... [2018-04-11 15:44:32,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fdfc499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:44:32, skipping insertion in model container [2018-04-11 15:44:32,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:44:32" (1/1) ... [2018-04-11 15:44:32,215 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:44:32,238 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:44:32,373 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:44:32,406 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:44:32,412 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 110 non ball SCCs. Number of states in SCCs 110. [2018-04-11 15:44:32,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:44:32 WrapperNode [2018-04-11 15:44:32,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 15:44:32,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 15:44:32,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 15:44:32,448 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 15:44:32,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:44:32" (1/1) ... [2018-04-11 15:44:32,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:44:32" (1/1) ... [2018-04-11 15:44:32,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:44:32" (1/1) ... [2018-04-11 15:44:32,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:44:32" (1/1) ... [2018-04-11 15:44:32,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:44:32" (1/1) ... [2018-04-11 15:44:32,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:44:32" (1/1) ... [2018-04-11 15:44:32,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:44:32" (1/1) ... [2018-04-11 15:44:32,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 15:44:32,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 15:44:32,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 15:44:32,485 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 15:44:32,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:44:32" (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 15:44:32,565 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 15:44:32,565 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 15:44:32,565 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 15:44:32,565 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 15:44:32,566 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 15:44:32,566 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 15:44:32,566 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 15:44:32,566 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 15:44:32,566 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 15:44:32,566 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 15:44:32,566 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 15:44:32,566 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 15:44:32,566 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 15:44:32,566 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 15:44:32,567 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 15:44:32,567 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 15:44:32,567 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 15:44:32,567 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 15:44:32,567 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 15:44:32,567 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 15:44:32,567 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 15:44:32,567 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 15:44:32,567 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 15:44:32,567 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 15:44:32,567 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 15:44:32,568 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 15:44:32,568 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 15:44:32,568 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 15:44:32,568 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 15:44:32,568 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 15:44:32,568 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 15:44:32,568 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 15:44:32,568 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 15:44:32,568 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 15:44:32,568 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 15:44:32,569 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 15:44:32,569 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 15:44:32,569 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 15:44:32,569 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 15:44:32,569 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 15:44:32,569 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 15:44:32,569 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 15:44:32,569 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 15:44:32,569 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 15:44:32,569 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 15:44:32,570 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 15:44:32,570 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 15:44:32,570 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 15:44:32,570 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 15:44:32,570 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 15:44:32,570 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 15:44:32,570 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 15:44:32,570 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 15:44:32,570 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 15:44:32,570 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 15:44:32,571 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 15:44:32,571 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 15:44:32,571 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 15:44:32,571 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 15:44:32,571 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 15:44:32,571 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 15:44:32,571 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 15:44:32,571 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 15:44:32,571 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 15:44:32,571 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 15:44:32,572 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 15:44:32,572 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 15:44:32,572 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 15:44:32,572 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 15:44:32,572 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 15:44:32,572 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 15:44:32,572 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 15:44:32,572 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 15:44:32,572 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 15:44:32,572 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 15:44:32,572 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 15:44:32,572 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 15:44:32,572 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 15:44:32,572 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 15:44:32,572 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 15:44:32,572 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 15:44:32,573 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 15:44:32,573 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 15:44:32,573 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 15:44:32,573 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 15:44:32,573 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 15:44:32,573 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 15:44:32,573 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 15:44:32,573 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 15:44:32,573 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 15:44:32,573 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 15:44:32,573 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 15:44:32,573 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 15:44:32,573 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 15:44:32,573 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 15:44:32,573 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 15:44:32,573 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 15:44:32,573 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 15:44:32,574 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 15:44:32,574 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 15:44:32,574 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 15:44:32,574 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 15:44:32,574 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 15:44:32,574 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 15:44:32,574 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 15:44:32,574 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 15:44:32,574 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 15:44:32,575 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 15:44:32,575 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 15:44:32,575 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 15:44:32,575 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 15:44:32,575 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 15:44:32,575 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 15:44:32,883 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 15:44:32,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:44:32 BoogieIcfgContainer [2018-04-11 15:44:32,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 15:44:32,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 15:44:32,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 15:44:32,886 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 15:44:32,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 03:44:32" (1/3) ... [2018-04-11 15:44:32,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c5d598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:44:32, skipping insertion in model container [2018-04-11 15:44:32,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:44:32" (2/3) ... [2018-04-11 15:44:32,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c5d598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:44:32, skipping insertion in model container [2018-04-11 15:44:32,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:44:32" (3/3) ... [2018-04-11 15:44:32,889 INFO L107 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer_true-valid-memsafety.i [2018-04-11 15:44:32,897 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 15:44:32,904 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-04-11 15:44:32,929 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 15:44:32,930 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 15:44:32,930 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 15:44:32,930 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 15:44:32,930 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 15:44:32,930 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 15:44:32,930 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 15:44:32,930 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 15:44:32,930 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 15:44:32,931 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 15:44:32,943 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-04-11 15:44:32,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-11 15:44:32,951 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:44:32,952 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:44:32,952 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:44:32,956 INFO L82 PathProgramCache]: Analyzing trace with hash 63747077, now seen corresponding path program 1 times [2018-04-11 15:44:32,958 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:44:32,958 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:44:32,989 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:32,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:32,989 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:33,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:44:33,059 INFO 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 15:44:33,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:44:33,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:44:33,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:44:33,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:44:33,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:44:33,075 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 4 states. [2018-04-11 15:44:33,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:44:33,205 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-04-11 15:44:33,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:44:33,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-04-11 15:44:33,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:44:33,215 INFO L225 Difference]: With dead ends: 92 [2018-04-11 15:44:33,215 INFO L226 Difference]: Without dead ends: 88 [2018-04-11 15:44:33,217 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 15:44:33,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-04-11 15:44:33,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 62. [2018-04-11 15:44:33,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-04-11 15:44:33,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-04-11 15:44:33,244 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 9 [2018-04-11 15:44:33,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:44:33,244 INFO L459 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-04-11 15:44:33,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:44:33,244 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-04-11 15:44:33,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-11 15:44:33,244 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:44:33,244 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:44:33,245 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:44:33,245 INFO L82 PathProgramCache]: Analyzing trace with hash 63747078, now seen corresponding path program 1 times [2018-04-11 15:44:33,245 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:44:33,245 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:44:33,246 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:33,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:33,246 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:33,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:44:33,302 INFO 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 15:44:33,302 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:44:33,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:44:33,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:44:33,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:44:33,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:44:33,304 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 4 states. [2018-04-11 15:44:33,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:44:33,393 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2018-04-11 15:44:33,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:44:33,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-04-11 15:44:33,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:44:33,395 INFO L225 Difference]: With dead ends: 114 [2018-04-11 15:44:33,395 INFO L226 Difference]: Without dead ends: 114 [2018-04-11 15:44:33,396 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 15:44:33,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-04-11 15:44:33,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 59. [2018-04-11 15:44:33,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-04-11 15:44:33,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-04-11 15:44:33,400 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 9 [2018-04-11 15:44:33,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:44:33,401 INFO L459 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-04-11 15:44:33,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:44:33,401 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-04-11 15:44:33,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 15:44:33,401 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:44:33,402 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 15:44:33,402 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:44:33,402 INFO L82 PathProgramCache]: Analyzing trace with hash 329747370, now seen corresponding path program 1 times [2018-04-11 15:44:33,402 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:44:33,402 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:44:33,403 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:33,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:33,403 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:33,417 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:44:33,450 INFO 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 15:44:33,450 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:44:33,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:44:33,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:44:33,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:44:33,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:44:33,451 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2018-04-11 15:44:33,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:44:33,535 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-04-11 15:44:33,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:44:33,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-04-11 15:44:33,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:44:33,536 INFO L225 Difference]: With dead ends: 70 [2018-04-11 15:44:33,536 INFO L226 Difference]: Without dead ends: 70 [2018-04-11 15:44:33,537 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:44:33,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-04-11 15:44:33,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2018-04-11 15:44:33,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-04-11 15:44:33,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-04-11 15:44:33,541 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 18 [2018-04-11 15:44:33,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:44:33,541 INFO L459 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-04-11 15:44:33,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:44:33,542 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-04-11 15:44:33,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 15:44:33,542 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:44:33,542 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 15:44:33,542 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:44:33,542 INFO L82 PathProgramCache]: Analyzing trace with hash 329747371, now seen corresponding path program 1 times [2018-04-11 15:44:33,542 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:44:33,543 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:44:33,543 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:33,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:33,543 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:33,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:44:33,598 INFO 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 15:44:33,598 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:44:33,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:44:33,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:44:33,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:44:33,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:44:33,599 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 5 states. [2018-04-11 15:44:33,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:44:33,707 INFO L93 Difference]: Finished difference Result 154 states and 171 transitions. [2018-04-11 15:44:33,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:44:33,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-11 15:44:33,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:44:33,708 INFO L225 Difference]: With dead ends: 154 [2018-04-11 15:44:33,708 INFO L226 Difference]: Without dead ends: 154 [2018-04-11 15:44:33,709 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:44:33,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-04-11 15:44:33,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 83. [2018-04-11 15:44:33,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-11 15:44:33,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2018-04-11 15:44:33,712 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 18 [2018-04-11 15:44:33,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:44:33,712 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2018-04-11 15:44:33,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:44:33,713 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2018-04-11 15:44:33,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 15:44:33,713 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:44:33,713 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 15:44:33,713 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:44:33,713 INFO L82 PathProgramCache]: Analyzing trace with hash 329778988, now seen corresponding path program 1 times [2018-04-11 15:44:33,713 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:44:33,713 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:44:33,714 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:33,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:33,714 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:33,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:44:33,739 INFO 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 15:44:33,739 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:44:33,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:44:33,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:44:33,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:44:33,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:44:33,740 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand 4 states. [2018-04-11 15:44:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:44:33,801 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-04-11 15:44:33,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:44:33,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-04-11 15:44:33,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:44:33,802 INFO L225 Difference]: With dead ends: 104 [2018-04-11 15:44:33,802 INFO L226 Difference]: Without dead ends: 104 [2018-04-11 15:44:33,802 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:44:33,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-04-11 15:44:33,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 82. [2018-04-11 15:44:33,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-04-11 15:44:33,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 95 transitions. [2018-04-11 15:44:33,807 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 95 transitions. Word has length 18 [2018-04-11 15:44:33,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:44:33,807 INFO L459 AbstractCegarLoop]: Abstraction has 82 states and 95 transitions. [2018-04-11 15:44:33,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:44:33,808 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 95 transitions. [2018-04-11 15:44:33,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 15:44:33,808 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:44:33,808 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 15:44:33,808 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:44:33,808 INFO L82 PathProgramCache]: Analyzing trace with hash 329778989, now seen corresponding path program 1 times [2018-04-11 15:44:33,809 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:44:33,809 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:44:33,809 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:33,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:33,809 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:33,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:44:33,843 INFO 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 15:44:33,844 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:44:33,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:44:33,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:44:33,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:44:33,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:44:33,844 INFO L87 Difference]: Start difference. First operand 82 states and 95 transitions. Second operand 4 states. [2018-04-11 15:44:33,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:44:33,912 INFO L93 Difference]: Finished difference Result 122 states and 139 transitions. [2018-04-11 15:44:33,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:44:33,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-04-11 15:44:33,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:44:33,913 INFO L225 Difference]: With dead ends: 122 [2018-04-11 15:44:33,913 INFO L226 Difference]: Without dead ends: 122 [2018-04-11 15:44:33,913 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:44:33,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-04-11 15:44:33,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 80. [2018-04-11 15:44:33,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-04-11 15:44:33,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2018-04-11 15:44:33,916 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 18 [2018-04-11 15:44:33,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:44:33,916 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2018-04-11 15:44:33,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:44:33,916 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2018-04-11 15:44:33,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 15:44:33,917 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:44:33,917 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 15:44:33,917 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:44:33,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1632232948, now seen corresponding path program 1 times [2018-04-11 15:44:33,917 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:44:33,917 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:44:33,918 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:33,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:33,918 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:33,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:44:33,946 INFO 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 15:44:33,947 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:44:33,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:44:33,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:44:33,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:44:33,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:44:33,947 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand 5 states. [2018-04-11 15:44:34,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:44:34,002 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2018-04-11 15:44:34,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:44:34,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-04-11 15:44:34,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:44:34,003 INFO L225 Difference]: With dead ends: 97 [2018-04-11 15:44:34,003 INFO L226 Difference]: Without dead ends: 97 [2018-04-11 15:44:34,003 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:44:34,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-04-11 15:44:34,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 80. [2018-04-11 15:44:34,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-04-11 15:44:34,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2018-04-11 15:44:34,007 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 19 [2018-04-11 15:44:34,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:44:34,007 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2018-04-11 15:44:34,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:44:34,007 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2018-04-11 15:44:34,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 15:44:34,008 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:44:34,008 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:44:34,008 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:44:34,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1918816767, now seen corresponding path program 1 times [2018-04-11 15:44:34,009 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:44:34,009 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:44:34,009 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:34,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:34,009 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:34,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:44:34,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:44:34,152 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:44:34,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:44:34,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 15:44:34,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 15:44:34,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:44:34,153 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand 7 states. [2018-04-11 15:44:34,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:44:34,279 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2018-04-11 15:44:34,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:44:34,279 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-04-11 15:44:34,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:44:34,280 INFO L225 Difference]: With dead ends: 84 [2018-04-11 15:44:34,280 INFO L226 Difference]: Without dead ends: 84 [2018-04-11 15:44:34,280 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:44:34,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-11 15:44:34,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2018-04-11 15:44:34,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-11 15:44:34,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-04-11 15:44:34,284 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 23 [2018-04-11 15:44:34,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:44:34,284 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-04-11 15:44:34,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 15:44:34,284 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-04-11 15:44:34,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 15:44:34,285 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:44:34,285 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:44:34,285 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:44:34,285 INFO L82 PathProgramCache]: Analyzing trace with hash 845781146, now seen corresponding path program 1 times [2018-04-11 15:44:34,285 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:44:34,286 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:44:34,286 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:34,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:34,286 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:34,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:44:34,304 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:44:34,304 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:44:34,304 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:44:34,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:34,342 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:44:34,374 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 15:44:34,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:34,381 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 15:44:34,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:34,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:34,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:44:34,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:34,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:34,415 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 15:44:34,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:34,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:34,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:34,428 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 15:44:34,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:34,434 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 15:44:34,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-11 15:44:34,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:44:34,462 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:44:34,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:44:34,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:44:34,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:44:34,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:44:34,462 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 6 states. [2018-04-11 15:44:34,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:44:34,607 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2018-04-11 15:44:34,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:44:34,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-04-11 15:44:34,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:44:34,608 INFO L225 Difference]: With dead ends: 100 [2018-04-11 15:44:34,608 INFO L226 Difference]: Without dead ends: 100 [2018-04-11 15:44:34,609 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 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 15:44:34,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-11 15:44:34,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 73. [2018-04-11 15:44:34,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-04-11 15:44:34,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2018-04-11 15:44:34,614 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 23 [2018-04-11 15:44:34,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:44:34,614 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2018-04-11 15:44:34,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:44:34,614 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2018-04-11 15:44:34,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-11 15:44:34,619 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:44:34,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] [2018-04-11 15:44:34,621 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:44:34,621 INFO L82 PathProgramCache]: Analyzing trace with hash -8601878, now seen corresponding path program 1 times [2018-04-11 15:44:34,621 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:44:34,621 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:44:34,622 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:34,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:34,622 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:34,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:44:34,636 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:44:34,636 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:44:34,636 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:44:34,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:34,669 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:44:34,675 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 15:44:34,676 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 15:44:34,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:34,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:34,683 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 15:44:34,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 8 treesize of output 7 [2018-04-11 15:44:34,684 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:34,686 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:34,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:34,694 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-04-11 15:44:34,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 15:44:34,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:34,708 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 15:44:34,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:34,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:34,719 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 15:44:34,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:34,722 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 15:44:34,722 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:34,726 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:34,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:34,733 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-11 15:44:34,746 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 32 treesize of output 25 [2018-04-11 15:44:34,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:34,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:34,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:34,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:34,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 60 [2018-04-11 15:44:34,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:34,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:34,770 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 30 treesize of output 23 [2018-04-11 15:44:34,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:34,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:34,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:34,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 15:44:34,777 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:34,790 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:34,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:34,797 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2018-04-11 15:44:34,842 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 27 [2018-04-11 15:44:34,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:34,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:34,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:34,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:34,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 57 [2018-04-11 15:44:34,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-11 15:44:34,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:44:34,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-11 15:44:34,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:168 [2018-04-11 15:44:39,050 WARN L148 SmtUtils]: Spent 4096ms on a formula simplification that was a NOOP. DAG size: 82 [2018-04-11 15:44:39,783 WARN L148 SmtUtils]: Spent 706ms on a formula simplification that was a NOOP. DAG size: 82 [2018-04-11 15:44:39,800 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 67 treesize of output 57 [2018-04-11 15:44:39,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:39,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:39,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:39,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:39,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:39,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:39,807 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:39,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 65 [2018-04-11 15:44:39,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:39,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:39,855 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 67 treesize of output 57 [2018-04-11 15:44:39,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:39,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:39,869 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:39,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:39,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:39,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:39,872 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:39,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 77 [2018-04-11 15:44:39,882 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 15:44:39,913 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:44:39,951 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 60 treesize of output 50 [2018-04-11 15:44:39,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:39,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:39,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:39,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:39,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:39,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:39,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 77 [2018-04-11 15:44:39,971 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-04-11 15:44:40,008 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:44:40,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-04-11 15:44:40,075 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:195, output treesize:180 [2018-04-11 15:44:40,171 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 15:44:40,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:44:40,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 15:44:40,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 15:44:40,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 15:44:40,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:44:40,172 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 12 states. [2018-04-11 15:44:41,606 WARN L148 SmtUtils]: Spent 206ms on a formula simplification that was a NOOP. DAG size: 103 [2018-04-11 15:44:42,535 WARN L151 SmtUtils]: Spent 232ms on a formula simplification. DAG size of input: 91 DAG size of output 88 [2018-04-11 15:44:42,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:44:42,985 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-04-11 15:44:42,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:44:42,985 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-04-11 15:44:42,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:44:42,985 INFO L225 Difference]: With dead ends: 80 [2018-04-11 15:44:42,986 INFO L226 Difference]: Without dead ends: 80 [2018-04-11 15:44:42,986 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:44:42,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-11 15:44:42,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-04-11 15:44:42,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-04-11 15:44:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-04-11 15:44:42,988 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 27 [2018-04-11 15:44:42,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:44:42,989 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-04-11 15:44:42,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 15:44:42,989 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-04-11 15:44:42,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 15:44:42,989 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:44:42,990 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] [2018-04-11 15:44:42,990 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:44:42,990 INFO L82 PathProgramCache]: Analyzing trace with hash -266659148, now seen corresponding path program 1 times [2018-04-11 15:44:42,990 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:44:42,990 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:44:42,991 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:42,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:42,991 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:42,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:44:43,001 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:44:43,001 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:44:43,001 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:44:43,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:43,035 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:44:43,062 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~y~0.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_~y~0.base 0)) (= (select |c_old(#valid)| main_~y~0.base) 0))) is different from true [2018-04-11 15:44:43,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-11 15:44:43,067 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:44:43,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-11 15:44:43,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 15:44:43,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 15:44:43,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2018-04-11 15:44:43,068 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 7 states. [2018-04-11 15:44:43,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:44:43,174 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-04-11 15:44:43,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 15:44:43,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-04-11 15:44:43,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:44:43,175 INFO L225 Difference]: With dead ends: 79 [2018-04-11 15:44:43,175 INFO L226 Difference]: Without dead ends: 66 [2018-04-11 15:44:43,175 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=50, Unknown=2, NotChecked=14, Total=90 [2018-04-11 15:44:43,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-11 15:44:43,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-04-11 15:44:43,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-04-11 15:44:43,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-04-11 15:44:43,177 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 28 [2018-04-11 15:44:43,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:44:43,178 INFO L459 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-04-11 15:44:43,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 15:44:43,178 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-04-11 15:44:43,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:44:43,178 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:44:43,178 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] [2018-04-11 15:44:43,179 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:44:43,179 INFO L82 PathProgramCache]: Analyzing trace with hash 6347557, now seen corresponding path program 1 times [2018-04-11 15:44:43,179 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:44:43,179 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:44:43,179 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:43,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:43,180 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:43,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:44:43,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:44:43,229 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:44:43,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:44:43,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:44:43,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:44:43,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:44:43,230 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 5 states. [2018-04-11 15:44:43,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:44:43,306 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2018-04-11 15:44:43,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:44:43,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-11 15:44:43,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:44:43,306 INFO L225 Difference]: With dead ends: 134 [2018-04-11 15:44:43,307 INFO L226 Difference]: Without dead ends: 134 [2018-04-11 15:44:43,307 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:44:43,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-11 15:44:43,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 83. [2018-04-11 15:44:43,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-11 15:44:43,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2018-04-11 15:44:43,308 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 29 [2018-04-11 15:44:43,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:44:43,309 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2018-04-11 15:44:43,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:44:43,309 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2018-04-11 15:44:43,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:44:43,309 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:44:43,309 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] [2018-04-11 15:44:43,309 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:44:43,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1624604828, now seen corresponding path program 1 times [2018-04-11 15:44:43,309 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:44:43,309 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:44:43,310 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:43,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:43,310 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:43,318 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:44:43,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:44:43,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:44:43,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:44:43,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:44:43,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:44:43,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:44:43,367 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand 6 states. [2018-04-11 15:44:43,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:44:43,457 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2018-04-11 15:44:43,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:44:43,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-04-11 15:44:43,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:44:43,459 INFO L225 Difference]: With dead ends: 113 [2018-04-11 15:44:43,459 INFO L226 Difference]: Without dead ends: 113 [2018-04-11 15:44:43,459 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:44:43,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-04-11 15:44:43,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 69. [2018-04-11 15:44:43,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-04-11 15:44:43,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2018-04-11 15:44:43,461 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 30 [2018-04-11 15:44:43,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:44:43,461 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2018-04-11 15:44:43,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:44:43,461 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-04-11 15:44:43,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:44:43,462 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:44:43,462 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] [2018-04-11 15:44:43,462 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:44:43,462 INFO L82 PathProgramCache]: Analyzing trace with hash 196773306, now seen corresponding path program 1 times [2018-04-11 15:44:43,462 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:44:43,463 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:44:43,463 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:43,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:43,463 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:43,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:44:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:44:43,490 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:44:43,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:44:43,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:44:43,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:44:43,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:44:43,491 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 5 states. [2018-04-11 15:44:43,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:44:43,553 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-04-11 15:44:43,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:44:43,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-04-11 15:44:43,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:44:43,554 INFO L225 Difference]: With dead ends: 89 [2018-04-11 15:44:43,554 INFO L226 Difference]: Without dead ends: 89 [2018-04-11 15:44:43,554 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:44:43,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-04-11 15:44:43,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 69. [2018-04-11 15:44:43,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-04-11 15:44:43,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2018-04-11 15:44:43,556 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 30 [2018-04-11 15:44:43,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:44:43,557 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2018-04-11 15:44:43,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:44:43,557 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2018-04-11 15:44:43,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 15:44:43,557 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:44:43,558 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] [2018-04-11 15:44:43,558 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:44:43,558 INFO L82 PathProgramCache]: Analyzing trace with hash 810426053, now seen corresponding path program 1 times [2018-04-11 15:44:43,558 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:44:43,558 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:44:43,559 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:43,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:43,559 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:43,570 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:44:43,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:44:43,686 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:44:43,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 15:44:43,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:44:43,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:44:43,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:44:43,686 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 8 states. [2018-04-11 15:44:43,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:44:43,820 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2018-04-11 15:44:43,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:44:43,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-04-11 15:44:43,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:44:43,821 INFO L225 Difference]: With dead ends: 98 [2018-04-11 15:44:43,821 INFO L226 Difference]: Without dead ends: 98 [2018-04-11 15:44:43,821 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:44:43,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-04-11 15:44:43,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 79. [2018-04-11 15:44:43,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-11 15:44:43,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-04-11 15:44:43,822 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 34 [2018-04-11 15:44:43,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:44:43,823 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-04-11 15:44:43,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:44:43,823 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-04-11 15:44:43,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 15:44:43,823 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:44:43,823 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] [2018-04-11 15:44:43,823 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:44:43,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1393118126, now seen corresponding path program 1 times [2018-04-11 15:44:43,823 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:44:43,823 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:44:43,824 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:43,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:43,824 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:43,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:44:43,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:44:43,938 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:44:43,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 15:44:43,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:44:43,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:44:43,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:44:43,939 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 9 states. [2018-04-11 15:44:44,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:44:44,126 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2018-04-11 15:44:44,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:44:44,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-04-11 15:44:44,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:44:44,154 INFO L225 Difference]: With dead ends: 115 [2018-04-11 15:44:44,154 INFO L226 Difference]: Without dead ends: 115 [2018-04-11 15:44:44,155 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:44:44,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-04-11 15:44:44,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 79. [2018-04-11 15:44:44,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-11 15:44:44,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2018-04-11 15:44:44,157 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 35 [2018-04-11 15:44:44,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:44:44,157 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2018-04-11 15:44:44,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:44:44,157 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2018-04-11 15:44:44,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 15:44:44,158 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:44:44,158 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] [2018-04-11 15:44:44,158 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:44:44,158 INFO L82 PathProgramCache]: Analyzing trace with hash 236989053, now seen corresponding path program 1 times [2018-04-11 15:44:44,158 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:44:44,158 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:44:44,162 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:44,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:44,163 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:44,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:44:44,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:44:44,282 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:44:44,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 15:44:44,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:44:44,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:44:44,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:44:44,283 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 9 states. [2018-04-11 15:44:44,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:44:44,545 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2018-04-11 15:44:44,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:44:44,545 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-04-11 15:44:44,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:44:44,546 INFO L225 Difference]: With dead ends: 103 [2018-04-11 15:44:44,546 INFO L226 Difference]: Without dead ends: 103 [2018-04-11 15:44:44,546 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:44:44,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-04-11 15:44:44,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 79. [2018-04-11 15:44:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-11 15:44:44,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-04-11 15:44:44,548 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 36 [2018-04-11 15:44:44,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:44:44,548 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-04-11 15:44:44,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:44:44,548 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-04-11 15:44:44,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 15:44:44,548 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:44:44,548 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:44:44,548 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:44:44,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1741437104, now seen corresponding path program 1 times [2018-04-11 15:44:44,549 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:44:44,549 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:44:44,549 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:44,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:44,549 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:44,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:44:44,558 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:44:44,559 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:44:44,559 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:44:44,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:44,584 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:44:44,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:44,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:44,596 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 15:44:44,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:44,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:44,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-11 15:44:44,606 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 15:44:44,607 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 15:44:44,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:44,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:44,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:44,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-04-11 15:44:44,627 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 15:44:44,629 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 15:44:44,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:44,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:44,637 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 15:44:44,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-11 15:44:44,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-04-11 15:44:44,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:44,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 46 [2018-04-11 15:44:44,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:44,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:44,683 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 15:44:44,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-04-11 15:44:44,782 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 56 treesize of output 45 [2018-04-11 15:44:44,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:44,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:44,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 58 [2018-04-11 15:44:44,812 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-04-11 15:44:44,870 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 15:44:44,870 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:44,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-04-11 15:44:44,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-04-11 15:44:44,955 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:68, output treesize:133 [2018-04-11 15:44:45,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:45,079 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 15:44:45,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:45,083 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 15:44:45,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-11 15:44:45,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:44:45,101 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:44:45,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:44:45,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:44:45,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:44:45,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:44:45,102 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 17 states. [2018-04-11 15:44:47,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:44:47,889 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2018-04-11 15:44:47,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 15:44:47,889 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-04-11 15:44:47,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:44:47,890 INFO L225 Difference]: With dead ends: 100 [2018-04-11 15:44:47,890 INFO L226 Difference]: Without dead ends: 100 [2018-04-11 15:44:47,890 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=227, Invalid=1033, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 15:44:47,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-11 15:44:47,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 87. [2018-04-11 15:44:47,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-04-11 15:44:47,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2018-04-11 15:44:47,893 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 38 [2018-04-11 15:44:47,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:44:47,893 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2018-04-11 15:44:47,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:44:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2018-04-11 15:44:47,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 15:44:47,893 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:44:47,894 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:44:47,894 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:44:47,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1741437105, now seen corresponding path program 1 times [2018-04-11 15:44:47,894 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:44:47,894 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:44:47,895 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:47,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:47,895 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:47,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:44:47,908 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:44:47,908 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:44:47,908 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:44:47,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:47,938 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:44:47,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:47,976 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 15:44:47,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:47,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:47,985 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:47,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-11 15:44:47,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:47,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:47,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 15:44:48,010 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 15:44:48,012 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 15:44:48,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:48,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:48,022 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 15:44:48,024 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 15:44:48,024 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:48,025 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:48,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:48,032 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-04-11 15:44:48,050 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 56 treesize of output 52 [2018-04-11 15:44:48,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:44:48,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:48,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:48,068 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 27 treesize of output 28 [2018-04-11 15:44:48,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:44:48,070 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:48,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:48,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:48,081 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:55 [2018-04-11 15:44:48,101 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 53 treesize of output 45 [2018-04-11 15:44:48,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:48,104 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 42 treesize of output 55 [2018-04-11 15:44:48,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:48,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:48,127 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 34 treesize of output 37 [2018-04-11 15:44:48,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:48,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:48,130 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 18 treesize of output 35 [2018-04-11 15:44:48,130 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:48,136 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:48,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:48,147 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:75 [2018-04-11 15:44:48,211 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 37 treesize of output 33 [2018-04-11 15:44:48,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:48,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:48,223 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 2 case distinctions, treesize of input 20 treesize of output 33 [2018-04-11 15:44:48,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-11 15:44:48,251 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 15:44:48,251 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:48,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:44:48,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-11 15:44:48,283 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:98, output treesize:211 [2018-04-11 15:44:48,464 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 78 treesize of output 67 [2018-04-11 15:44:48,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:48,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:48,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:48,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 46 [2018-04-11 15:44:48,474 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 15:44:48,489 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 15:44:48,489 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:48,495 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 15:44:48,532 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 77 treesize of output 66 [2018-04-11 15:44:48,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:48,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:48,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 54 [2018-04-11 15:44:48,544 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 15:44:48,585 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 15:44:48,585 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:48,607 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 15:44:48,668 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 82 treesize of output 71 [2018-04-11 15:44:48,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:48,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:48,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:48,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 56 [2018-04-11 15:44:48,679 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 15:44:48,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 15:44:48,702 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:48,714 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 15:44:48,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-04-11 15:44:48,779 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:238, output treesize:251 [2018-04-11 15:44:48,935 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:44:48,936 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:44:48,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:44:48,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:44:48,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:44:48,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:44:48,937 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand 19 states. [2018-04-11 15:44:50,156 WARN L151 SmtUtils]: Spent 262ms on a formula simplification. DAG size of input: 112 DAG size of output 99 [2018-04-11 15:44:50,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:44:50,494 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2018-04-11 15:44:50,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 15:44:50,494 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2018-04-11 15:44:50,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:44:50,494 INFO L225 Difference]: With dead ends: 134 [2018-04-11 15:44:50,494 INFO L226 Difference]: Without dead ends: 134 [2018-04-11 15:44:50,495 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=213, Invalid=1193, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:44:50,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-11 15:44:50,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2018-04-11 15:44:50,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-11 15:44:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 132 transitions. [2018-04-11 15:44:50,497 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 132 transitions. Word has length 38 [2018-04-11 15:44:50,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:44:50,497 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 132 transitions. [2018-04-11 15:44:50,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:44:50,497 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 132 transitions. [2018-04-11 15:44:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 15:44:50,498 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:44:50,498 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:44:50,498 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:44:50,498 INFO L82 PathProgramCache]: Analyzing trace with hash 769968409, now seen corresponding path program 1 times [2018-04-11 15:44:50,498 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:44:50,498 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:44:50,499 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:50,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:50,499 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:50,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:44:50,511 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:44:50,511 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:44:50,511 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:44:50,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:50,530 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:44:50,547 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 15:44:50,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:50,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:50,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:44:50,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:50,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:50,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 14 [2018-04-11 15:44:50,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:50,567 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 13 treesize of output 10 [2018-04-11 15:44:50,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 15:44:50,568 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:50,569 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:50,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:50,572 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:14 [2018-04-11 15:44:50,585 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 20 treesize of output 16 [2018-04-11 15:44:50,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 4 [2018-04-11 15:44:50,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:50,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:50,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:50,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:8 [2018-04-11 15:44:50,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:44:50,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:44:50,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 15:44:50,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:44:50,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:44:50,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:44:50,598 INFO L87 Difference]: Start difference. First operand 116 states and 132 transitions. Second operand 9 states. [2018-04-11 15:44:50,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:44:50,733 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2018-04-11 15:44:50,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:44:50,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-04-11 15:44:50,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:44:50,734 INFO L225 Difference]: With dead ends: 130 [2018-04-11 15:44:50,734 INFO L226 Difference]: Without dead ends: 130 [2018-04-11 15:44:50,734 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:44:50,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-04-11 15:44:50,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 116. [2018-04-11 15:44:50,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-11 15:44:50,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 131 transitions. [2018-04-11 15:44:50,736 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 131 transitions. Word has length 39 [2018-04-11 15:44:50,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:44:50,736 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 131 transitions. [2018-04-11 15:44:50,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:44:50,736 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2018-04-11 15:44:50,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 15:44:50,736 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:44:50,736 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:44:50,736 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:44:50,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1850025554, now seen corresponding path program 1 times [2018-04-11 15:44:50,737 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:44:50,737 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:44:50,737 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:50,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:50,737 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:50,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:44:50,743 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:44:50,743 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:44:50,744 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:44:50,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:50,762 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:44:50,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 15:44:50,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:50,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:50,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-04-11 15:44:50,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:50,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:50,783 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 11 treesize of output 12 [2018-04-11 15:44:50,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:50,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:50,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2018-04-11 15:44:50,811 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 15:44:50,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-04-11 15:44:50,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:50,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:50,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:50,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-04-11 15:44:50,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-04-11 15:44:50,830 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 15:44:50,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:50,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:50,838 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 15:44:50,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-11 15:44:50,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-04-11 15:44:50,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:50,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2018-04-11 15:44:50,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:50,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:50,879 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 15:44:50,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2018-04-11 15:44:50,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 44 [2018-04-11 15:44:50,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:50,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:50,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 57 [2018-04-11 15:44:50,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 6 xjuncts. [2018-04-11 15:44:51,029 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 15:44:51,030 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:51,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 15:44:51,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-11 15:44:51,065 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:67, output treesize:58 [2018-04-11 15:44:51,119 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 15:44:51,119 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:44:51,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 15:44:51,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:44:51,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:44:51,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:44:51,119 INFO L87 Difference]: Start difference. First operand 116 states and 131 transitions. Second operand 17 states. [2018-04-11 15:44:51,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:44:51,685 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2018-04-11 15:44:51,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:44:51,686 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2018-04-11 15:44:51,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:44:51,687 INFO L225 Difference]: With dead ends: 130 [2018-04-11 15:44:51,687 INFO L226 Difference]: Without dead ends: 130 [2018-04-11 15:44:51,687 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=177, Invalid=879, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 15:44:51,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-04-11 15:44:51,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 116. [2018-04-11 15:44:51,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-11 15:44:51,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2018-04-11 15:44:51,690 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 39 [2018-04-11 15:44:51,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:44:51,690 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2018-04-11 15:44:51,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:44:51,690 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2018-04-11 15:44:51,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 15:44:51,690 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:44:51,690 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 15:44:51,691 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:44:51,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1427071872, now seen corresponding path program 1 times [2018-04-11 15:44:51,691 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:44:51,691 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:44:51,691 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:51,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:51,692 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:51,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:44:51,722 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:44:51,722 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:44:51,722 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:44:51,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:51,741 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:44:51,752 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 15:44:51,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:51,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:51,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:44:51,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:51,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44: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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 14 [2018-04-11 15:44:51,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:51,768 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 13 treesize of output 10 [2018-04-11 15:44:51,769 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 10 treesize of output 9 [2018-04-11 15:44:51,769 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:51,770 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:51,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:51,773 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:14 [2018-04-11 15:44:51,790 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 20 treesize of output 16 [2018-04-11 15:44:51,791 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 16 treesize of output 4 [2018-04-11 15:44:51,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:51,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:51,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:51,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:13 [2018-04-11 15:44:51,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:51,803 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 15:44:51,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:51,806 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 15:44:51,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:14 [2018-04-11 15:44:51,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:44:51,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:44:51,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 15:44:51,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 15:44:51,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 15:44:51,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:44:51,823 INFO L87 Difference]: Start difference. First operand 116 states and 130 transitions. Second operand 12 states. [2018-04-11 15:44:52,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:44:52,063 INFO L93 Difference]: Finished difference Result 129 states and 143 transitions. [2018-04-11 15:44:52,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:44:52,063 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-04-11 15:44:52,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:44:52,064 INFO L225 Difference]: With dead ends: 129 [2018-04-11 15:44:52,064 INFO L226 Difference]: Without dead ends: 129 [2018-04-11 15:44:52,064 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=572, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:44:52,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-04-11 15:44:52,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118. [2018-04-11 15:44:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 15:44:52,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2018-04-11 15:44:52,067 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 40 [2018-04-11 15:44:52,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:44:52,067 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 132 transitions. [2018-04-11 15:44:52,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 15:44:52,067 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2018-04-11 15:44:52,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 15:44:52,068 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:44:52,068 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:44:52,068 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:44:52,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1516187406, now seen corresponding path program 1 times [2018-04-11 15:44:52,068 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:44:52,068 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:44:52,069 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:52,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:52,069 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:52,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:44:52,083 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:44:52,083 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:44:52,083 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:44:52,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:52,112 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:44:52,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:52,145 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 15:44:52,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:52,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:52,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:52,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-11 15:44:52,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:52,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:52,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 15:44:52,179 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 15:44:52,181 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 15:44:52,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:52,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:52,190 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 15:44:52,191 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 15:44:52,191 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:52,192 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:52,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:52,198 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-04-11 15:44:52,214 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 56 treesize of output 52 [2018-04-11 15:44:52,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:44:52,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:52,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:52,240 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 27 treesize of output 28 [2018-04-11 15:44:52,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:44:52,242 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:52,245 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:52,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:52,250 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:55 [2018-04-11 15:44:52,267 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 53 treesize of output 45 [2018-04-11 15:44:52,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:52,270 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 42 treesize of output 55 [2018-04-11 15:44:52,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:52,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:52,289 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 34 treesize of output 37 [2018-04-11 15:44:52,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:52,291 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:52,291 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 18 treesize of output 35 [2018-04-11 15:44:52,291 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:52,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:52,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:52,305 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:75 [2018-04-11 15:44:52,367 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 37 treesize of output 33 [2018-04-11 15:44:52,369 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 15:44:52,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:52,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:52,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:52,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 36 [2018-04-11 15:44:52,386 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-04-11 15:44:52,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:44:52,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-04-11 15:44:52,428 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:98, output treesize:200 [2018-04-11 15:44:52,577 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 77 treesize of output 66 [2018-04-11 15:44:52,580 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 15:44:52,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:52,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:52,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:52,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:52,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 50 [2018-04-11 15:44:52,612 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 15:44:52,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 15:44:52,727 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 71 treesize of output 60 [2018-04-11 15:44:52,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:52,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:52,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 58 [2018-04-11 15:44:52,751 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-04-11 15:44:52,822 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 15:44:52,822 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:52,869 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-04-11 15:44:52,985 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 78 treesize of output 67 [2018-04-11 15:44:52,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:52,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:52,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:52,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 46 [2018-04-11 15:44:52,992 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:44:53,011 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 15:44:53,011 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:53,019 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:44:53,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2018-04-11 15:44:53,127 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:227, output treesize:323 [2018-04-11 15:44:53,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:44:53,299 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:44:53,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 15:44:53,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:44:53,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:44:53,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:44:53,299 INFO L87 Difference]: Start difference. First operand 118 states and 132 transitions. Second operand 21 states. [2018-04-11 15:44:56,596 WARN L151 SmtUtils]: Spent 2534ms on a formula simplification. DAG size of input: 116 DAG size of output 114 [2018-04-11 15:44:57,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:44:57,178 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-04-11 15:44:57,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:44:57,178 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-04-11 15:44:57,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:44:57,179 INFO L225 Difference]: With dead ends: 137 [2018-04-11 15:44:57,179 INFO L226 Difference]: Without dead ends: 137 [2018-04-11 15:44:57,179 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=248, Invalid=1558, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 15:44:57,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-11 15:44:57,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 118. [2018-04-11 15:44:57,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 15:44:57,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 131 transitions. [2018-04-11 15:44:57,181 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 131 transitions. Word has length 40 [2018-04-11 15:44:57,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:44:57,181 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 131 transitions. [2018-04-11 15:44:57,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:44:57,181 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2018-04-11 15:44:57,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 15:44:57,181 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:44:57,181 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:44:57,181 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:44:57,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1432049849, now seen corresponding path program 1 times [2018-04-11 15:44:57,182 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:44:57,182 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:44:57,182 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:57,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:57,182 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:44:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:57,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:44:57,195 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:44:57,195 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:44:57,195 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:44:57,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:44:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:44:57,221 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:44:57,233 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 15:44:57,235 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 15:44:57,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-11 15:44:57,247 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 15:44:57,249 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 15:44:57,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-04-11 15:44:57,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:57,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:57,261 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 20 treesize of output 41 [2018-04-11 15:44:57,261 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,265 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,280 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-04-11 15:44:57,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:57,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:57,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-11 15:44:57,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:29 [2018-04-11 15:44:57,329 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 19 treesize of output 20 [2018-04-11 15:44:57,330 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 15:44:57,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-04-11 15:44:57,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 15:44:57,345 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,349 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,357 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:54 [2018-04-11 15:44:57,375 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 84 treesize of output 74 [2018-04-11 15:44:57,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:57,377 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 22 treesize of output 39 [2018-04-11 15:44:57,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-04-11 15:44:57,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:57,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 35 [2018-04-11 15:44:57,396 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,408 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:94, output treesize:67 [2018-04-11 15:44:57,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-04-11 15:44:57,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:57,441 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:57,441 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 18 treesize of output 35 [2018-04-11 15:44:57,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,462 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 70 treesize of output 56 [2018-04-11 15:44:57,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:57,464 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 55 treesize of output 72 [2018-04-11 15:44:57,464 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,472 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,481 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:95, output treesize:87 [2018-04-11 15:44:57,792 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:44:57,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:57,793 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 76 [2018-04-11 15:44:57,795 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:44:57,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:57,804 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 43 [2018-04-11 15:44:57,805 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 15:44:57,821 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 42 treesize of output 28 [2018-04-11 15:44:57,821 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,846 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 49 treesize of output 41 [2018-04-11 15:44:57,849 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:44:57,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:57,850 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 18 treesize of output 13 [2018-04-11 15:44:57,850 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:57,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:44:57,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-04-11 15:44:57,859 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,862 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:44:57,869 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:140, output treesize:12 [2018-04-11 15:44:57,898 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:44:57,898 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:44:57,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 15:44:57,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:44:57,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:44:57,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=447, Unknown=2, NotChecked=0, Total=506 [2018-04-11 15:44:57,899 INFO L87 Difference]: Start difference. First operand 118 states and 131 transitions. Second operand 23 states. [2018-04-11 15:45:00,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:45:00,033 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2018-04-11 15:45:00,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 15:45:00,034 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2018-04-11 15:45:00,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:45:00,034 INFO L225 Difference]: With dead ends: 133 [2018-04-11 15:45:00,034 INFO L226 Difference]: Without dead ends: 133 [2018-04-11 15:45:00,035 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=262, Invalid=1893, Unknown=7, NotChecked=0, Total=2162 [2018-04-11 15:45:00,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-11 15:45:00,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 112. [2018-04-11 15:45:00,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-04-11 15:45:00,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2018-04-11 15:45:00,037 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 43 [2018-04-11 15:45:00,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:45:00,037 INFO L459 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2018-04-11 15:45:00,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:45:00,037 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2018-04-11 15:45:00,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:45:00,037 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:45:00,038 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:45:00,038 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:45:00,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1343743614, now seen corresponding path program 1 times [2018-04-11 15:45:00,038 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:45:00,038 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:45:00,039 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:45:00,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:45:00,039 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:45:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:45:00,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:45:00,053 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:45:00,053 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:45:00,053 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:45:00,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:45:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:45:00,083 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:45:00,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:45:00,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:00,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:00,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:45:00,123 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:00,123 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:00,124 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 15:45:00,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:00,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:00,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-11 15:45:00,137 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 15:45:00,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 15:45:00,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:00,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:00,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:00,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-11 15:45:00,161 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 15:45:00,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 15:45:00,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:00,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:00,172 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 15:45:00,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-11 15:45:00,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:00,187 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:00,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:00,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-04-11 15:45:00,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:00,197 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 15:45:00,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:56 [2018-04-11 15:45:00,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-04-11 15:45:00,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:00,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 54 [2018-04-11 15:45:00,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:00,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:00,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:45:00,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:74 [2018-04-11 15:45:00,398 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 82 treesize of output 60 [2018-04-11 15:45:00,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 15:45:00,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:00,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 29 [2018-04-11 15:45:00,408 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:00,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:00,419 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 15:45:00,419 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:90, output treesize:31 [2018-04-11 15:45:00,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:00,440 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 15:45:00,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:00,448 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 15:45:00,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:23 [2018-04-11 15:45:00,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:00,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:00,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:00,490 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 15:45:00,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:00,497 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 15:45:00,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:20 [2018-04-11 15:45:00,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:45:00,518 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:45:00,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:45:00,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:45:00,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:45:00,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:45:00,518 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 20 states. [2018-04-11 15:45:05,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:45:05,459 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2018-04-11 15:45:05,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 15:45:05,460 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2018-04-11 15:45:05,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:45:05,460 INFO L225 Difference]: With dead ends: 136 [2018-04-11 15:45:05,460 INFO L226 Difference]: Without dead ends: 136 [2018-04-11 15:45:05,461 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=362, Invalid=1618, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 15:45:05,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-11 15:45:05,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 112. [2018-04-11 15:45:05,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-04-11 15:45:05,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2018-04-11 15:45:05,463 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 44 [2018-04-11 15:45:05,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:45:05,464 INFO L459 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2018-04-11 15:45:05,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:45:05,464 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2018-04-11 15:45:05,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:45:05,464 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:45:05,464 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:45:05,464 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:45:05,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1343743613, now seen corresponding path program 1 times [2018-04-11 15:45:05,465 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:45:05,465 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:45:05,465 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:45:05,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:45:05,465 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:45:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:45:05,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:45:05,477 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:45:05,477 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:45:05,478 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:45:05,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:45:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:45:05,504 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:45:05,518 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 15:45:05,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:45:05,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:05,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:05,543 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 15:45:05,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,551 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 15:45:05,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2018-04-11 15:45:05,576 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 15:45:05,577 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 15:45:05,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,587 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 15:45:05,588 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 15:45:05,588 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,589 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,596 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-04-11 15:45:05,612 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 65 treesize of output 61 [2018-04-11 15:45:05,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:45:05,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,635 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 27 treesize of output 28 [2018-04-11 15:45:05,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:45:05,637 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,640 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,650 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:85, output treesize:69 [2018-04-11 15:45:05,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:05,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:05,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:05,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 46 [2018-04-11 15:45:05,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:05,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:05,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:05,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 15:45:05,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:60 [2018-04-11 15:45:05,740 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 53 treesize of output 45 [2018-04-11 15:45:05,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:05,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:05,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 63 [2018-04-11 15:45:05,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,780 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 32 treesize of output 35 [2018-04-11 15:45:05,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:05,783 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 15:45:05,783 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,798 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 15:45:05,798 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:86, output treesize:66 [2018-04-11 15:45:05,868 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 58 treesize of output 47 [2018-04-11 15:45:05,869 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 15:45:05,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:05,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:05,883 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 50 [2018-04-11 15:45:05,884 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 15:45:05,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 15:45:05,931 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 36 [2018-04-11 15:45:05,932 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 15:45:05,932 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,941 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 1 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:45:05,941 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 15:45:05,947 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:45:05,949 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 46 treesize of output 40 [2018-04-11 15:45:05,950 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 15:45:05,950 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,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, 3 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 15:45:05,958 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,962 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,964 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 40 treesize of output 38 [2018-04-11 15:45:05,965 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 15:45:05,965 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 15:45:05,972 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:05,976 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:06,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 4 xjuncts. [2018-04-11 15:45:06,002 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:89, output treesize:129 [2018-04-11 15:45:06,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:45:06,101 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:45:06,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:45:06,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:45:06,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:45:06,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:45:06,102 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 17 states. [2018-04-11 15:45:06,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:45:06,906 INFO L93 Difference]: Finished difference Result 218 states and 237 transitions. [2018-04-11 15:45:06,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 15:45:06,906 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-04-11 15:45:06,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:45:06,907 INFO L225 Difference]: With dead ends: 218 [2018-04-11 15:45:06,907 INFO L226 Difference]: Without dead ends: 218 [2018-04-11 15:45:06,907 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:45:06,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-04-11 15:45:06,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 144. [2018-04-11 15:45:06,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-11 15:45:06,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 159 transitions. [2018-04-11 15:45:06,909 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 159 transitions. Word has length 44 [2018-04-11 15:45:06,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:45:06,909 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 159 transitions. [2018-04-11 15:45:06,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:45:06,909 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 159 transitions. [2018-04-11 15:45:06,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 15:45:06,910 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:45:06,910 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:45:06,910 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:45:06,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1293619996, now seen corresponding path program 1 times [2018-04-11 15:45:06,910 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:45:06,910 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:45:06,910 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:45:06,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:45:06,911 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:45:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:45:06,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:45:06,919 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:45:06,919 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:45:06,919 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:45:06,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:45:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:45:06,938 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:45:06,940 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 15:45:06,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:06,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:06,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-04-11 15:45:06,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:06,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:06,960 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 11 treesize of output 12 [2018-04-11 15:45:06,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:06,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:06,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2018-04-11 15:45:06,989 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 15:45:06,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 15:45:06,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:06,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:06,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:06,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-04-11 15:45:07,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-04-11 15:45:07,024 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 15:45:07,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:07,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:07,034 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 15:45:07,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-11 15:45:07,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-04-11 15:45:07,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:07,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2018-04-11 15:45:07,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:07,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:07,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:45:07,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:33 [2018-04-11 15:45:07,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-04-11 15:45:07,107 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 15:45:07,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:07,132 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 18 treesize of output 17 [2018-04-11 15:45:07,132 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:45:07,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:45:07,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:45:07,144 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:49, output treesize:16 [2018-04-11 15:45:07,187 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:45:07,188 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:45:07,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 15:45:07,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 15:45:07,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 15:45:07,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:45:07,188 INFO L87 Difference]: Start difference. First operand 144 states and 159 transitions. Second operand 14 states. [2018-04-11 15:45:07,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:45:07,591 INFO L93 Difference]: Finished difference Result 150 states and 164 transitions. [2018-04-11 15:45:07,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:45:07,591 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-04-11 15:45:07,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:45:07,592 INFO L225 Difference]: With dead ends: 150 [2018-04-11 15:45:07,592 INFO L226 Difference]: Without dead ends: 150 [2018-04-11 15:45:07,592 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:45:07,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-11 15:45:07,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2018-04-11 15:45:07,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-11 15:45:07,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 158 transitions. [2018-04-11 15:45:07,594 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 158 transitions. Word has length 45 [2018-04-11 15:45:07,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:45:07,594 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 158 transitions. [2018-04-11 15:45:07,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 15:45:07,594 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2018-04-11 15:45:07,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 15:45:07,594 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:45:07,594 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:45:07,595 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:45:07,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1862490276, now seen corresponding path program 2 times [2018-04-11 15:45:07,595 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:45:07,595 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:45:07,595 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:45:07,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:45:07,595 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:45:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:45:07,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:45:07,608 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:45:07,608 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:45:07,608 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:45:07,608 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:45:07,625 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:45:07,626 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:45:07,628 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:45:07,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:45:07,637 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 15:45:07,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:07,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:07,667 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 15:45:07,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:45:07,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:07,670 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:07,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:07,676 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-11 15:45:07,689 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 15:45:07,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:07,692 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 15:45:07,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:07,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:07,711 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 15:45:07,713 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:07,714 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 15:45:07,714 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:07,718 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:07,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:07,728 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-04-11 15:45:07,746 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 32 treesize of output 25 [2018-04-11 15:45:07,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:07,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:07,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:07,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:07,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-04-11 15:45:07,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:07,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:07,780 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 30 treesize of output 23 [2018-04-11 15:45:07,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:07,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:07,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:07,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 15:45:07,787 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:07,794 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:07,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:07,802 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:72, output treesize:64 [2018-04-11 15:45:07,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:07,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:07,829 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 15:45:07,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:07,839 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 15:45:07,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:66 [2018-04-11 15:45:07,891 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 39 treesize of output 40 [2018-04-11 15:45:07,893 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 15:45:07,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:07,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:07,926 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 37 treesize of output 38 [2018-04-11 15:45:07,929 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 15:45:07,929 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:07,936 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:07,955 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 15:45:07,955 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:91, output treesize:83 [2018-04-11 15:45:07,991 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 9 treesize of output 1 [2018-04-11 15:45:07,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:08,021 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 139 treesize of output 117 [2018-04-11 15:45:08,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,031 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 121 [2018-04-11 15:45:08,040 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-11 15:45:08,120 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:45:08,177 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 132 treesize of output 107 [2018-04-11 15:45:08,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,181 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:08,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,184 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 40 treesize of output 121 [2018-04-11 15:45:08,185 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:08,199 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:08,204 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 138 treesize of output 113 [2018-04-11 15:45:08,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 133 [2018-04-11 15:45:08,217 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 15:45:08,253 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:45:08,257 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 136 treesize of output 111 [2018-04-11 15:45:08,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,262 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:08,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,265 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 40 treesize of output 127 [2018-04-11 15:45:08,266 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:08,281 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:08,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-11 15:45:08,329 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:164, output treesize:398 [2018-04-11 15:45:08,425 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 152 treesize of output 133 [2018-04-11 15:45:08,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,428 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 109 treesize of output 140 [2018-04-11 15:45:08,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:08,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:08,545 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 167 treesize of output 158 [2018-04-11 15:45:08,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,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 48 treesize of output 59 [2018-04-11 15:45:08,549 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:08,569 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:08,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 137 [2018-04-11 15:45:08,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,665 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 113 treesize of output 138 [2018-04-11 15:45:08,665 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:08,683 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:08,757 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 162 treesize of output 142 [2018-04-11 15:45:08,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,760 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 111 treesize of output 132 [2018-04-11 15:45:08,760 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:08,776 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:08,845 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 158 treesize of output 137 [2018-04-11 15:45:08,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,847 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 117 treesize of output 150 [2018-04-11 15:45:08,848 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:08,863 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:08,925 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 148 treesize of output 130 [2018-04-11 15:45:08,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:08,928 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 103 treesize of output 122 [2018-04-11 15:45:08,928 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:08,942 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:08,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-11 15:45:08,994 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:482, output treesize:458 [2018-04-11 15:45:10,040 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:10,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 181 [2018-04-11 15:45:10,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:10,047 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:10,047 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:10,048 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:10,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:10,053 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:10,053 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:10,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 90 [2018-04-11 15:45:10,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-11 15:45:10,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:10,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2018-04-11 15:45:10,146 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 15:45:10,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:10,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-04-11 15:45:10,167 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 15:45:10,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:10,171 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 57 treesize of output 48 [2018-04-11 15:45:10,172 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:45:10,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-11 15:45:10,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:10,408 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:10,408 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:10,410 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 173 treesize of output 163 [2018-04-11 15:45:10,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:10,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:10,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:10,426 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 0 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 85 [2018-04-11 15:45:10,427 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-04-11 15:45:10,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:10,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:10,471 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:10,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:10,472 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 60 treesize of output 64 [2018-04-11 15:45:10,472 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:45:10,508 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-11 15:45:10,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:10,748 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:10,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:10,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 175 [2018-04-11 15:45:10,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:10,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:10,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:10,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:10,782 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 149 [2018-04-11 15:45:10,783 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-11 15:45:10,815 INFO L267 ElimStorePlain]: Start of recursive call 11: 88 dim-0 vars, End of recursive call: 88 dim-0 vars, and 96 xjuncts. [2018-04-11 15:45:11,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,153 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:11,186 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 82 [2018-04-11 15:45:11,186 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:11,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,189 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:11,190 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 93 treesize of output 85 [2018-04-11 15:45:11,190 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:45:11,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,192 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:11,193 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 95 treesize of output 87 [2018-04-11 15:45:11,193 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:45:11,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,195 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:11,195 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 100 treesize of output 92 [2018-04-11 15:45:11,196 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:45:11,260 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-11 15:45:11,609 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 119 treesize of output 93 [2018-04-11 15:45:11,611 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,614 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,616 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:11,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 70 [2018-04-11 15:45:11,619 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-04-11 15:45:11,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-11 15:45:11,653 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 6 xjuncts. [2018-04-11 15:45:11,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-04-11 15:45:11,656 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 8 xjuncts. [2018-04-11 15:45:11,705 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 15:45:11,708 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 126 treesize of output 98 [2018-04-11 15:45:11,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 56 [2018-04-11 15:45:11,711 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:45:11,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,734 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:11,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2018-04-11 15:45:11,735 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:11,754 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:45:11,757 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 121 treesize of output 95 [2018-04-11 15:45:11,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,764 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:11,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 70 [2018-04-11 15:45:11,767 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-04-11 15:45:11,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-04-11 15:45:11,802 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 8 xjuncts. [2018-04-11 15:45:11,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-04-11 15:45:11,806 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 6 xjuncts. [2018-04-11 15:45:11,875 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 15:45:11,877 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 116 treesize of output 90 [2018-04-11 15:45:11,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,885 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:11,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 74 [2018-04-11 15:45:11,887 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-04-11 15:45:11,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-04-11 15:45:11,931 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:11,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:11,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-04-11 15:45:11,948 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 8 xjuncts. [2018-04-11 15:45:11,989 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 15:45:12,366 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:12,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:12,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 111 [2018-04-11 15:45:12,372 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:12,379 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 46 [2018-04-11 15:45:12,380 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 15:45:12,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:12,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:12,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:12,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:12,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2018-04-11 15:45:12,421 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 4 xjuncts. [2018-04-11 15:45:12,481 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 15:45:12,483 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:12,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:12,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 112 [2018-04-11 15:45:12,488 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:12,495 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 46 [2018-04-11 15:45:12,496 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 15:45:12,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:12,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:12,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:12,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:12,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 73 [2018-04-11 15:45:12,534 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-04-11 15:45:12,569 INFO L267 ElimStorePlain]: Start of recursive call 34: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:45:12,570 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:12,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:12,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 99 [2018-04-11 15:45:12,585 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:12,600 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 46 [2018-04-11 15:45:12,601 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 15:45:12,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:12,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:12,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:12,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:12,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 88 [2018-04-11 15:45:12,651 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 8 xjuncts. [2018-04-11 15:45:12,720 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-11 15:45:13,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,263 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 116 treesize of output 98 [2018-04-11 15:45:13,266 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,273 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 80 [2018-04-11 15:45:13,274 INFO L267 ElimStorePlain]: Start of recursive call 41: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-11 15:45:13,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,326 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:13,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 58 [2018-04-11 15:45:13,329 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-11 15:45:13,330 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,335 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:13,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 94 [2018-04-11 15:45:13,346 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 4 xjuncts. [2018-04-11 15:45:13,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,353 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:13,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 88 [2018-04-11 15:45:13,367 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 4 xjuncts. [2018-04-11 15:45:13,482 INFO L267 ElimStorePlain]: Start of recursive call 40: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-11 15:45:13,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 87 [2018-04-11 15:45:13,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,494 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 70 [2018-04-11 15:45:13,496 INFO L267 ElimStorePlain]: Start of recursive call 46: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-11 15:45:13,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,556 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:13,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 96 [2018-04-11 15:45:13,572 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 8 xjuncts. [2018-04-11 15:45:13,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,576 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:13,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 60 [2018-04-11 15:45:13,582 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 2 xjuncts. [2018-04-11 15:45:13,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,588 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,590 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:13,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 96 [2018-04-11 15:45:13,605 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 8 xjuncts. [2018-04-11 15:45:13,756 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-04-11 15:45:13,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,771 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 109 treesize of output 93 [2018-04-11 15:45:13,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,778 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:45:13,795 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 35 treesize of output 110 [2018-04-11 15:45:13,796 INFO L267 ElimStorePlain]: Start of recursive call 51: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-04-11 15:45:13,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-04-11 15:45:13,843 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 6 xjuncts. [2018-04-11 15:45:13,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:45:13,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-04-11 15:45:13,847 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 8 xjuncts. [2018-04-11 15:45:13,886 INFO L267 ElimStorePlain]: Start of recursive call 50: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 15:45:14,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 6 dim-2 vars, End of recursive call: and 21 xjuncts. [2018-04-11 15:45:14,531 INFO L202 ElimStorePlain]: Needed 53 recursive calls to eliminate 22 variables, input treesize:605, output treesize:360 [2018-04-11 15:45:14,737 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:45:14,737 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:45:14,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 15:45:14,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 15:45:14,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 15:45:14,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=491, Unknown=5, NotChecked=0, Total=552 [2018-04-11 15:45:14,737 INFO L87 Difference]: Start difference. First operand 144 states and 158 transitions. Second operand 24 states. [2018-04-11 15:45:54,001 WARN L151 SmtUtils]: Spent 306ms on a formula simplification. DAG size of input: 188 DAG size of output 187 [2018-04-11 15:45:54,771 WARN L148 SmtUtils]: Spent 112ms on a formula simplification that was a NOOP. DAG size: 236 [2018-04-11 15:46:06,318 WARN L151 SmtUtils]: Spent 229ms on a formula simplification. DAG size of input: 291 DAG size of output 140 [2018-04-11 15:46:06,639 WARN L148 SmtUtils]: Spent 103ms on a formula simplification that was a NOOP. DAG size: 165 [2018-04-11 15:46:06,826 WARN L148 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 174 [2018-04-11 15:46:07,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:46:07,101 INFO L93 Difference]: Finished difference Result 157 states and 170 transitions. [2018-04-11 15:46:07,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 15:46:07,101 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 47 [2018-04-11 15:46:07,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:46:07,101 INFO L225 Difference]: With dead ends: 157 [2018-04-11 15:46:07,101 INFO L226 Difference]: Without dead ends: 157 [2018-04-11 15:46:07,102 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=242, Invalid=1986, Unknown=28, NotChecked=0, Total=2256 [2018-04-11 15:46:07,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-04-11 15:46:07,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 149. [2018-04-11 15:46:07,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-11 15:46:07,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 163 transitions. [2018-04-11 15:46:07,104 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 163 transitions. Word has length 47 [2018-04-11 15:46:07,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:46:07,104 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 163 transitions. [2018-04-11 15:46:07,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 15:46:07,104 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 163 transitions. [2018-04-11 15:46:07,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 15:46:07,104 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:46:07,104 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:46:07,104 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:46:07,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1902622778, now seen corresponding path program 2 times [2018-04-11 15:46:07,105 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:46:07,105 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:46:07,105 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:46:07,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:46:07,105 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:46:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:46:07,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:46:07,113 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:46:07,113 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:46:07,113 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:46:07,113 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:46:07,126 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:46:07,127 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:46:07,128 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:46:07,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 11 treesize of output 8 [2018-04-11 15:46:07,169 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 15:46:07,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:07,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:07,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:07,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-04-11 15:46:07,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:07,213 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 65 treesize of output 69 [2018-04-11 15:46:07,214 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 15:46:07,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:07,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:07,227 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 15:46:07,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:48 [2018-04-11 15:46:07,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:07,247 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 61 treesize of output 59 [2018-04-11 15:46:07,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:07,250 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 56 treesize of output 71 [2018-04-11 15:46:07,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:07,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:07,265 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 15:46:07,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:57 [2018-04-11 15:46:07,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:07,329 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 64 treesize of output 54 [2018-04-11 15:46:07,330 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 47 treesize of output 33 [2018-04-11 15:46:07,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:07,338 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 15:46:07,338 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:07,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:07,346 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 15:46:07,346 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:67, output treesize:26 [2018-04-11 15:46:07,427 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~y~0.base Int) (v_subst_9 Int)) (let ((.cse0 (store |c_old(#valid)| main_~y~0.base 1))) (and (= |c_#valid| (store (store .cse0 v_subst_9 0) main_~y~0.base 0)) (= (select .cse0 v_subst_9) 0) (= (select |c_old(#valid)| main_~y~0.base) 0)))) is different from true [2018-04-11 15:46:07,434 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-04-11 15:46:07,434 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:46:07,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 15:46:07,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:46:07,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:46:07,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=221, Unknown=14, NotChecked=30, Total=306 [2018-04-11 15:46:07,435 INFO L87 Difference]: Start difference. First operand 149 states and 163 transitions. Second operand 18 states. [2018-04-11 15:46:07,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:46:07,941 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2018-04-11 15:46:07,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:46:07,941 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-04-11 15:46:07,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:46:07,942 INFO L225 Difference]: With dead ends: 152 [2018-04-11 15:46:07,942 INFO L226 Difference]: Without dead ends: 130 [2018-04-11 15:46:07,942 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=585, Unknown=15, NotChecked=50, Total=756 [2018-04-11 15:46:07,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-04-11 15:46:07,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-04-11 15:46:07,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 15:46:07,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2018-04-11 15:46:07,944 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 48 [2018-04-11 15:46:07,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:46:07,944 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2018-04-11 15:46:07,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:46:07,945 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2018-04-11 15:46:07,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 15:46:07,945 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:46:07,945 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:46:07,945 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:46:07,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1979372761, now seen corresponding path program 1 times [2018-04-11 15:46:07,945 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:46:07,946 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:46:07,946 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:46:07,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:46:07,946 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:46:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:46:07,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:46:07,964 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:46:07,964 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:46:07,964 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:46:07,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:46:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:46:07,997 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:46:08,004 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 15:46:08,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:46:08,018 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 15:46:08,019 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 15:46:08,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-11 15:46:08,035 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 15:46:08,038 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 15:46:08,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-04-11 15:46:08,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:08,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:08,055 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 20 treesize of output 41 [2018-04-11 15:46:08,055 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,060 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,068 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-04-11 15:46:08,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:08,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:08,103 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 15:46:08,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:29 [2018-04-11 15:46:08,134 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 19 treesize of output 20 [2018-04-11 15:46:08,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 15:46:08,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-04-11 15:46:08,151 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 15:46:08,151 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,155 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,163 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:54 [2018-04-11 15:46:08,181 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 49 treesize of output 38 [2018-04-11 15:46:08,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:08,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 35 [2018-04-11 15:46:08,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,201 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 65 treesize of output 55 [2018-04-11 15:46:08,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:08,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 39 [2018-04-11 15:46:08,203 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,209 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,217 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:94, output treesize:67 [2018-04-11 15:46:08,238 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 43 treesize of output 46 [2018-04-11 15:46:08,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:08,241 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 15:46:08,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,263 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 70 treesize of output 56 [2018-04-11 15:46:08,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:08,265 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 55 treesize of output 72 [2018-04-11 15:46:08,265 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,272 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,281 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 15:46:08,281 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:67 [2018-04-11 15:46:08,455 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:46:08,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 58 [2018-04-11 15:46:08,459 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:46:08,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:08,460 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 20 treesize of output 17 [2018-04-11 15:46:08,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,469 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:46:08,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-04-11 15:46:08,469 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,488 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 32 [2018-04-11 15:46:08,490 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:46:08,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:08,491 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 18 treesize of output 13 [2018-04-11 15:46:08,491 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,497 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:46:08,497 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 15:46:08,497 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,500 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:08,506 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 15:46:08,506 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:13 [2018-04-11 15:46:08,538 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:46:08,538 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:46:08,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:46:08,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:46:08,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:46:08,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=299, Unknown=3, NotChecked=0, Total=342 [2018-04-11 15:46:08,539 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand 19 states. [2018-04-11 15:46:09,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:46:09,586 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2018-04-11 15:46:09,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 15:46:09,586 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-04-11 15:46:09,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:46:09,586 INFO L225 Difference]: With dead ends: 136 [2018-04-11 15:46:09,586 INFO L226 Difference]: Without dead ends: 136 [2018-04-11 15:46:09,587 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=172, Invalid=1305, Unknown=5, NotChecked=0, Total=1482 [2018-04-11 15:46:09,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-11 15:46:09,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 123. [2018-04-11 15:46:09,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 15:46:09,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2018-04-11 15:46:09,588 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 49 [2018-04-11 15:46:09,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:46:09,588 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2018-04-11 15:46:09,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:46:09,588 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2018-04-11 15:46:09,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 15:46:09,589 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:46:09,589 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:46:09,589 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:46:09,589 INFO L82 PathProgramCache]: Analyzing trace with hash -223541461, now seen corresponding path program 2 times [2018-04-11 15:46:09,589 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:46:09,589 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:46:09,589 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:46:09,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:46:09,589 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:46:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:46:09,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:46:09,601 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:46:09,602 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:46:09,602 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:46:09,602 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:46:09,629 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:46:09,629 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:46:09,631 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:46:09,645 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 15:46:09,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:09,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:09,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:46:09,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:09,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:09,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-11 15:46:09,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:09,690 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 15:46:09,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:09,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:09,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 15:46:09,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 15:46:09,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, 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 15:46:09,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:09,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:09,724 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 15:46:09,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 15:46:09,726 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:09,727 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:09,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:09,734 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-04-11 15:46:09,752 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 27 treesize of output 28 [2018-04-11 15:46:09,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:46:09,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:09,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:09,769 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 48 treesize of output 44 [2018-04-11 15:46:09,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:46:09,771 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:09,775 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:09,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:09,783 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:55 [2018-04-11 15:46:09,804 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 34 treesize of output 37 [2018-04-11 15:46:09,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:09,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:09,828 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 18 treesize of output 35 [2018-04-11 15:46:09,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:09,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:09,851 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 53 treesize of output 45 [2018-04-11 15:46:09,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:09,853 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 42 treesize of output 55 [2018-04-11 15:46:09,853 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:09,860 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:09,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:09,870 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:75 [2018-04-11 15:46:09,938 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 37 treesize of output 33 [2018-04-11 15:46:09,940 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 15:46:09,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:09,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:09,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:09,946 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 20 treesize of output 16 [2018-04-11 15:46:09,946 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:09,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:09,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:09,956 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:89, output treesize:56 [2018-04-11 15:46:09,997 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 54 treesize of output 38 [2018-04-11 15:46:09,998 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 15:46:09,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:10,003 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 33 treesize of output 19 [2018-04-11 15:46:10,004 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:10,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:10,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:10,011 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:65, output treesize:24 [2018-04-11 15:46:10,061 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:46:10,062 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:46:10,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 15:46:10,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:46:10,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:46:10,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:46:10,062 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand 18 states. [2018-04-11 15:46:11,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:46:11,221 INFO L93 Difference]: Finished difference Result 197 states and 210 transitions. [2018-04-11 15:46:11,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 15:46:11,222 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-04-11 15:46:11,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:46:11,222 INFO L225 Difference]: With dead ends: 197 [2018-04-11 15:46:11,222 INFO L226 Difference]: Without dead ends: 197 [2018-04-11 15:46:11,223 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=457, Invalid=1349, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 15:46:11,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-11 15:46:11,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 138. [2018-04-11 15:46:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-11 15:46:11,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2018-04-11 15:46:11,225 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 49 [2018-04-11 15:46:11,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:46:11,225 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2018-04-11 15:46:11,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:46:11,225 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2018-04-11 15:46:11,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 15:46:11,225 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:46:11,226 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:46:11,226 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:46:11,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1660148340, now seen corresponding path program 3 times [2018-04-11 15:46:11,226 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:46:11,226 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:46:11,227 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:46:11,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:46:11,228 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:46:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:46:11,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:46:11,237 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:46:11,237 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:46:11,238 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:46:11,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:46:11,257 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 15:46:11,257 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:46:11,260 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:46:11,273 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 15:46:11,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:11,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:11,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:46:11,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:11,281 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 15:46:11,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:11,286 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 15:46:11,286 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-11 15:46:11,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:11,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:11,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 30 [2018-04-11 15:46:11,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:11,306 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 15:46:11,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-11 15:46:11,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:11,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:11,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 30 [2018-04-11 15:46:11,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:11,326 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 15:46:11,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:16 [2018-04-11 15:46:11,345 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 15:46:11,346 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 15:46:11,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:11,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:11,358 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 15:46:11,360 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 15:46:11,360 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:11,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:11,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:11,368 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-04-11 15:46:11,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:11,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:11,387 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:11,387 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2018-04-11 15:46:11,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:11,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 64 [2018-04-11 15:46:11,421 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 49 treesize of output 43 [2018-04-11 15:46:11,422 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:11,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-04-11 15:46:11,449 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:11,461 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:11,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 57 [2018-04-11 15:46:11,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-04-11 15:46:11,489 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:11,524 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 52 [2018-04-11 15:46:11,525 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 15:46:11,540 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:46:11,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:46:11,553 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:73, output treesize:85 [2018-04-11 15:46:11,589 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 58 treesize of output 49 [2018-04-11 15:46:11,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:11,593 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 31 treesize of output 42 [2018-04-11 15:46:11,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:11,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:11,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 87 [2018-04-11 15:46:11,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:11,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 88 [2018-04-11 15:46:11,641 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:11,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:11,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:11,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 89 [2018-04-11 15:46:11,682 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:11,713 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:46:11,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 90 [2018-04-11 15:46:11,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:11,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:11,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:11,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 104 [2018-04-11 15:46:11,763 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 15:46:11,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:11,802 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 67 treesize of output 76 [2018-04-11 15:46:11,802 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:11,821 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:46:11,849 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 54 treesize of output 49 [2018-04-11 15:46:11,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:11,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:11,851 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 22 treesize of output 47 [2018-04-11 15:46:11,851 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:11,858 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:11,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:46:11,880 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:137, output treesize:181 [2018-04-11 15:46:12,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 91 [2018-04-11 15:46:12,010 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 87 treesize of output 78 [2018-04-11 15:46:12,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:12,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:12,051 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 75 treesize of output 85 [2018-04-11 15:46:12,052 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 15:46:12,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:12,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:12,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:12,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:12,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 110 [2018-04-11 15:46:12,143 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-04-11 15:46:12,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 9 xjuncts. [2018-04-11 15:46:12,474 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 60 [2018-04-11 15:46:12,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:12,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:12,483 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 2 case distinctions, treesize of input 20 treesize of output 33 [2018-04-11 15:46:12,484 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-04-11 15:46:12,507 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:46:12,731 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 76 treesize of output 68 [2018-04-11 15:46:12,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:12,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:12,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 50 [2018-04-11 15:46:12,742 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-04-11 15:46:12,769 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:46:13,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 26 dim-0 vars, and 15 xjuncts. [2018-04-11 15:46:13,016 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:250, output treesize:946 [2018-04-11 15:46:20,319 WARN L151 SmtUtils]: Spent 7225ms on a formula simplification. DAG size of input: 320 DAG size of output 260 [2018-04-11 15:46:20,910 WARN L148 SmtUtils]: Spent 501ms on a formula simplification that was a NOOP. DAG size: 260 [2018-04-11 15:46:20,917 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 56 treesize of output 46 [2018-04-11 15:46:20,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:20,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:20,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:20,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2018-04-11 15:46:20,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-11 15:46:20,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:46:21,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 71 [2018-04-11 15:46:21,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:21,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:21,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:21,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 83 [2018-04-11 15:46:21,197 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 15:46:21,234 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 32 treesize of output 25 [2018-04-11 15:46:21,234 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:21,235 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 35 treesize of output 28 [2018-04-11 15:46:21,235 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:21,259 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:46:21,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 85 [2018-04-11 15:46:21,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:21,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:21,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:21,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 97 [2018-04-11 15:46:21,490 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-11 15:46:21,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:21,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:21,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:21,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:21,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 114 [2018-04-11 15:46:21,557 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-04-11 15:46:21,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2018-04-11 15:46:21,655 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:21,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2018-04-11 15:46:21,656 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:21,685 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:46:21,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 62 treesize of output 52 [2018-04-11 15:46:21,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:21,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:21,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:21,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:21,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 51 [2018-04-11 15:46:21,939 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-04-11 15:46:21,956 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:46:22,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 63 [2018-04-11 15:46:22,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:22,218 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:22,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 53 [2018-04-11 15:46:22,227 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-04-11 15:46:22,256 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 15:46:22,256 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:22,266 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:46:22,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 52 [2018-04-11 15:46:22,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:22,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:22,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:22,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 55 [2018-04-11 15:46:22,553 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 4 xjuncts. [2018-04-11 15:46:22,586 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:46:22,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 67 [2018-04-11 15:46:22,883 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 15:46:22,883 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:22,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:22,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:22,896 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:22,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 45 [2018-04-11 15:46:22,899 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:22,907 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:23,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 77 [2018-04-11 15:46:23,178 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 70 treesize of output 65 [2018-04-11 15:46:23,178 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:23,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:23,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:23,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:23,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2018-04-11 15:46:23,214 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:23,236 INFO L267 ElimStorePlain]: Start of recursive call 23: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:23,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 81 [2018-04-11 15:46:23,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:23,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:23,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:23,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:23,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 82 [2018-04-11 15:46:23,520 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-04-11 15:46:23,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 69 [2018-04-11 15:46:23,590 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:23,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:23,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:23,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:23,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 76 [2018-04-11 15:46:23,631 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:23,649 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:23,892 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 60 treesize of output 50 [2018-04-11 15:46:23,893 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:23,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:23,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:23,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:23,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2018-04-11 15:46:23,898 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:23,907 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:24,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 83 [2018-04-11 15:46:24,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:24,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:24,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 91 [2018-04-11 15:46:24,151 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 4 xjuncts. [2018-04-11 15:46:24,229 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 56 treesize of output 49 [2018-04-11 15:46:24,229 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:24,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-04-11 15:46:24,230 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:24,231 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 61 treesize of output 54 [2018-04-11 15:46:24,232 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:24,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:24,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:24,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:24,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:24,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 100 [2018-04-11 15:46:24,300 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 4 xjuncts. [2018-04-11 15:46:24,362 INFO L267 ElimStorePlain]: Start of recursive call 32: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 15:46:24,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 21 dim-0 vars, 11 dim-2 vars, End of recursive call: and 15 xjuncts. [2018-04-11 15:46:24,641 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 32 variables, input treesize:801, output treesize:1141 [2018-04-11 15:46:24,800 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 112 DAG size of output 29 [2018-04-11 15:46:24,863 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 15:46:24,864 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:46:24,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:46:24,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:46:24,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:46:24,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=195, Unknown=2, NotChecked=0, Total=240 [2018-04-11 15:46:24,864 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand 16 states. [2018-04-11 15:46:37,986 WARN L151 SmtUtils]: Spent 214ms on a formula simplification. DAG size of input: 123 DAG size of output 118 [2018-04-11 15:46:47,546 WARN L151 SmtUtils]: Spent 2612ms on a formula simplification. DAG size of input: 334 DAG size of output 324 [2018-04-11 15:46:48,712 WARN L151 SmtUtils]: Spent 1028ms on a formula simplification. DAG size of input: 270 DAG size of output 262 [2018-04-11 15:46:49,884 WARN L151 SmtUtils]: Spent 1101ms on a formula simplification. DAG size of input: 291 DAG size of output 266 [2018-04-11 15:46:51,102 WARN L151 SmtUtils]: Spent 1060ms on a formula simplification. DAG size of input: 272 DAG size of output 264 [2018-04-11 15:46:51,821 WARN L148 SmtUtils]: Spent 559ms on a formula simplification that was a NOOP. DAG size: 266 [2018-04-11 15:46:51,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:46:51,973 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2018-04-11 15:46:51,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 15:46:51,973 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-04-11 15:46:51,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:46:51,974 INFO L225 Difference]: With dead ends: 143 [2018-04-11 15:46:51,974 INFO L226 Difference]: Without dead ends: 143 [2018-04-11 15:46:51,974 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=246, Invalid=793, Unknown=17, NotChecked=0, Total=1056 [2018-04-11 15:46:51,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-04-11 15:46:51,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 138. [2018-04-11 15:46:51,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-11 15:46:51,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 151 transitions. [2018-04-11 15:46:51,976 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 151 transitions. Word has length 50 [2018-04-11 15:46:51,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:46:51,977 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 151 transitions. [2018-04-11 15:46:51,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:46:51,977 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 151 transitions. [2018-04-11 15:46:51,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 15:46:51,978 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:46:51,978 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:46:51,978 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:46:51,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1132313582, now seen corresponding path program 1 times [2018-04-11 15:46:51,978 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:46:51,978 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:46:51,979 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:46:51,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:46:51,979 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:46:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:46:51,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:46:51,989 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:46:51,989 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:46:51,989 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:46:51,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:46:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:46:52,014 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:46:52,016 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 15:46:52,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:46:52,044 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 15:46:52,045 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 15:46:52,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,056 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 15:46:52,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:46:52,058 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,060 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,067 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-11 15:46:52,080 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 15:46:52,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,082 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 15:46:52,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,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 21 treesize of output 16 [2018-04-11 15:46:52,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,104 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 15:46:52,104 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,108 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,118 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-04-11 15:46:52,136 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 30 treesize of output 23 [2018-04-11 15:46:52,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 15:46:52,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,165 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 32 treesize of output 25 [2018-04-11 15:46:52,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,169 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 60 [2018-04-11 15:46:52,170 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,176 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,186 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:72, output treesize:64 [2018-04-11 15:46:52,218 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,219 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 15:46:52,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:63 [2018-04-11 15:46:52,272 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 39 treesize of output 40 [2018-04-11 15:46:52,274 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 15:46:52,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,296 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 37 treesize of output 38 [2018-04-11 15:46:52,297 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 15:46:52,297 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,301 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,313 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:88, output treesize:80 [2018-04-11 15:46:52,338 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 173 treesize of output 156 [2018-04-11 15:46:52,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,344 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 56 treesize of output 118 [2018-04-11 15:46:52,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 120 [2018-04-11 15:46:52,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,382 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,382 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 54 treesize of output 116 [2018-04-11 15:46:52,382 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,402 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:184, output treesize:134 [2018-04-11 15:46:52,428 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 136 treesize of output 123 [2018-04-11 15:46:52,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,430 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 115 treesize of output 138 [2018-04-11 15:46:52,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,461 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 130 treesize of output 110 [2018-04-11 15:46:52,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,464 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 111 treesize of output 132 [2018-04-11 15:46:52,464 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,486 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 15:46:52,486 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:160, output treesize:134 [2018-04-11 15:46:52,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,657 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:46:52,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 103 [2018-04-11 15:46:52,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,666 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:46:52,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 82 [2018-04-11 15:46:52,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-11 15:46:52,710 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 79 treesize of output 62 [2018-04-11 15:46:52,710 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:52,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 64 [2018-04-11 15:46:52,712 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 15:46:52,713 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 69 treesize of output 57 [2018-04-11 15:46:52,714 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:46:52,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 15:46:52,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2018-04-11 15:46:52,775 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:170, output treesize:292 [2018-04-11 15:46:52,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,989 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:46:52,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 89 [2018-04-11 15:46:52,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,997 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:52,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:53,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:53,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 85 [2018-04-11 15:46:53,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:46:53,053 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 16 [2018-04-11 15:46:53,053 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:53,054 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 24 treesize of output 19 [2018-04-11 15:46:53,054 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:53,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:46:53,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:53,147 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:46:53,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 91 [2018-04-11 15:46:53,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:53,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:53,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:53,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:53,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:53,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:53,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:53,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:53,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-04-11 15:46:53,161 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:53,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:46:53,182 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:53,191 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:53,253 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:46:53,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 81 [2018-04-11 15:46:53,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:53,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:53,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:53,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:53,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:53,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:53,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:53,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 85 [2018-04-11 15:46:53,275 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 8 xjuncts. [2018-04-11 15:46:53,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-04-11 15:46:53,344 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:53,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-04-11 15:46:53,345 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:53,346 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 29 treesize of output 24 [2018-04-11 15:46:53,346 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:53,351 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 19 treesize of output 14 [2018-04-11 15:46:53,351 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:53,374 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 15:46:53,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-04-11 15:46:53,478 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 16 variables, input treesize:319, output treesize:341 [2018-04-11 15:46:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:46:53,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:46:53,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 15:46:53,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:46:53,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:46:53,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=451, Unknown=1, NotChecked=0, Total=506 [2018-04-11 15:46:53,616 INFO L87 Difference]: Start difference. First operand 138 states and 151 transitions. Second operand 23 states. [2018-04-11 15:46:59,127 WARN L151 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 157 DAG size of output 137 [2018-04-11 15:46:59,329 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 134 DAG size of output 130 [2018-04-11 15:46:59,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:46:59,537 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2018-04-11 15:46:59,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 15:46:59,537 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2018-04-11 15:46:59,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:46:59,538 INFO L225 Difference]: With dead ends: 149 [2018-04-11 15:46:59,538 INFO L226 Difference]: Without dead ends: 149 [2018-04-11 15:46:59,538 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=201, Invalid=1680, Unknown=11, NotChecked=0, Total=1892 [2018-04-11 15:46:59,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-04-11 15:46:59,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 143. [2018-04-11 15:46:59,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-11 15:46:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 156 transitions. [2018-04-11 15:46:59,539 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 156 transitions. Word has length 53 [2018-04-11 15:46:59,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:46:59,539 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 156 transitions. [2018-04-11 15:46:59,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:46:59,540 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2018-04-11 15:46:59,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 15:46:59,540 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:46:59,540 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:46:59,540 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:46:59,540 INFO L82 PathProgramCache]: Analyzing trace with hash -741983604, now seen corresponding path program 1 times [2018-04-11 15:46:59,540 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:46:59,540 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:46:59,541 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:46:59,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:46:59,541 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:46:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:46:59,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:46:59,550 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:46:59,550 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:46:59,550 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:46:59,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:46:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:46:59,572 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:46:59,655 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 15:46:59,657 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 15:46:59,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:59,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:59,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:59,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:33 [2018-04-11 15:46:59,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:59,694 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 56 treesize of output 60 [2018-04-11 15:46:59,696 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 15:46:59,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:59,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:59,707 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 15:46:59,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-04-11 15:46:59,727 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 15:46:59,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:59,736 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 15:46:59,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:75, output treesize:74 [2018-04-11 15:46:59,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:59,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:59,758 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 13 treesize of output 14 [2018-04-11 15:46:59,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:59,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:59,772 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 79 treesize of output 75 [2018-04-11 15:46:59,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:59,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:59,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 97 [2018-04-11 15:46:59,775 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:46:59,785 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:46:59,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:46:59,793 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:99, output treesize:81 [2018-04-11 15:46:59,997 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:46:59,998 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 101 treesize of output 85 [2018-04-11 15:47:00,000 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 15:47:00,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:00,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:00,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:00,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 47 [2018-04-11 15:47:00,012 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:00,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:00,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:00,044 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 101 treesize of output 85 [2018-04-11 15:47:00,045 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 15:47:00,045 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:00,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:00,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:00,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 47 [2018-04-11 15:47:00,058 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:00,066 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:00,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:47:00,083 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:203, output treesize:89 [2018-04-11 15:47:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:47:00,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:47:00,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 15:47:00,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 15:47:00,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 15:47:00,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:47:00,384 INFO L87 Difference]: Start difference. First operand 143 states and 156 transitions. Second operand 24 states. [2018-04-11 15:47:01,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:47:01,533 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2018-04-11 15:47:01,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 15:47:01,534 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 54 [2018-04-11 15:47:01,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:47:01,534 INFO L225 Difference]: With dead ends: 147 [2018-04-11 15:47:01,534 INFO L226 Difference]: Without dead ends: 120 [2018-04-11 15:47:01,535 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=130, Invalid=1130, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 15:47:01,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-04-11 15:47:01,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2018-04-11 15:47:01,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-04-11 15:47:01,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2018-04-11 15:47:01,536 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 54 [2018-04-11 15:47:01,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:47:01,536 INFO L459 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2018-04-11 15:47:01,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 15:47:01,536 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2018-04-11 15:47:01,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 15:47:01,536 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:47:01,536 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:47:01,536 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:47:01,536 INFO L82 PathProgramCache]: Analyzing trace with hash -319125889, now seen corresponding path program 2 times [2018-04-11 15:47:01,536 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:47:01,536 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:47:01,537 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:47:01,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:47:01,537 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:47:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:47:01,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:47:01,547 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:47:01,547 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:47:01,547 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:47:01,547 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:47:01,572 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:47:01,572 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:47:01,575 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:47:01,578 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 15:47:01,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:01,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:01,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:47:01,594 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 15:47:01,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 15:47:01,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:01,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:01,603 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 15 treesize of output 12 [2018-04-11 15:47:01,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:47:01,604 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:01,605 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:01,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:01,609 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-04-11 15:47:01,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:01,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:01,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:47:01,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:01,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:01,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2018-04-11 15:47:01,646 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 19 treesize of output 20 [2018-04-11 15:47:01,647 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 15:47:01,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:01,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:01,659 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 19 treesize of output 24 [2018-04-11 15:47:01,660 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 15:47:01,660 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:01,663 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:01,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:01,669 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-04-11 15:47:01,685 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 73 treesize of output 63 [2018-04-11 15:47:01,687 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:01,687 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 22 treesize of output 39 [2018-04-11 15:47:01,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:01,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:01,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-04-11 15:47:01,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2018-04-11 15:47:01,706 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:01,709 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:01,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:01,715 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:67 [2018-04-11 15:47:01,746 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 70 treesize of output 56 [2018-04-11 15:47:01,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:01,748 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 55 treesize of output 72 [2018-04-11 15:47:01,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:01,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:01,789 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 45 treesize of output 48 [2018-04-11 15:47:01,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:01,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:01,792 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 18 treesize of output 35 [2018-04-11 15:47:01,793 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:01,800 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:01,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:01,810 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:95, output treesize:87 [2018-04-11 15:47:02,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:02,193 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 62 [2018-04-11 15:47:02,196 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:47:02,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:02,205 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 43 [2018-04-11 15:47:02,205 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 15:47:02,220 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 22 [2018-04-11 15:47:02,220 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:02,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:02,233 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 45 treesize of output 37 [2018-04-11 15:47:02,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:02,235 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 16 treesize of output 8 [2018-04-11 15:47:02,235 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:02,241 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:47:02,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:02,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, 2 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 15:47:02,241 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:02,244 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:02,247 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 15:47:02,247 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:110, output treesize:12 [2018-04-11 15:47:02,272 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:47:02,272 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:47:02,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 15:47:02,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:47:02,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:47:02,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:47:02,273 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand 20 states. [2018-04-11 15:47:03,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:47:03,984 INFO L93 Difference]: Finished difference Result 172 states and 188 transitions. [2018-04-11 15:47:03,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 15:47:03,984 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2018-04-11 15:47:03,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:47:03,984 INFO L225 Difference]: With dead ends: 172 [2018-04-11 15:47:03,985 INFO L226 Difference]: Without dead ends: 172 [2018-04-11 15:47:03,985 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=383, Invalid=1779, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 15:47:03,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-11 15:47:03,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 144. [2018-04-11 15:47:03,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-11 15:47:03,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 158 transitions. [2018-04-11 15:47:03,986 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 158 transitions. Word has length 54 [2018-04-11 15:47:03,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:47:03,986 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 158 transitions. [2018-04-11 15:47:03,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:47:03,987 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2018-04-11 15:47:03,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 15:47:03,987 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:47:03,987 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:47:03,987 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 15:47:03,987 INFO L82 PathProgramCache]: Analyzing trace with hash 631186664, now seen corresponding path program 1 times [2018-04-11 15:47:03,987 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:47:03,987 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:47:03,988 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:47:03,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:47:03,988 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:47:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:47:03,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:47:04,001 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:47:04,002 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:47:04,002 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:47:04,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:47:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:47:04,036 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:47:04,040 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 15:47:04,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:04,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:04,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:47:04,053 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 15:47:04,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:04,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:04,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-04-11 15:47:04,071 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 15:47:04,072 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 15:47:04,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:04,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:04,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:04,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-11 15:47:04,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:04,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:04,104 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 15:47:04,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:04,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:04,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-04-11 15:47:04,138 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 15:47:04,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 15:47:04,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:04,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:04,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2018-04-11 15:47:04,157 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 15:47:04,157 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:04,161 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:04,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:04,170 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:45, output treesize:41 [2018-04-11 15:47:04,196 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 82 treesize of output 77 [2018-04-11 15:47:04,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:04,200 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 51 [2018-04-11 15:47:04,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:04,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:04,226 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 68 treesize of output 64 [2018-04-11 15:47:04,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-11 15:47:04,229 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:04,235 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:04,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:04,246 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:77 [2018-04-11 15:47:04,277 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 73 treesize of output 65 [2018-04-11 15:47:04,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:04,280 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 62 treesize of output 75 [2018-04-11 15:47:04,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:04,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:04,312 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 81 treesize of output 76 [2018-04-11 15:47:04,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:04,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:04,317 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 68 treesize of output 93 [2018-04-11 15:47:04,317 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:04,346 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:04,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:04,361 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:105, output treesize:97 [2018-04-11 15:47:04,522 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 85 treesize of output 72 [2018-04-11 15:47:04,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 15:47:04,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:04,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:04,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:04,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 79 [2018-04-11 15:47:04,544 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-04-11 15:47:04,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-04-11 15:47:04,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 16 dim-0 vars, and 6 xjuncts. [2018-04-11 15:47:04,648 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:129, output treesize:496 [2018-04-11 15:47:05,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:05,150 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 65 treesize of output 55 [2018-04-11 15:47:05,152 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:47:05,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:05,161 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 69 [2018-04-11 15:47:05,163 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-11 15:47:05,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:05,192 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:47:05,193 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 28 treesize of output 21 [2018-04-11 15:47:05,193 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:05,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:05,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:05,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:05,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:05,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:05,197 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:47:05,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2018-04-11 15:47:05,197 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:47:05,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:47:05,201 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:47:05,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 51 [2018-04-11 15:47:05,207 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 15:47:05,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:05,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:47:05,231 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:84, output treesize:3 [2018-04-11 15:47:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:47:05,263 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:47:05,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 15:47:05,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 15:47:05,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 15:47:05,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:47:05,263 INFO L87 Difference]: Start difference. First operand 144 states and 158 transitions. Second operand 24 states. Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown