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_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0513_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 10:43:03,834 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 10:43:03,835 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 10:43:03,846 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 10:43:03,847 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 10:43:03,847 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 10:43:03,848 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 10:43:03,849 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 10:43:03,850 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 10:43:03,851 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 10:43:03,852 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 10:43:03,852 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 10:43:03,852 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 10:43:03,853 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 10:43:03,854 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 10:43:03,855 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 10:43:03,857 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 10:43:03,858 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 10:43:03,859 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 10:43:03,860 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 10:43:03,861 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 10:43:03,862 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 10:43:03,862 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 10:43:03,863 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 10:43:03,863 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 10:43:03,864 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 10:43:03,864 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 10:43:03,865 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 10:43:03,865 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 10:43:03,865 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 10:43:03,865 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 10:43:03,866 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-11 10:43:03,884 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 10:43:03,884 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 10:43:03,885 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 10:43:03,885 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 10:43:03,886 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 10:43:03,886 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 10:43:03,886 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 10:43:03,886 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 10:43:03,886 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 10:43:03,886 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 10:43:03,886 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 10:43:03,886 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 10:43:03,886 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 10:43:03,887 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 10:43:03,887 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 10:43:03,887 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 10:43:03,887 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 10:43:03,887 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 10:43:03,887 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 10:43:03,887 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 10:43:03,887 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 10:43:03,887 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 10:43:03,888 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 10:43:03,888 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 10:43:03,914 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 10:43:03,922 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 10:43:03,924 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 10:43:03,925 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 10:43:03,926 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 10:43:03,926 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,228 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGee00cd99f [2018-04-11 10:43:04,429 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 10:43:04,429 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 10:43:04,429 INFO L168 CDTParser]: Scanning test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,435 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 10:43:04,435 INFO L215 ultiparseSymbolTable]: [2018-04-11 10:43:04,435 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 10:43:04,435 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,435 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 10:43:04,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__wchar_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__uint in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,435 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__nlink_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__loff_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fd_mask in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____useconds_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__id_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uid_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____key_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint8_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_attr_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int64_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint64_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,436 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ssize_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int64_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____loff_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fsid_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsblkcnt64_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__timer_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____pid_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__suseconds_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____daddr_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____nlink_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____sig_atomic_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__clockid_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____WAIT_STATUS in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int8_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_condattr_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int8_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____clock_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____socklen_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pid_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__daddr_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__clock_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsid_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____quad_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____mode_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____gid_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_quad_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_barrier_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_long in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_short in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ulong in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__gid_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_cond_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____sigset_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____rlim_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__blkcnt_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__quad_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_spinlock_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__caddr_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____ino_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____pthread_list_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__div_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int16_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_long in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____clockid_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__off_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_once_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_char in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int16_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__size_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____intptr_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_rwlock_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____id_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint32_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fd_set in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____rlim64_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____blksize_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsblkcnt_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__blksize_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____dev_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____qaddr_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__lldiv_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__uid_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int16_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____caddr_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____off64_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____suseconds_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_char in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_quad_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_short in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int32_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__mode_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__key_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsfilcnt_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_mutexattr_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fsblkcnt_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____timer_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int32_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int32_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint16_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ino_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsfilcnt64_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fsfilcnt_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____off_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int64_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____ino64_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____ssize_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____time_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int8_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_rwlockattr_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ldiv_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fd_mask in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____blkcnt64_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ushort in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____blkcnt_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_mutex_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____swblk_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__register_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__sigset_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_barrierattr_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__time_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__dev_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_int in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_key_t in test-0513_true-valid-memsafety.i [2018-04-11 10:43:04,458 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGee00cd99f [2018-04-11 10:43:04,462 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 10:43:04,463 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 10:43:04,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 10:43:04,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 10:43:04,467 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 10:43:04,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 10:43:04" (1/1) ... [2018-04-11 10:43:04,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@580bb990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:43:04, skipping insertion in model container [2018-04-11 10:43:04,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 10:43:04" (1/1) ... [2018-04-11 10:43:04,479 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 10:43:04,501 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 10:43:04,617 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 10:43:04,655 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 10:43:04,661 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 113 non ball SCCs. Number of states in SCCs 113. [2018-04-11 10:43:04,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:43:04 WrapperNode [2018-04-11 10:43:04,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 10:43:04,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 10:43:04,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 10:43:04,698 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 10:43:04,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:43:04" (1/1) ... [2018-04-11 10:43:04,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:43:04" (1/1) ... [2018-04-11 10:43:04,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:43:04" (1/1) ... [2018-04-11 10:43:04,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:43:04" (1/1) ... [2018-04-11 10:43:04,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:43:04" (1/1) ... [2018-04-11 10:43:04,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:43:04" (1/1) ... [2018-04-11 10:43:04,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:43:04" (1/1) ... [2018-04-11 10:43:04,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 10:43:04,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 10:43:04,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 10:43:04,737 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 10:43:04,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:43:04" (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 10:43:04,845 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 10:43:04,845 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 10:43:04,845 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 10:43:04,845 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 10:43:04,846 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 10:43:04,846 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 10:43:04,846 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 10:43:04,846 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 10:43:04,846 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 10:43:04,846 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 10:43:04,846 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 10:43:04,846 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 10:43:04,846 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 10:43:04,847 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 10:43:04,847 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 10:43:04,847 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 10:43:04,847 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 10:43:04,847 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 10:43:04,847 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 10:43:04,847 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 10:43:04,847 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 10:43:04,847 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 10:43:04,847 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 10:43:04,848 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 10:43:04,848 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 10:43:04,848 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 10:43:04,848 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 10:43:04,848 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 10:43:04,848 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 10:43:04,848 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 10:43:04,848 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 10:43:04,848 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 10:43:04,849 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 10:43:04,849 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 10:43:04,849 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 10:43:04,849 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 10:43:04,849 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 10:43:04,849 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 10:43:04,849 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 10:43:04,849 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 10:43:04,849 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 10:43:04,849 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 10:43:04,850 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 10:43:04,850 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 10:43:04,850 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 10:43:04,850 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 10:43:04,850 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 10:43:04,850 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 10:43:04,850 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 10:43:04,850 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 10:43:04,850 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 10:43:04,851 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 10:43:04,851 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 10:43:04,851 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 10:43:04,851 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 10:43:04,851 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 10:43:04,851 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 10:43:04,851 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 10:43:04,851 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 10:43:04,851 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 10:43:04,851 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 10:43:04,852 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 10:43:04,852 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 10:43:04,852 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 10:43:04,852 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 10:43:04,852 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 10:43:04,852 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 10:43:04,852 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 10:43:04,852 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 10:43:04,852 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 10:43:04,852 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 10:43:04,853 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 10:43:04,853 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 10:43:04,853 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 10:43:04,853 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 10:43:04,853 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 10:43:04,853 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 10:43:04,853 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 10:43:04,853 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 10:43:04,853 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 10:43:04,853 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 10:43:04,854 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 10:43:04,854 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 10:43:04,854 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 10:43:04,854 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 10:43:04,854 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 10:43:04,854 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 10:43:04,854 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 10:43:04,854 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 10:43:04,854 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 10:43:04,854 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 10:43:04,855 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 10:43:04,855 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 10:43:04,855 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 10:43:04,855 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 10:43:04,855 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 10:43:04,855 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 10:43:04,855 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 10:43:04,855 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 10:43:04,855 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 10:43:04,855 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 10:43:04,856 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 10:43:04,856 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 10:43:04,856 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 10:43:04,856 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 10:43:04,856 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 10:43:04,856 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 10:43:04,856 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 10:43:04,856 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 10:43:04,856 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 10:43:04,856 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 10:43:04,856 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 10:43:04,857 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 10:43:04,857 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 10:43:04,857 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 10:43:04,857 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 10:43:05,254 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 10:43:05,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 10:43:05 BoogieIcfgContainer [2018-04-11 10:43:05,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 10:43:05,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 10:43:05,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 10:43:05,257 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 10:43:05,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 10:43:04" (1/3) ... [2018-04-11 10:43:05,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f977f73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 10:43:05, skipping insertion in model container [2018-04-11 10:43:05,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:43:04" (2/3) ... [2018-04-11 10:43:05,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f977f73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 10:43:05, skipping insertion in model container [2018-04-11 10:43:05,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 10:43:05" (3/3) ... [2018-04-11 10:43:05,259 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0513_true-valid-memsafety.i [2018-04-11 10:43:05,265 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 10:43:05,270 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 59 error locations. [2018-04-11 10:43:05,293 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 10:43:05,294 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 10:43:05,294 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 10:43:05,294 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 10:43:05,294 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 10:43:05,294 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 10:43:05,294 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 10:43:05,294 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 10:43:05,294 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 10:43:05,295 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 10:43:05,303 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2018-04-11 10:43:05,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-11 10:43:05,310 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:43:05,310 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:43:05,310 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:43:05,313 INFO L82 PathProgramCache]: Analyzing trace with hash -753540323, now seen corresponding path program 1 times [2018-04-11 10:43:05,314 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:43:05,315 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:43:05,343 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:05,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:05,344 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:05,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:43:05,386 INFO 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 10:43:05,388 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:43:05,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 10:43:05,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-11 10:43:05,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-11 10:43:05,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-11 10:43:05,398 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 2 states. [2018-04-11 10:43:05,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:43:05,417 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2018-04-11 10:43:05,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-11 10:43:05,418 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-04-11 10:43:05,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:43:05,426 INFO L225 Difference]: With dead ends: 143 [2018-04-11 10:43:05,426 INFO L226 Difference]: Without dead ends: 140 [2018-04-11 10:43:05,428 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-11 10:43:05,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-04-11 10:43:05,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-04-11 10:43:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-04-11 10:43:05,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2018-04-11 10:43:05,458 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 9 [2018-04-11 10:43:05,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:43:05,458 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2018-04-11 10:43:05,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-11 10:43:05,458 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2018-04-11 10:43:05,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-11 10:43:05,458 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:43:05,458 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:43:05,458 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:43:05,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1648357869, now seen corresponding path program 1 times [2018-04-11 10:43:05,459 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:43:05,459 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:43:05,459 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:05,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:05,460 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:05,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:43:05,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:43:05,490 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:43:05,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 10:43:05,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 10:43:05,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 10:43:05,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 10:43:05,492 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 3 states. [2018-04-11 10:43:05,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:43:05,609 INFO L93 Difference]: Finished difference Result 187 states and 197 transitions. [2018-04-11 10:43:05,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 10:43:05,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-04-11 10:43:05,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:43:05,613 INFO L225 Difference]: With dead ends: 187 [2018-04-11 10:43:05,613 INFO L226 Difference]: Without dead ends: 186 [2018-04-11 10:43:05,613 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 10:43:05,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-04-11 10:43:05,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 144. [2018-04-11 10:43:05,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-11 10:43:05,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2018-04-11 10:43:05,621 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 11 [2018-04-11 10:43:05,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:43:05,621 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2018-04-11 10:43:05,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 10:43:05,621 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-04-11 10:43:05,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-11 10:43:05,621 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:43:05,621 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:43:05,621 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:43:05,622 INFO L82 PathProgramCache]: Analyzing trace with hash -440516954, now seen corresponding path program 1 times [2018-04-11 10:43:05,622 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:43:05,622 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:43:05,624 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:05,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:05,624 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:05,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:43:05,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:43:05,649 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:43:05,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:43:05,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 10:43:05,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 10:43:05,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 10:43:05,650 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand 3 states. [2018-04-11 10:43:05,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:43:05,706 INFO L93 Difference]: Finished difference Result 160 states and 167 transitions. [2018-04-11 10:43:05,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 10:43:05,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-04-11 10:43:05,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:43:05,708 INFO L225 Difference]: With dead ends: 160 [2018-04-11 10:43:05,708 INFO L226 Difference]: Without dead ends: 159 [2018-04-11 10:43:05,708 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 10:43:05,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-04-11 10:43:05,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 153. [2018-04-11 10:43:05,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-11 10:43:05,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2018-04-11 10:43:05,717 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 12 [2018-04-11 10:43:05,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:43:05,717 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2018-04-11 10:43:05,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 10:43:05,717 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2018-04-11 10:43:05,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 10:43:05,718 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:43:05,718 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:43:05,718 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:43:05,718 INFO L82 PathProgramCache]: Analyzing trace with hash -770757119, now seen corresponding path program 1 times [2018-04-11 10:43:05,719 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:43:05,719 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:43:05,719 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:05,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:05,720 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:05,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:43:05,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:43:05,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:43:05,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:43:05,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:43:05,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:43:05,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:43:05,757 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand 4 states. [2018-04-11 10:43:05,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:43:05,936 INFO L93 Difference]: Finished difference Result 229 states and 243 transitions. [2018-04-11 10:43:05,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 10:43:05,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-04-11 10:43:05,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:43:05,939 INFO L225 Difference]: With dead ends: 229 [2018-04-11 10:43:05,942 INFO L226 Difference]: Without dead ends: 229 [2018-04-11 10:43:05,943 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 10:43:05,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-04-11 10:43:05,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 155. [2018-04-11 10:43:05,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-11 10:43:05,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 169 transitions. [2018-04-11 10:43:05,951 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 169 transitions. Word has length 13 [2018-04-11 10:43:05,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:43:05,951 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 169 transitions. [2018-04-11 10:43:05,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:43:05,951 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 169 transitions. [2018-04-11 10:43:05,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 10:43:05,952 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:43:05,952 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:43:05,952 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:43:05,952 INFO L82 PathProgramCache]: Analyzing trace with hash -770757118, now seen corresponding path program 1 times [2018-04-11 10:43:05,953 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:43:05,955 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:43:05,956 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:05,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:05,956 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:05,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:43:06,014 INFO 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 10:43:06,014 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:43:06,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:43:06,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:43:06,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:43:06,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:43:06,015 INFO L87 Difference]: Start difference. First operand 155 states and 169 transitions. Second operand 4 states. [2018-04-11 10:43:06,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:43:06,129 INFO L93 Difference]: Finished difference Result 153 states and 165 transitions. [2018-04-11 10:43:06,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 10:43:06,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-04-11 10:43:06,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:43:06,130 INFO L225 Difference]: With dead ends: 153 [2018-04-11 10:43:06,130 INFO L226 Difference]: Without dead ends: 153 [2018-04-11 10:43:06,130 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 10:43:06,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-11 10:43:06,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-04-11 10:43:06,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-11 10:43:06,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2018-04-11 10:43:06,135 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 13 [2018-04-11 10:43:06,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:43:06,135 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2018-04-11 10:43:06,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:43:06,135 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2018-04-11 10:43:06,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 10:43:06,136 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:43:06,136 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:43:06,136 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:43:06,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1570873951, now seen corresponding path program 1 times [2018-04-11 10:43:06,136 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:43:06,136 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:43:06,137 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:06,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:06,137 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:06,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:43:06,173 INFO 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 10:43:06,173 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:43:06,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:43:06,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:43:06,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:43:06,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:43:06,174 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand 4 states. [2018-04-11 10:43:06,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:43:06,279 INFO L93 Difference]: Finished difference Result 191 states and 203 transitions. [2018-04-11 10:43:06,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 10:43:06,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-11 10:43:06,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:43:06,280 INFO L225 Difference]: With dead ends: 191 [2018-04-11 10:43:06,280 INFO L226 Difference]: Without dead ends: 191 [2018-04-11 10:43:06,280 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 10:43:06,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-04-11 10:43:06,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 149. [2018-04-11 10:43:06,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-11 10:43:06,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2018-04-11 10:43:06,283 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 20 [2018-04-11 10:43:06,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:43:06,283 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2018-04-11 10:43:06,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:43:06,283 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2018-04-11 10:43:06,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 10:43:06,284 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:43:06,284 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:43:06,284 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:43:06,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1570873952, now seen corresponding path program 1 times [2018-04-11 10:43:06,284 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:43:06,284 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:43:06,285 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:06,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:06,285 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:06,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:43:06,326 INFO 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 10:43:06,326 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:43:06,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:43:06,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:43:06,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:43:06,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:43:06,326 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand 4 states. [2018-04-11 10:43:06,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:43:06,396 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2018-04-11 10:43:06,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 10:43:06,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-11 10:43:06,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:43:06,397 INFO L225 Difference]: With dead ends: 146 [2018-04-11 10:43:06,397 INFO L226 Difference]: Without dead ends: 146 [2018-04-11 10:43:06,397 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 10:43:06,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-04-11 10:43:06,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-04-11 10:43:06,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-11 10:43:06,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2018-04-11 10:43:06,399 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 20 [2018-04-11 10:43:06,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:43:06,399 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2018-04-11 10:43:06,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:43:06,400 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2018-04-11 10:43:06,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 10:43:06,400 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:43:06,400 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] [2018-04-11 10:43:06,400 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:43:06,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1391598788, now seen corresponding path program 1 times [2018-04-11 10:43:06,400 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:43:06,400 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:43:06,401 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:06,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:06,401 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:06,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:43:06,437 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 10:43:06,437 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:43:06,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 10:43:06,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:43:06,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:43:06,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:43:06,438 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand 5 states. [2018-04-11 10:43:06,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:43:06,541 INFO L93 Difference]: Finished difference Result 246 states and 266 transitions. [2018-04-11 10:43:06,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:43:06,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-11 10:43:06,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:43:06,543 INFO L225 Difference]: With dead ends: 246 [2018-04-11 10:43:06,543 INFO L226 Difference]: Without dead ends: 246 [2018-04-11 10:43:06,543 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 10:43:06,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-04-11 10:43:06,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 146. [2018-04-11 10:43:06,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-11 10:43:06,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2018-04-11 10:43:06,547 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 28 [2018-04-11 10:43:06,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:43:06,547 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2018-04-11 10:43:06,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:43:06,547 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2018-04-11 10:43:06,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 10:43:06,548 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:43:06,548 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 10:43:06,548 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:43:06,548 INFO L82 PathProgramCache]: Analyzing trace with hash 189886127, now seen corresponding path program 1 times [2018-04-11 10:43:06,548 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:43:06,548 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:43:06,549 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:06,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:06,549 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:06,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:43:06,593 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 10:43:06,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:43:06,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:43:06,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:43:06,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:43:06,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:43:06,594 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand 5 states. [2018-04-11 10:43:06,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:43:06,672 INFO L93 Difference]: Finished difference Result 143 states and 153 transitions. [2018-04-11 10:43:06,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:43:06,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-11 10:43:06,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:43:06,673 INFO L225 Difference]: With dead ends: 143 [2018-04-11 10:43:06,673 INFO L226 Difference]: Without dead ends: 143 [2018-04-11 10:43:06,673 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-11 10:43:06,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-04-11 10:43:06,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2018-04-11 10:43:06,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-04-11 10:43:06,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 151 transitions. [2018-04-11 10:43:06,676 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 151 transitions. Word has length 29 [2018-04-11 10:43:06,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:43:06,676 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 151 transitions. [2018-04-11 10:43:06,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:43:06,677 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2018-04-11 10:43:06,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 10:43:06,677 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:43:06,677 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 10:43:06,677 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:43:06,677 INFO L82 PathProgramCache]: Analyzing trace with hash 189886128, now seen corresponding path program 1 times [2018-04-11 10:43:06,677 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:43:06,678 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:43:06,678 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:06,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:06,678 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:06,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:43:06,732 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 10:43:06,732 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:43:06,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:43:06,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:43:06,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:43:06,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:43:06,733 INFO L87 Difference]: Start difference. First operand 140 states and 151 transitions. Second operand 5 states. [2018-04-11 10:43:06,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:43:06,886 INFO L93 Difference]: Finished difference Result 222 states and 241 transitions. [2018-04-11 10:43:06,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:43:06,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-11 10:43:06,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:43:06,887 INFO L225 Difference]: With dead ends: 222 [2018-04-11 10:43:06,887 INFO L226 Difference]: Without dead ends: 222 [2018-04-11 10:43:06,888 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 10:43:06,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-04-11 10:43:06,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 182. [2018-04-11 10:43:06,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-11 10:43:06,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 224 transitions. [2018-04-11 10:43:06,890 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 224 transitions. Word has length 29 [2018-04-11 10:43:06,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:43:06,890 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 224 transitions. [2018-04-11 10:43:06,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:43:06,890 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 224 transitions. [2018-04-11 10:43:06,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 10:43:06,891 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:43:06,891 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 10:43:06,891 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:43:06,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1100165028, now seen corresponding path program 1 times [2018-04-11 10:43:06,892 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:43:06,892 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:43:06,892 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:06,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:06,892 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:06,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:43:06,990 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 10:43:06,990 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:43:06,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 10:43:06,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 10:43:06,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 10:43:06,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 10:43:06,991 INFO L87 Difference]: Start difference. First operand 182 states and 224 transitions. Second operand 6 states. [2018-04-11 10:43:07,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:43:07,105 INFO L93 Difference]: Finished difference Result 214 states and 257 transitions. [2018-04-11 10:43:07,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:43:07,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-04-11 10:43:07,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:43:07,107 INFO L225 Difference]: With dead ends: 214 [2018-04-11 10:43:07,107 INFO L226 Difference]: Without dead ends: 214 [2018-04-11 10:43:07,107 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 10:43:07,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-11 10:43:07,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 191. [2018-04-11 10:43:07,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-11 10:43:07,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 234 transitions. [2018-04-11 10:43:07,124 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 234 transitions. Word has length 34 [2018-04-11 10:43:07,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:43:07,125 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 234 transitions. [2018-04-11 10:43:07,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 10:43:07,125 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 234 transitions. [2018-04-11 10:43:07,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 10:43:07,125 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:43:07,125 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] [2018-04-11 10:43:07,126 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:43:07,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1775499014, now seen corresponding path program 1 times [2018-04-11 10:43:07,126 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:43:07,126 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:43:07,127 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:07,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:07,127 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:07,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:43:07,347 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 10:43:07,347 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:43:07,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 10:43:07,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 10:43:07,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 10:43:07,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-04-11 10:43:07,348 INFO L87 Difference]: Start difference. First operand 191 states and 234 transitions. Second operand 12 states. [2018-04-11 10:43:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:43:07,785 INFO L93 Difference]: Finished difference Result 248 states and 293 transitions. [2018-04-11 10:43:07,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 10:43:07,786 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-04-11 10:43:07,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:43:07,787 INFO L225 Difference]: With dead ends: 248 [2018-04-11 10:43:07,787 INFO L226 Difference]: Without dead ends: 248 [2018-04-11 10:43:07,788 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2018-04-11 10:43:07,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-04-11 10:43:07,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 196. [2018-04-11 10:43:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-04-11 10:43:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 241 transitions. [2018-04-11 10:43:07,792 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 241 transitions. Word has length 38 [2018-04-11 10:43:07,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:43:07,792 INFO L459 AbstractCegarLoop]: Abstraction has 196 states and 241 transitions. [2018-04-11 10:43:07,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 10:43:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 241 transitions. [2018-04-11 10:43:07,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 10:43:07,793 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:43:07,793 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] [2018-04-11 10:43:07,794 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:43:07,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1775499015, now seen corresponding path program 1 times [2018-04-11 10:43:07,794 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:43:07,794 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:43:07,795 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:07,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:07,795 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:07,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:43:08,076 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 10:43:08,076 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:43:08,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 10:43:08,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 10:43:08,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 10:43:08,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-04-11 10:43:08,077 INFO L87 Difference]: Start difference. First operand 196 states and 241 transitions. Second operand 11 states. [2018-04-11 10:43:08,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:43:08,452 INFO L93 Difference]: Finished difference Result 246 states and 288 transitions. [2018-04-11 10:43:08,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 10:43:08,453 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-04-11 10:43:08,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:43:08,454 INFO L225 Difference]: With dead ends: 246 [2018-04-11 10:43:08,454 INFO L226 Difference]: Without dead ends: 246 [2018-04-11 10:43:08,454 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2018-04-11 10:43:08,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-04-11 10:43:08,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 196. [2018-04-11 10:43:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-04-11 10:43:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 240 transitions. [2018-04-11 10:43:08,457 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 240 transitions. Word has length 38 [2018-04-11 10:43:08,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:43:08,457 INFO L459 AbstractCegarLoop]: Abstraction has 196 states and 240 transitions. [2018-04-11 10:43:08,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 10:43:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 240 transitions. [2018-04-11 10:43:08,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 10:43:08,457 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:43:08,457 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] [2018-04-11 10:43:08,457 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:43:08,458 INFO L82 PathProgramCache]: Analyzing trace with hash -794106788, now seen corresponding path program 1 times [2018-04-11 10:43:08,458 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:43:08,458 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:43:08,458 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:08,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:08,458 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:08,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:43:08,599 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 10:43:08,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:43:08,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 10:43:08,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 10:43:08,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 10:43:08,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-04-11 10:43:08,600 INFO L87 Difference]: Start difference. First operand 196 states and 240 transitions. Second operand 10 states. [2018-04-11 10:43:08,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:43:08,769 INFO L93 Difference]: Finished difference Result 223 states and 267 transitions. [2018-04-11 10:43:08,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 10:43:08,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-04-11 10:43:08,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:43:08,770 INFO L225 Difference]: With dead ends: 223 [2018-04-11 10:43:08,770 INFO L226 Difference]: Without dead ends: 223 [2018-04-11 10:43:08,770 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-04-11 10:43:08,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-11 10:43:08,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 203. [2018-04-11 10:43:08,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-11 10:43:08,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 247 transitions. [2018-04-11 10:43:08,773 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 247 transitions. Word has length 39 [2018-04-11 10:43:08,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:43:08,773 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 247 transitions. [2018-04-11 10:43:08,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 10:43:08,773 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 247 transitions. [2018-04-11 10:43:08,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 10:43:08,774 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:43:08,774 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 10:43:08,774 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:43:08,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1152541254, now seen corresponding path program 1 times [2018-04-11 10:43:08,774 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:43:08,774 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:43:08,775 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:08,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:08,775 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:08,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:43:08,936 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 10:43:08,936 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:43:08,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 10:43:08,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 10:43:08,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 10:43:08,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-04-11 10:43:08,936 INFO L87 Difference]: Start difference. First operand 203 states and 247 transitions. Second operand 11 states. [2018-04-11 10:43:09,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:43:09,211 INFO L93 Difference]: Finished difference Result 287 states and 331 transitions. [2018-04-11 10:43:09,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 10:43:09,211 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2018-04-11 10:43:09,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:43:09,212 INFO L225 Difference]: With dead ends: 287 [2018-04-11 10:43:09,212 INFO L226 Difference]: Without dead ends: 287 [2018-04-11 10:43:09,212 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2018-04-11 10:43:09,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-04-11 10:43:09,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 205. [2018-04-11 10:43:09,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-11 10:43:09,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 249 transitions. [2018-04-11 10:43:09,215 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 249 transitions. Word has length 40 [2018-04-11 10:43:09,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:43:09,215 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 249 transitions. [2018-04-11 10:43:09,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 10:43:09,215 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 249 transitions. [2018-04-11 10:43:09,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 10:43:09,216 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:43:09,216 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:43:09,216 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:43:09,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1369040736, now seen corresponding path program 1 times [2018-04-11 10:43:09,216 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:43:09,216 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:43:09,216 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:09,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:09,216 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:09,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:43:09,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 10:43:09,265 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:43:09,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:43:09,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:43:09,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:43:09,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:43:09,266 INFO L87 Difference]: Start difference. First operand 205 states and 249 transitions. Second operand 4 states. [2018-04-11 10:43:09,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:43:09,377 INFO L93 Difference]: Finished difference Result 260 states and 316 transitions. [2018-04-11 10:43:09,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 10:43:09,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-04-11 10:43:09,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:43:09,378 INFO L225 Difference]: With dead ends: 260 [2018-04-11 10:43:09,378 INFO L226 Difference]: Without dead ends: 260 [2018-04-11 10:43:09,378 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 10:43:09,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-04-11 10:43:09,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 211. [2018-04-11 10:43:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-04-11 10:43:09,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 262 transitions. [2018-04-11 10:43:09,382 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 262 transitions. Word has length 41 [2018-04-11 10:43:09,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:43:09,382 INFO L459 AbstractCegarLoop]: Abstraction has 211 states and 262 transitions. [2018-04-11 10:43:09,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:43:09,383 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 262 transitions. [2018-04-11 10:43:09,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 10:43:09,383 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:43:09,383 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:43:09,383 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:43:09,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1711046732, now seen corresponding path program 1 times [2018-04-11 10:43:09,384 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:43:09,384 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:43:09,384 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:09,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:09,385 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:09,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:43:09,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:43:09,710 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:43:09,710 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:43:09,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:09,767 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:43:09,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 10:43:09,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:43:09,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:09,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:09,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 10:43:09,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:43:09,855 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:09,857 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:09,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:09,863 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-11 10:43:09,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:09,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:09,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 10:43:09,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:09,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:09,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:28 [2018-04-11 10:43:09,967 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 10:43:09,969 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 10:43:09,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:09,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:09,985 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 10:43:09,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:43:09,996 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:10,000 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:10,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:10,007 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-04-11 10:43:10,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 10:43:10,064 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:10,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 10:43:10,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:10,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:10,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-04-11 10:43:10,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:10,110 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:43:10,110 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 30 [2018-04-11 10:43:10,111 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:10,117 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:10,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:43:10,132 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:71, output treesize:99 [2018-04-11 10:43:10,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:10,413 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:43:10,416 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 82 treesize of output 84 [2018-04-11 10:43:10,420 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:43:10,421 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 61 treesize of output 38 [2018-04-11 10:43:10,422 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 10:43:10,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-11 10:43:10,435 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 10:43:10,442 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 10:43:10,473 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 65 treesize of output 49 [2018-04-11 10:43:10,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:10,477 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-04-11 10:43:10,478 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 10:43:10,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 10:43:10,488 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 10:43:10,494 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:43:10,500 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 72 treesize of output 54 [2018-04-11 10:43:10,504 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 15 treesize of output 8 [2018-04-11 10:43:10,504 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:10,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:10,510 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2018-04-11 10:43:10,511 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-04-11 10:43:10,519 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:10,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 10:43:10,534 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:137, output treesize:28 [2018-04-11 10:43:10,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:43:10,627 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:43:10,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2018-04-11 10:43:10,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 10:43:10,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 10:43:10,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2018-04-11 10:43:10,628 INFO L87 Difference]: Start difference. First operand 211 states and 262 transitions. Second operand 32 states. [2018-04-11 10:43:23,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:43:23,769 INFO L93 Difference]: Finished difference Result 254 states and 306 transitions. [2018-04-11 10:43:23,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 10:43:23,769 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2018-04-11 10:43:23,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:43:23,770 INFO L225 Difference]: With dead ends: 254 [2018-04-11 10:43:23,770 INFO L226 Difference]: Without dead ends: 254 [2018-04-11 10:43:23,771 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=512, Invalid=2680, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 10:43:23,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-04-11 10:43:23,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 218. [2018-04-11 10:43:23,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-11 10:43:23,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 269 transitions. [2018-04-11 10:43:23,776 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 269 transitions. Word has length 45 [2018-04-11 10:43:23,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:43:23,776 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 269 transitions. [2018-04-11 10:43:23,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 10:43:23,777 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 269 transitions. [2018-04-11 10:43:23,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 10:43:23,777 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:43:23,777 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:43:23,777 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:43:23,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1502842514, now seen corresponding path program 1 times [2018-04-11 10:43:23,777 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:43:23,778 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:43:23,778 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:23,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:23,778 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:23,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:43:24,092 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 10:43:24,093 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:43:24,093 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:43:24,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:24,139 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:43:24,329 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 10:43:24,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:43:24,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:24,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:24,343 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 10:43:24,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:47 [2018-04-11 10:43:24,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-04-11 10:43:24,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2018-04-11 10:43:24,443 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:43:24,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:43:24,493 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 2 xjuncts. [2018-04-11 10:43:24,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:62 [2018-04-11 10:43:24,763 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~data~0.base Int) (main_~item2~0.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~item2~0.base 1))) (and (= |c_#valid| (store (store .cse0 main_~data~0.base 0) main_~item2~0.base 0)) (= 0 (select |c_old(#valid)| main_~item2~0.base)) (= 0 (select .cse0 main_~data~0.base))))) is different from true [2018-04-11 10:43:24,775 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-11 10:43:24,806 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:43:24,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 27 [2018-04-11 10:43:24,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 10:43:24,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 10:43:24,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=627, Unknown=7, NotChecked=50, Total=756 [2018-04-11 10:43:24,807 INFO L87 Difference]: Start difference. First operand 218 states and 269 transitions. Second operand 28 states. [2018-04-11 10:43:26,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:43:26,166 INFO L93 Difference]: Finished difference Result 221 states and 271 transitions. [2018-04-11 10:43:26,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 10:43:26,166 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 46 [2018-04-11 10:43:26,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:43:26,167 INFO L225 Difference]: With dead ends: 221 [2018-04-11 10:43:26,167 INFO L226 Difference]: Without dead ends: 201 [2018-04-11 10:43:26,168 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=181, Invalid=1374, Unknown=9, NotChecked=76, Total=1640 [2018-04-11 10:43:26,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-04-11 10:43:26,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2018-04-11 10:43:26,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-11 10:43:26,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 250 transitions. [2018-04-11 10:43:26,171 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 250 transitions. Word has length 46 [2018-04-11 10:43:26,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:43:26,171 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 250 transitions. [2018-04-11 10:43:26,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 10:43:26,172 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 250 transitions. [2018-04-11 10:43:26,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 10:43:26,172 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:43:26,172 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] [2018-04-11 10:43:26,172 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:43:26,172 INFO L82 PathProgramCache]: Analyzing trace with hash -182011336, now seen corresponding path program 1 times [2018-04-11 10:43:26,172 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:43:26,173 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:43:26,173 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:26,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:26,173 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:26,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:43:26,393 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:43:26,393 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:43:26,424 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:43:26,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:26,451 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:43:26,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:26,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:26,500 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 10:43:26,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:26,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:26,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-11 10:43:26,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:26,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:26,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:26,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 10:43:26,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:26,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:26,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-04-11 10:43:26,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 10:43:26,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 10:43:26,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:26,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:26,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:26,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-11 10:43:26,598 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 47 treesize of output 43 [2018-04-11 10:43:26,599 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 14 treesize of output 13 [2018-04-11 10:43:26,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:26,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:26,607 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 10:43:26,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:50 [2018-04-11 10:43:26,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 37 [2018-04-11 10:43:26,634 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 29 treesize of output 18 [2018-04-11 10:43:26,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:26,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-04-11 10:43:26,639 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:26,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:26,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:26,643 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:5 [2018-04-11 10:43:26,647 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:43:26,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:43:26,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-04-11 10:43:26,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 10:43:26,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 10:43:26,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-04-11 10:43:26,665 INFO L87 Difference]: Start difference. First operand 200 states and 250 transitions. Second operand 22 states. [2018-04-11 10:43:33,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:43:33,807 INFO L93 Difference]: Finished difference Result 241 states and 268 transitions. [2018-04-11 10:43:33,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 10:43:33,807 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2018-04-11 10:43:33,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:43:33,807 INFO L225 Difference]: With dead ends: 241 [2018-04-11 10:43:33,808 INFO L226 Difference]: Without dead ends: 241 [2018-04-11 10:43:33,808 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=583, Invalid=1967, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 10:43:33,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-04-11 10:43:33,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 200. [2018-04-11 10:43:33,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-11 10:43:33,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 249 transitions. [2018-04-11 10:43:33,810 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 249 transitions. Word has length 53 [2018-04-11 10:43:33,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:43:33,811 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 249 transitions. [2018-04-11 10:43:33,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 10:43:33,811 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 249 transitions. [2018-04-11 10:43:33,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 10:43:33,811 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:43:33,811 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] [2018-04-11 10:43:33,811 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:43:33,811 INFO L82 PathProgramCache]: Analyzing trace with hash -182011335, now seen corresponding path program 1 times [2018-04-11 10:43:33,811 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:43:33,811 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:43:33,814 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:33,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:33,814 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:33,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:43:34,130 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:43:34,130 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:43:34,130 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:43:34,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:34,153 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:43:34,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 10:43:34,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:34,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:34,187 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 10:43:34,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:34,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:34,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:34,228 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 16 treesize of output 9 [2018-04-11 10:43:34,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:34,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:34,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:9 [2018-04-11 10:43:34,252 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 10:43:34,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:43:34,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:34,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:34,261 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 10:43:34,263 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 10:43:34,263 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:34,264 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:34,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:34,267 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-04-11 10:43:34,286 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 82 treesize of output 78 [2018-04-11 10:43:34,287 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 18 treesize of output 17 [2018-04-11 10:43:34,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:34,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:34,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-04-11 10:43:34,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:43:34,305 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:34,310 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:34,316 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 10:43:34,317 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:91, output treesize:55 [2018-04-11 10:43:34,336 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 53 treesize of output 39 [2018-04-11 10:43:34,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-04-11 10:43:34,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:34,342 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 12 treesize of output 4 [2018-04-11 10:43:34,342 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:34,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:34,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-04-11 10:43:34,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 22 treesize of output 13 [2018-04-11 10:43:34,351 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:34,356 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:34,359 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 10:43:34,359 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:69, output treesize:13 [2018-04-11 10:43:34,375 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:43:34,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:43:34,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-04-11 10:43:34,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 10:43:34,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 10:43:34,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-04-11 10:43:34,393 INFO L87 Difference]: Start difference. First operand 200 states and 249 transitions. Second operand 21 states. [2018-04-11 10:43:35,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:43:35,365 INFO L93 Difference]: Finished difference Result 238 states and 266 transitions. [2018-04-11 10:43:35,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 10:43:35,370 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2018-04-11 10:43:35,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:43:35,370 INFO L225 Difference]: With dead ends: 238 [2018-04-11 10:43:35,371 INFO L226 Difference]: Without dead ends: 238 [2018-04-11 10:43:35,371 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=498, Invalid=1854, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 10:43:35,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-04-11 10:43:35,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 200. [2018-04-11 10:43:35,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-11 10:43:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 248 transitions. [2018-04-11 10:43:35,373 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 248 transitions. Word has length 53 [2018-04-11 10:43:35,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:43:35,374 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 248 transitions. [2018-04-11 10:43:35,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 10:43:35,374 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 248 transitions. [2018-04-11 10:43:35,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 10:43:35,374 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:43:35,374 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, 1, 1] [2018-04-11 10:43:35,375 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:43:35,375 INFO L82 PathProgramCache]: Analyzing trace with hash 845754490, now seen corresponding path program 1 times [2018-04-11 10:43:35,375 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:43:35,375 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:43:35,375 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:35,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:35,376 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:35,384 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:43:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-04-11 10:43:35,422 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:43:35,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 10:43:35,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 10:43:35,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 10:43:35,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 10:43:35,423 INFO L87 Difference]: Start difference. First operand 200 states and 248 transitions. Second operand 6 states. [2018-04-11 10:43:35,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:43:35,545 INFO L93 Difference]: Finished difference Result 199 states and 246 transitions. [2018-04-11 10:43:35,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 10:43:35,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-04-11 10:43:35,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:43:35,546 INFO L225 Difference]: With dead ends: 199 [2018-04-11 10:43:35,546 INFO L226 Difference]: Without dead ends: 199 [2018-04-11 10:43:35,546 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-11 10:43:35,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-04-11 10:43:35,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-04-11 10:43:35,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-11 10:43:35,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 246 transitions. [2018-04-11 10:43:35,549 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 246 transitions. Word has length 57 [2018-04-11 10:43:35,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:43:35,550 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 246 transitions. [2018-04-11 10:43:35,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 10:43:35,550 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 246 transitions. [2018-04-11 10:43:35,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 10:43:35,550 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:43:35,550 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, 1, 1] [2018-04-11 10:43:35,551 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:43:35,551 INFO L82 PathProgramCache]: Analyzing trace with hash 845754491, now seen corresponding path program 1 times [2018-04-11 10:43:35,551 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:43:35,551 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:43:35,551 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:35,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:35,552 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:35,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:43:35,708 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:43:35,709 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:43:35,709 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:43:35,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:35,754 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:43:35,833 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 10:43:35,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:43:35,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:35,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:35,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:35,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-04-11 10:43:35,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-04-11 10:43:35,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:35,885 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 17 treesize of output 22 [2018-04-11 10:43:35,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:35,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 10:43:35,902 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:35,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:35,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:35,914 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:22, output treesize:11 [2018-04-11 10:43:35,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 10:43:35,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 19 treesize of output 11 [2018-04-11 10:43:35,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:35,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:35,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-04-11 10:43:35,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-04-11 10:43:35,973 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:35,992 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:35,995 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 10:43:35,996 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2018-04-11 10:43:36,038 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:43:36,067 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 10:43:36,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2018-04-11 10:43:36,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 10:43:36,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 10:43:36,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-04-11 10:43:36,068 INFO L87 Difference]: Start difference. First operand 199 states and 246 transitions. Second operand 24 states. [2018-04-11 10:43:36,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:43:36,907 INFO L93 Difference]: Finished difference Result 281 states and 310 transitions. [2018-04-11 10:43:36,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 10:43:36,907 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 57 [2018-04-11 10:43:36,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:43:36,908 INFO L225 Difference]: With dead ends: 281 [2018-04-11 10:43:36,908 INFO L226 Difference]: Without dead ends: 281 [2018-04-11 10:43:36,909 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=624, Invalid=2346, Unknown=0, NotChecked=0, Total=2970 [2018-04-11 10:43:36,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-04-11 10:43:36,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 199. [2018-04-11 10:43:36,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-11 10:43:36,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 244 transitions. [2018-04-11 10:43:36,911 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 244 transitions. Word has length 57 [2018-04-11 10:43:36,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:43:36,911 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 244 transitions. [2018-04-11 10:43:36,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 10:43:36,911 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 244 transitions. [2018-04-11 10:43:36,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 10:43:36,911 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:43:36,911 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, 1, 1, 1] [2018-04-11 10:43:36,911 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:43:36,912 INFO L82 PathProgramCache]: Analyzing trace with hash -632629688, now seen corresponding path program 1 times [2018-04-11 10:43:36,912 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:43:36,912 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:43:36,912 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:36,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:36,912 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:36,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:43:37,015 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:43:37,015 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:43:37,015 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:43:37,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:37,044 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:43:37,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 10:43:37,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:37,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:37,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 10:43:37,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:37,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:37,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:37,076 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 16 treesize of output 9 [2018-04-11 10:43:37,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:37,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:37,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:9 [2018-04-11 10:43:37,093 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 10:43:37,094 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 10:43:37,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:37,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:37,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:37,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-11 10:43:37,110 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 10:43:37,112 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 14 treesize of output 13 [2018-04-11 10:43:37,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:37,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:37,118 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 10:43:37,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-04-11 10:43:37,135 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 34 treesize of output 22 [2018-04-11 10:43:37,136 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 22 treesize of output 13 [2018-04-11 10:43:37,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:37,139 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 8 treesize of output 4 [2018-04-11 10:43:37,139 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:37,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:37,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:37,140 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:34, output treesize:4 [2018-04-11 10:43:37,143 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:43:37,160 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:43:37,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2018-04-11 10:43:37,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 10:43:37,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 10:43:37,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-04-11 10:43:37,161 INFO L87 Difference]: Start difference. First operand 199 states and 244 transitions. Second operand 18 states. [2018-04-11 10:43:39,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:43:39,510 INFO L93 Difference]: Finished difference Result 215 states and 241 transitions. [2018-04-11 10:43:39,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 10:43:39,510 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2018-04-11 10:43:39,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:43:39,511 INFO L225 Difference]: With dead ends: 215 [2018-04-11 10:43:39,511 INFO L226 Difference]: Without dead ends: 215 [2018-04-11 10:43:39,511 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2018-04-11 10:43:39,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-04-11 10:43:39,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 189. [2018-04-11 10:43:39,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-11 10:43:39,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 232 transitions. [2018-04-11 10:43:39,514 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 232 transitions. Word has length 58 [2018-04-11 10:43:39,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:43:39,514 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 232 transitions. [2018-04-11 10:43:39,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 10:43:39,514 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 232 transitions. [2018-04-11 10:43:39,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 10:43:39,514 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:43:39,514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:43:39,514 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:43:39,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1538901298, now seen corresponding path program 1 times [2018-04-11 10:43:39,515 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:43:39,515 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:43:39,515 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:39,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:39,515 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:39,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:43:40,675 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:43:40,675 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:43:40,675 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:43:40,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:40,723 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:43:40,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:40,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:40,756 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 10:43:40,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:40,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:40,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-11 10:43:40,842 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 10:43:40,844 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 10:43:40,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:40,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:40,849 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 10:43:40,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-11 10:43:40,872 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:40,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:40,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:40,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-11 10:43:40,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:40,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:40,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:49 [2018-04-11 10:43:40,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-04-11 10:43:40,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:43:40,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:40,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:40,949 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 10:43:40,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:56 [2018-04-11 10:43:40,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:40,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:40,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:40,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:40,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2018-04-11 10:43:40,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:41,000 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 10:43:41,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:79 [2018-04-11 10:43:41,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 69 [2018-04-11 10:43:41,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:43:41,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:41,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:41,170 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 10:43:41,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:82 [2018-04-11 10:43:41,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-04-11 10:43:41,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:41,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 55 [2018-04-11 10:43:41,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:41,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:41,246 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 10:43:41,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:93, output treesize:89 [2018-04-11 10:43:41,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 99 [2018-04-11 10:43:41,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 10:43:41,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:41,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:41,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 10:43:41,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:148 [2018-04-11 10:43:41,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 94 [2018-04-11 10:43:41,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-04-11 10:43:41,656 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 10:43:41,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 31 [2018-04-11 10:43:41,674 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:41,687 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 10:43:41,688 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:41,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:43:41,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 5 [2018-04-11 10:43:41,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 10:43:41,722 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:41,723 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:41,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 10:43:41,735 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:158, output treesize:45 [2018-04-11 10:43:41,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:41,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 51 [2018-04-11 10:43:41,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:41,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 10:43:41,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:33 [2018-04-11 10:43:42,005 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:43:42,063 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:43:42,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 44 [2018-04-11 10:43:42,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-11 10:43:42,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-11 10:43:42,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1773, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 10:43:42,065 INFO L87 Difference]: Start difference. First operand 189 states and 232 transitions. Second operand 45 states. [2018-04-11 10:43:44,185 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 110 DAG size of output 89 [2018-04-11 10:43:45,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:43:45,655 INFO L93 Difference]: Finished difference Result 289 states and 343 transitions. [2018-04-11 10:43:45,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-11 10:43:45,655 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 66 [2018-04-11 10:43:45,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:43:45,656 INFO L225 Difference]: With dead ends: 289 [2018-04-11 10:43:45,656 INFO L226 Difference]: Without dead ends: 289 [2018-04-11 10:43:45,657 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 48 SyntacticMatches, 9 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1405 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1074, Invalid=5406, Unknown=0, NotChecked=0, Total=6480 [2018-04-11 10:43:45,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-04-11 10:43:45,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 186. [2018-04-11 10:43:45,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-11 10:43:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 226 transitions. [2018-04-11 10:43:45,662 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 226 transitions. Word has length 66 [2018-04-11 10:43:45,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:43:45,662 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 226 transitions. [2018-04-11 10:43:45,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-11 10:43:45,662 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 226 transitions. [2018-04-11 10:43:45,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 10:43:45,662 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:43:45,662 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:43:45,663 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:43:45,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1538901297, now seen corresponding path program 1 times [2018-04-11 10:43:45,663 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:43:45,663 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:43:45,663 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:45,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:45,664 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:43:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:45,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:43:46,194 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:43:46,194 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:43:46,194 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:43:46,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:43:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:43:46,237 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:43:46,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:43:46,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:46,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:46,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 10:43:46,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:46,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:46,273 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 10:43:46,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:46,279 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 10:43:46,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:46,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:46,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 10:43:46,359 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 10:43:46,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 10 treesize of output 9 [2018-04-11 10:43:46,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:46,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:46,370 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 10:43:46,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 10:43:46,371 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:46,372 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:46,378 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 10:43:46,378 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:44 [2018-04-11 10:43:46,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:46,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:46,400 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 10:43:46,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:46,408 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 36 [2018-04-11 10:43:46,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:46,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:46,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:48 [2018-04-11 10:43:46,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-11 10:43:46,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:43:46,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:46,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:46,479 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 33 treesize of output 34 [2018-04-11 10:43:46,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:43:46,481 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:46,484 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:46,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:46,494 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:70, output treesize:62 [2018-04-11 10:43:46,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2018-04-11 10:43:46,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:46,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:46,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:67 [2018-04-11 10:43:46,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 59 [2018-04-11 10:43:46,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-04-11 10:43:46,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:46,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 31 [2018-04-11 10:43:46,729 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 10:43:46,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2018-04-11 10:43:46,763 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 10:43:46,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 10:43:46,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 69 [2018-04-11 10:43:46,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 50 [2018-04-11 10:43:46,846 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:43:46,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-04-11 10:43:46,916 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:46,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 43 [2018-04-11 10:43:46,965 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-11 10:43:47,023 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-04-11 10:43:47,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 12 xjuncts. [2018-04-11 10:43:47,080 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:92, output treesize:840 [2018-04-11 10:43:47,229 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 62 treesize of output 59 [2018-04-11 10:43:47,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:43:47,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:47,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:47,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 92 treesize of output 87 [2018-04-11 10:43:47,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:47,335 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 10:43:47,335 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:47,381 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:47,455 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 79 treesize of output 74 [2018-04-11 10:43:47,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:47,458 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 10:43:47,458 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:47,472 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:47,541 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 75 treesize of output 68 [2018-04-11 10:43:47,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:47,544 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 26 treesize of output 35 [2018-04-11 10:43:47,544 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:47,559 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:47,626 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 58 treesize of output 55 [2018-04-11 10:43:47,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:43:47,627 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:47,638 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:47,698 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 88 treesize of output 81 [2018-04-11 10:43:47,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:47,701 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 26 treesize of output 35 [2018-04-11 10:43:47,701 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:47,717 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:47,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 10:43:47,770 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:234, output treesize:210 [2018-04-11 10:43:47,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 81 [2018-04-11 10:43:47,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:47,874 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 41 treesize of output 56 [2018-04-11 10:43:47,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:47,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:47,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 73 [2018-04-11 10:43:47,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:47,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2018-04-11 10:43:47,990 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:48,002 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:48,085 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 121 treesize of output 117 [2018-04-11 10:43:48,087 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 22 treesize of output 21 [2018-04-11 10:43:48,087 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:48,098 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:48,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 128 treesize of output 161 [2018-04-11 10:43:48,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:48,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:48,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 180 [2018-04-11 10:43:48,224 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-11 10:43:48,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 132 [2018-04-11 10:43:48,423 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-11 10:43:48,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 121 treesize of output 120 [2018-04-11 10:43:48,552 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:48,699 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 10:43:48,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 138 [2018-04-11 10:43:48,862 WARN L288 Elim1Store]: Array PQE input equivalent to false [2018-04-11 10:43:48,862 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:48,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 112 [2018-04-11 10:43:48,956 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:49,014 INFO L267 ElimStorePlain]: Start of recursive call 12: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:49,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 96 [2018-04-11 10:43:49,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:49,021 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:43:49,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 93 [2018-04-11 10:43:49,023 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:43:49,036 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:43:49,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 115 [2018-04-11 10:43:49,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-11 10:43:49,044 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:49,059 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:49,154 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 113 treesize of output 106 [2018-04-11 10:43:49,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 22 treesize of output 21 [2018-04-11 10:43:49,156 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:49,167 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:49,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 5 xjuncts. [2018-04-11 10:43:49,251 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 10 variables, input treesize:348, output treesize:630 [2018-04-11 10:43:49,425 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 84 DAG size of output 77 [2018-04-11 10:43:49,710 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 81 DAG size of output 72 [2018-04-11 10:43:49,984 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 123 treesize of output 108 [2018-04-11 10:43:49,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:49,987 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 70 treesize of output 66 [2018-04-11 10:43:49,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:50,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2018-04-11 10:43:50,000 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 10:43:50,010 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 10:43:50,145 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 162 treesize of output 133 [2018-04-11 10:43:50,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:50,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:50,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 88 [2018-04-11 10:43:50,150 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 10:43:50,161 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 15 treesize of output 1 [2018-04-11 10:43:50,161 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:50,168 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:43:50,287 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 141 treesize of output 124 [2018-04-11 10:43:50,289 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 1 [2018-04-11 10:43:50,289 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:50,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:50,303 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 59 treesize of output 44 [2018-04-11 10:43:50,303 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:43:50,316 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 10:43:50,448 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 164 [2018-04-11 10:43:50,451 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 154 treesize of output 137 [2018-04-11 10:43:50,452 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:50,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:50,518 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 140 treesize of output 123 [2018-04-11 10:43:50,519 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 10:43:50,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 102 [2018-04-11 10:43:50,568 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:43:50,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 105 [2018-04-11 10:43:50,624 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 10:43:50,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:50,679 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 105 treesize of output 88 [2018-04-11 10:43:50,680 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:43:50,730 INFO L267 ElimStorePlain]: Start of recursive call 11: 5 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-11 10:43:50,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, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 116 [2018-04-11 10:43:50,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:50,885 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 78 treesize of output 59 [2018-04-11 10:43:50,885 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:43:50,898 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 15 treesize of output 1 [2018-04-11 10:43:50,898 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:50,908 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:43:51,062 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 131 treesize of output 116 [2018-04-11 10:43:51,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-11 10:43:51,064 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:51,077 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:51,078 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 57 treesize of output 42 [2018-04-11 10:43:51,079 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:43:51,091 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:43:51,242 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 188 treesize of output 174 [2018-04-11 10:43:51,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:51,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:51,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:51,262 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 155 [2018-04-11 10:43:51,264 INFO L267 ElimStorePlain]: Start of recursive call 24: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 8 xjuncts. [2018-04-11 10:43:51,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:51,540 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 148 treesize of output 131 [2018-04-11 10:43:51,541 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:43:51,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:51,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:51,782 INFO L477 Elim1Store]: Elim1 did not use 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 129 [2018-04-11 10:43:51,783 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 10:43:52,055 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 105 treesize of output 90 [2018-04-11 10:43:52,055 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:52,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 110 [2018-04-11 10:43:52,292 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:43:52,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:52,545 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 162 treesize of output 143 [2018-04-11 10:43:52,576 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:43:52,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 105 [2018-04-11 10:43:52,831 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:43:53,071 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 105 treesize of output 90 [2018-04-11 10:43:53,071 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:53,314 INFO L267 ElimStorePlain]: Start of recursive call 23: 8 dim-1 vars, End of recursive call: 15 dim-0 vars, and 12 xjuncts. [2018-04-11 10:43:53,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 25 dim-0 vars, and 20 xjuncts. [2018-04-11 10:43:53,727 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 7 variables, input treesize:1075, output treesize:1847 [2018-04-11 10:43:55,510 WARN L151 SmtUtils]: Spent 1614ms on a formula simplification. DAG size of input: 316 DAG size of output 100 [2018-04-11 10:43:55,520 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 53 treesize of output 41 [2018-04-11 10:43:55,521 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 10:43:55,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:55,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-04-11 10:43:55,527 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:55,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:55,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 86 [2018-04-11 10:43:55,601 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 82 treesize of output 71 [2018-04-11 10:43:55,602 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:55,635 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 64 treesize of output 48 [2018-04-11 10:43:55,635 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:55,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:55,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 48 [2018-04-11 10:43:55,665 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:55,695 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:55,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 55 [2018-04-11 10:43:55,765 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 32 treesize of output 14 [2018-04-11 10:43:55,765 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:55,773 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 10:43:55,774 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:55,779 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:55,842 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 71 treesize of output 57 [2018-04-11 10:43:55,844 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 34 treesize of output 16 [2018-04-11 10:43:55,844 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:55,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-11 10:43:55,852 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:55,860 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:55,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 78 [2018-04-11 10:43:55,939 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 74 treesize of output 56 [2018-04-11 10:43:55,939 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:55,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 56 treesize of output 47 [2018-04-11 10:43:55,966 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:56,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:56,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:43:56,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 65 [2018-04-11 10:43:56,020 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:43:56,047 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 48 treesize of output 43 [2018-04-11 10:43:56,048 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 10:43:56,064 INFO L267 ElimStorePlain]: Start of recursive call 15: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:43:56,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 5 dim-2 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2018-04-11 10:43:56,099 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 17 variables, input treesize:378, output treesize:161 [2018-04-11 10:43:56,411 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:43:56,428 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:43:56,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25] total 40 [2018-04-11 10:43:56,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-11 10:43:56,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-11 10:43:56,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1490, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 10:43:56,429 INFO L87 Difference]: Start difference. First operand 186 states and 226 transitions. Second operand 41 states. [2018-04-11 10:43:57,813 WARN L151 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 212 DAG size of output 97 [2018-04-11 10:43:58,151 WARN L151 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 181 DAG size of output 77 [2018-04-11 10:43:58,354 WARN L151 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 105 DAG size of output 73 [2018-04-11 10:43:58,592 WARN L151 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 189 DAG size of output 85 [2018-04-11 10:43:58,726 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 99 DAG size of output 73 [2018-04-11 10:43:58,878 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 113 DAG size of output 73 [2018-04-11 10:43:59,114 WARN L151 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 190 DAG size of output 89 [2018-04-11 10:43:59,366 WARN L151 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 208 DAG size of output 99 [2018-04-11 10:43:59,581 WARN L151 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 129 DAG size of output 75 [2018-04-11 10:43:59,743 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 129 DAG size of output 75 [2018-04-11 10:44:00,118 WARN L151 SmtUtils]: Spent 312ms on a formula simplification. DAG size of input: 165 DAG size of output 104 [2018-04-11 10:44:00,569 WARN L151 SmtUtils]: Spent 330ms on a formula simplification. DAG size of input: 168 DAG size of output 105 [2018-04-11 10:44:02,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:44:02,048 INFO L93 Difference]: Finished difference Result 322 states and 376 transitions. [2018-04-11 10:44:02,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-11 10:44:02,049 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 66 [2018-04-11 10:44:02,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:44:02,050 INFO L225 Difference]: With dead ends: 322 [2018-04-11 10:44:02,050 INFO L226 Difference]: Without dead ends: 322 [2018-04-11 10:44:02,051 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1703 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1163, Invalid=5157, Unknown=0, NotChecked=0, Total=6320 [2018-04-11 10:44:02,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-04-11 10:44:02,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 198. [2018-04-11 10:44:02,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-11 10:44:02,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 249 transitions. [2018-04-11 10:44:02,055 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 249 transitions. Word has length 66 [2018-04-11 10:44:02,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:44:02,056 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 249 transitions. [2018-04-11 10:44:02,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-11 10:44:02,056 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2018-04-11 10:44:02,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-11 10:44:02,057 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:44:02,057 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:44:02,057 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:44:02,057 INFO L82 PathProgramCache]: Analyzing trace with hash -461299895, now seen corresponding path program 1 times [2018-04-11 10:44:02,057 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:44:02,057 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:44:02,058 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:44:02,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:44:02,058 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:44:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:44:02,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:44:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:44:02,719 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:44:02,719 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:44:02,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:44:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:44:02,753 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:44:02,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:02,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:02,803 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 10:44:02,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:02,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:02,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-11 10:44:02,876 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 10:44:02,877 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 10:44:02,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:02,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:02,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:02,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-04-11 10:44:02,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 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 46 [2018-04-11 10:44:02,928 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 40 treesize of output 39 [2018-04-11 10:44:02,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:02,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:02,949 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 10:44:02,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:52 [2018-04-11 10:44:03,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 72 [2018-04-11 10:44:03,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:03,287 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 1 case distinctions, treesize of input 64 treesize of output 68 [2018-04-11 10:44:03,287 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 10:44:03,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:03,325 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 68 treesize of output 61 [2018-04-11 10:44:03,325 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 10:44:03,354 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 53 treesize of output 44 [2018-04-11 10:44:03,354 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:03,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-11 10:44:03,423 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 88 treesize of output 62 [2018-04-11 10:44:03,424 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 29 treesize of output 18 [2018-04-11 10:44:03,424 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:03,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 26 [2018-04-11 10:44:03,436 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:44:03,447 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:44:03,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-04-11 10:44:03,496 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 8 [2018-04-11 10:44:03,496 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:03,502 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:03,503 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 43 treesize of output 39 [2018-04-11 10:44:03,505 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 8 [2018-04-11 10:44:03,505 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:03,525 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:03,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-04-11 10:44:03,528 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 24 treesize of output 15 [2018-04-11 10:44:03,528 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:03,534 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:03,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-04-11 10:44:03,574 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 10:44:03,574 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:03,578 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:03,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-04-11 10:44:03,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, 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 8 [2018-04-11 10:44:03,581 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:03,586 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:03,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-11 10:44:03,619 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 8 variables, input treesize:177, output treesize:121 [2018-04-11 10:44:03,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:03,789 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 15 [2018-04-11 10:44:03,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:03,802 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 10:44:03,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-11 10:44:03,844 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:44:03,872 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:44:03,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 41 [2018-04-11 10:44:03,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-11 10:44:03,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-11 10:44:03,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1574, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 10:44:03,873 INFO L87 Difference]: Start difference. First operand 198 states and 249 transitions. Second operand 42 states. [2018-04-11 10:44:06,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:44:06,199 INFO L93 Difference]: Finished difference Result 352 states and 395 transitions. [2018-04-11 10:44:06,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-11 10:44:06,200 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 67 [2018-04-11 10:44:06,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:44:06,201 INFO L225 Difference]: With dead ends: 352 [2018-04-11 10:44:06,201 INFO L226 Difference]: Without dead ends: 352 [2018-04-11 10:44:06,202 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 7 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2172 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1022, Invalid=6460, Unknown=0, NotChecked=0, Total=7482 [2018-04-11 10:44:06,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-04-11 10:44:06,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 202. [2018-04-11 10:44:06,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-04-11 10:44:06,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 255 transitions. [2018-04-11 10:44:06,207 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 255 transitions. Word has length 67 [2018-04-11 10:44:06,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:44:06,207 INFO L459 AbstractCegarLoop]: Abstraction has 202 states and 255 transitions. [2018-04-11 10:44:06,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-11 10:44:06,207 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 255 transitions. [2018-04-11 10:44:06,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-11 10:44:06,208 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:44:06,208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:44:06,208 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:44:06,208 INFO L82 PathProgramCache]: Analyzing trace with hash -461299894, now seen corresponding path program 1 times [2018-04-11 10:44:06,208 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:44:06,210 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:44:06,210 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:44:06,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:44:06,211 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:44:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:44:06,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:44:06,743 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:44:06,743 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:44:06,743 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:44:06,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:44:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:44:06,774 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:44:06,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:06,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:06,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:06,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 10:44:06,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 10:44:06,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:06,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:06,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2018-04-11 10:44:06,934 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 10:44:06,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:06,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:06,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:06,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:06,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-04-11 10:44:06,971 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 14 [2018-04-11 10:44:06,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:06,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:06,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:06,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 51 [2018-04-11 10:44:06,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-04-11 10:44:06,998 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:07,013 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:07,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:44:07,021 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:72, output treesize:60 [2018-04-11 10:44:07,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 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 85 [2018-04-11 10:44:07,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2018-04-11 10:44:07,235 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 10:44:07,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2018-04-11 10:44:07,251 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:44:07,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 10:44:07,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 95 [2018-04-11 10:44:07,304 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 88 treesize of output 78 [2018-04-11 10:44:07,305 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 10:44:07,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:07,334 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 78 treesize of output 75 [2018-04-11 10:44:07,335 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:44:07,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:07,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:07,370 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 91 [2018-04-11 10:44:07,371 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 10:44:07,413 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-11 10:44:07,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 13 dim-0 vars, and 5 xjuncts. [2018-04-11 10:44:07,476 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:205, output treesize:314 [2018-04-11 10:44:07,679 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 121 DAG size of output 85 [2018-04-11 10:44:07,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2018-04-11 10:44:07,806 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 15 treesize of output 7 [2018-04-11 10:44:07,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:07,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 19 [2018-04-11 10:44:07,818 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 10:44:07,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:44:07,871 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 62 treesize of output 50 [2018-04-11 10:44:07,873 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 21 treesize of output 12 [2018-04-11 10:44:07,873 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:07,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:07,881 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 22 treesize of output 15 [2018-04-11 10:44:07,882 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:07,886 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:07,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 54 [2018-04-11 10:44:07,934 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 50 treesize of output 41 [2018-04-11 10:44:07,934 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:07,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:07,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:07,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:07,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 53 [2018-04-11 10:44:07,967 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-04-11 10:44:07,997 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:07,998 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 41 treesize of output 34 [2018-04-11 10:44:07,999 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:08,014 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 10:44:08,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 62 [2018-04-11 10:44:08,071 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 58 treesize of output 47 [2018-04-11 10:44:08,071 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:08,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:08,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:08,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:08,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:08,095 INFO L477 Elim1Store]: Elim1 did not use 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2018-04-11 10:44:08,095 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-04-11 10:44:08,113 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:08,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-04-11 10:44:08,155 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 15 variables, input treesize:248, output treesize:108 [2018-04-11 10:44:08,300 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:44:08,317 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:44:08,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2018-04-11 10:44:08,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-11 10:44:08,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-11 10:44:08,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1394, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 10:44:08,318 INFO L87 Difference]: Start difference. First operand 202 states and 255 transitions. Second operand 40 states. [2018-04-11 10:44:10,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:44:10,659 INFO L93 Difference]: Finished difference Result 292 states and 337 transitions. [2018-04-11 10:44:10,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-11 10:44:10,660 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 67 [2018-04-11 10:44:10,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:44:10,660 INFO L225 Difference]: With dead ends: 292 [2018-04-11 10:44:10,661 INFO L226 Difference]: Without dead ends: 292 [2018-04-11 10:44:10,662 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 47 SyntacticMatches, 9 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1887 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1016, Invalid=5146, Unknown=0, NotChecked=0, Total=6162 [2018-04-11 10:44:10,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-04-11 10:44:10,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 219. [2018-04-11 10:44:10,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-04-11 10:44:10,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 287 transitions. [2018-04-11 10:44:10,664 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 287 transitions. Word has length 67 [2018-04-11 10:44:10,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:44:10,664 INFO L459 AbstractCegarLoop]: Abstraction has 219 states and 287 transitions. [2018-04-11 10:44:10,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-11 10:44:10,664 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 287 transitions. [2018-04-11 10:44:10,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-11 10:44:10,665 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:44:10,665 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:44:10,665 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:44:10,665 INFO L82 PathProgramCache]: Analyzing trace with hash -461300699, now seen corresponding path program 1 times [2018-04-11 10:44:10,665 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:44:10,665 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:44:10,665 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:44:10,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:44:10,666 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:44:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:44:10,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:44:10,913 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:44:10,913 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:44:10,913 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:44:10,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:44:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:44:10,935 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:44:10,973 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 28 treesize of output 26 [2018-04-11 10:44:10,974 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 10:44:10,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:10,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:10,985 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 28 treesize of output 24 [2018-04-11 10:44:10,986 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 12 treesize of output 4 [2018-04-11 10:44:10,986 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:10,989 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:10,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-11 10:44:10,997 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 12 treesize of output 4 [2018-04-11 10:44:10,997 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:10,999 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:11,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-04-11 10:44:11,005 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 10:44:11,005 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:11,007 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:11,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:44:11,012 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:57, output treesize:21 [2018-04-11 10:44:11,063 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:11,063 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 10:44:11,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:11,066 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 10:44:11,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-11 10:44:11,098 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:44:11,115 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:44:11,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 23 [2018-04-11 10:44:11,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 10:44:11,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 10:44:11,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2018-04-11 10:44:11,116 INFO L87 Difference]: Start difference. First operand 219 states and 287 transitions. Second operand 24 states. [2018-04-11 10:44:11,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:44:11,768 INFO L93 Difference]: Finished difference Result 256 states and 301 transitions. [2018-04-11 10:44:11,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 10:44:11,768 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2018-04-11 10:44:11,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:44:11,769 INFO L225 Difference]: With dead ends: 256 [2018-04-11 10:44:11,769 INFO L226 Difference]: Without dead ends: 256 [2018-04-11 10:44:11,769 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=340, Invalid=1382, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 10:44:11,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-04-11 10:44:11,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 222. [2018-04-11 10:44:11,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-04-11 10:44:11,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 286 transitions. [2018-04-11 10:44:11,771 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 286 transitions. Word has length 67 [2018-04-11 10:44:11,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:44:11,771 INFO L459 AbstractCegarLoop]: Abstraction has 222 states and 286 transitions. [2018-04-11 10:44:11,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 10:44:11,772 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 286 transitions. [2018-04-11 10:44:11,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-11 10:44:11,772 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:44:11,772 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:44:11,772 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:44:11,772 INFO L82 PathProgramCache]: Analyzing trace with hash -461300698, now seen corresponding path program 1 times [2018-04-11 10:44:11,772 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:44:11,773 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:44:11,773 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:44:11,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:44:11,773 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:44:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:44:11,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:44:11,834 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-11 10:44:11,834 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:44:11,834 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:44:11,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:44:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:44:11,862 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:44:11,881 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-04-11 10:44:11,899 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 10:44:11,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-04-11 10:44:11,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 10:44:11,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 10:44:11,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-11 10:44:11,900 INFO L87 Difference]: Start difference. First operand 222 states and 286 transitions. Second operand 9 states. [2018-04-11 10:44:12,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:44:12,069 INFO L93 Difference]: Finished difference Result 263 states and 305 transitions. [2018-04-11 10:44:12,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 10:44:12,070 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-04-11 10:44:12,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:44:12,070 INFO L225 Difference]: With dead ends: 263 [2018-04-11 10:44:12,070 INFO L226 Difference]: Without dead ends: 263 [2018-04-11 10:44:12,071 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2018-04-11 10:44:12,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-04-11 10:44:12,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 229. [2018-04-11 10:44:12,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-11 10:44:12,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 293 transitions. [2018-04-11 10:44:12,074 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 293 transitions. Word has length 67 [2018-04-11 10:44:12,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:44:12,074 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 293 transitions. [2018-04-11 10:44:12,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 10:44:12,074 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 293 transitions. [2018-04-11 10:44:12,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-11 10:44:12,074 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:44:12,074 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:44:12,074 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:44:12,074 INFO L82 PathProgramCache]: Analyzing trace with hash 670680224, now seen corresponding path program 1 times [2018-04-11 10:44:12,075 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:44:12,075 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:44:12,075 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:44:12,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:44:12,075 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:44:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:44:12,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:44:12,477 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:44:12,477 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:44:12,477 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:44:12,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:44:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:44:12,503 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:44:12,507 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 10:44:12,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:12,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:12,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:12,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:12,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2018-04-11 10:44:12,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 10:44:12,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:12,523 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 10:44:12,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:12,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:12,530 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 10:44:12,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2018-04-11 10:44:12,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:12,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:12,532 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 10:44:12,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:12,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:12,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-04-11 10:44:12,562 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 10:44:12,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:12,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:12,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:12,571 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 10:44:12,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-04-11 10:44:12,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 59 [2018-04-11 10:44:12,671 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 10:44:12,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:12,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-04-11 10:44:12,700 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:12,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 36 [2018-04-11 10:44:12,715 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 10:44:12,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:44:12,743 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 2 xjuncts. [2018-04-11 10:44:12,743 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:69 [2018-04-11 10:44:12,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:12,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:12,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 55 [2018-04-11 10:44:12,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-04-11 10:44:12,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:12,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:12,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 43 [2018-04-11 10:44:12,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 15 [2018-04-11 10:44:12,818 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:12,822 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:12,835 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 2 xjuncts. [2018-04-11 10:44:12,835 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:91, output treesize:65 [2018-04-11 10:44:12,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:12,869 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:12,869 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:12,870 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 54 treesize of output 65 [2018-04-11 10:44:12,878 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 78 [2018-04-11 10:44:12,879 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:44:12,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:12,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 65 [2018-04-11 10:44:12,920 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 33 treesize of output 36 [2018-04-11 10:44:12,920 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:12,964 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 3 case distinctions, treesize of input 33 treesize of output 40 [2018-04-11 10:44:12,964 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 10:44:12,992 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 32 treesize of output 37 [2018-04-11 10:44:12,992 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:13,008 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:44:13,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:44:13,020 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:100, output treesize:81 [2018-04-11 10:44:13,270 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 52 treesize of output 50 [2018-04-11 10:44:13,271 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 10:44:13,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:13,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:13,314 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 64 treesize of output 60 [2018-04-11 10:44:13,316 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 12 treesize of output 4 [2018-04-11 10:44:13,316 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:13,321 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:13,341 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 64 treesize of output 62 [2018-04-11 10:44:13,342 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 10:44:13,342 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:13,347 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:13,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 10:44:13,366 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:181, output treesize:156 [2018-04-11 10:44:13,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 66 [2018-04-11 10:44:13,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 52 [2018-04-11 10:44:13,536 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 10:44:13,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 48 [2018-04-11 10:44:13,566 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:13,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:44:13,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:13,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 65 [2018-04-11 10:44:13,635 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 69 [2018-04-11 10:44:13,636 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:44:13,676 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:44:13,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:13,730 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 60 treesize of output 52 [2018-04-11 10:44:13,738 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 57 [2018-04-11 10:44:13,739 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:44:13,757 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:44:13,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 14 dim-0 vars, and 8 xjuncts. [2018-04-11 10:44:13,824 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:201, output treesize:426 [2018-04-11 10:44:14,075 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 57 treesize of output 42 [2018-04-11 10:44:14,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:14,077 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:44:14,077 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 26 treesize of output 21 [2018-04-11 10:44:14,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:14,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 10:44:14,083 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:14,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:14,100 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 63 [2018-04-11 10:44:14,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:14,102 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:44:14,102 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 51 treesize of output 47 [2018-04-11 10:44:14,102 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:14,116 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 27 treesize of output 18 [2018-04-11 10:44:14,117 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:14,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-04-11 10:44:14,128 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:14,138 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 18 treesize of output 13 [2018-04-11 10:44:14,138 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:14,144 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:14,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:14,150 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:131, output treesize:5 [2018-04-11 10:44:14,177 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:44:14,194 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:44:14,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 38 [2018-04-11 10:44:14,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 10:44:14,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 10:44:14,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1350, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 10:44:14,194 INFO L87 Difference]: Start difference. First operand 229 states and 293 transitions. Second operand 39 states. [2018-04-11 10:44:15,370 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 84 DAG size of output 80 [2018-04-11 10:44:15,515 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 82 DAG size of output 78 [2018-04-11 10:44:16,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:44:16,018 INFO L93 Difference]: Finished difference Result 287 states and 356 transitions. [2018-04-11 10:44:16,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 10:44:16,018 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 72 [2018-04-11 10:44:16,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:44:16,019 INFO L225 Difference]: With dead ends: 287 [2018-04-11 10:44:16,019 INFO L226 Difference]: Without dead ends: 287 [2018-04-11 10:44:16,020 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 50 SyntacticMatches, 11 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1245 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=512, Invalid=3648, Unknown=0, NotChecked=0, Total=4160 [2018-04-11 10:44:16,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-04-11 10:44:16,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 275. [2018-04-11 10:44:16,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-04-11 10:44:16,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 344 transitions. [2018-04-11 10:44:16,023 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 344 transitions. Word has length 72 [2018-04-11 10:44:16,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:44:16,023 INFO L459 AbstractCegarLoop]: Abstraction has 275 states and 344 transitions. [2018-04-11 10:44:16,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 10:44:16,023 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 344 transitions. [2018-04-11 10:44:16,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-11 10:44:16,023 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:44:16,023 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:44:16,023 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:44:16,023 INFO L82 PathProgramCache]: Analyzing trace with hash 670680225, now seen corresponding path program 1 times [2018-04-11 10:44:16,023 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:44:16,024 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:44:16,024 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:44:16,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:44:16,024 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:44:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:44:16,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:44:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:44:16,625 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:44:16,625 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:44:16,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:44:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:44:16,658 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:44:16,674 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 10:44:16,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:16,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:16,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:16,681 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 10:44:16,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:16,682 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:16,683 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:16,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:16,686 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-04-11 10:44:16,694 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 10:44:16,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:16,696 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 10:44:16,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:16,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:16,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 10:44:16,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:16,709 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 10:44:16,709 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:16,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:16,719 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 10:44:16,719 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:23 [2018-04-11 10:44:16,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:16,722 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:16,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 10:44:16,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:16,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:16,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2018-04-11 10:44:16,758 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 10:44:16,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:16,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:16,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:16,770 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 10:44:16,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:16,771 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:16,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:16,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:16,779 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-11 10:44:16,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 59 [2018-04-11 10:44:16,887 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 10:44:16,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:16,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-04-11 10:44:16,938 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:16,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 36 [2018-04-11 10:44:16,955 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 10:44:16,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:44:16,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 59 [2018-04-11 10:44:17,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 39 treesize of output 42 [2018-04-11 10:44:17,001 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:17,039 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:17,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:44:17,054 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:72, output treesize:130 [2018-04-11 10:44:17,125 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:44:17,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 87 treesize of output 94 [2018-04-11 10:44:17,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 75 [2018-04-11 10:44:17,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:17,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:44:17,225 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:44:17,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 79 [2018-04-11 10:44:17,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2018-04-11 10:44:17,228 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:17,238 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:17,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 64 [2018-04-11 10:44:17,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-11 10:44:17,277 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:17,286 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:17,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:17,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:17,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 68 [2018-04-11 10:44:17,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-04-11 10:44:17,311 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:17,320 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:17,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:44:17,339 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:167, output treesize:103 [2018-04-11 10:44:17,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 132 [2018-04-11 10:44:17,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:17,410 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 108 treesize of output 123 [2018-04-11 10:44:17,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:17,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:17,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 128 [2018-04-11 10:44:17,652 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 10:44:17,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:44:17,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 113 [2018-04-11 10:44:17,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:17,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:17,793 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 1 case distinctions, treesize of input 97 treesize of output 146 [2018-04-11 10:44:17,794 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:17,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:17,930 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 84 treesize of output 103 [2018-04-11 10:44:17,931 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:17,959 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:17,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:17,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:17,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 108 [2018-04-11 10:44:17,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:17,978 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 124 [2018-04-11 10:44:17,979 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 10:44:18,013 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 10:44:18,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:18,087 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 91 treesize of output 86 [2018-04-11 10:44:18,088 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 10:44:18,088 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:18,096 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:18,159 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:18,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:18,161 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:18,162 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 83 treesize of output 94 [2018-04-11 10:44:18,170 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 78 [2018-04-11 10:44:18,171 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:44:18,185 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:18,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-04-11 10:44:18,246 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:197, output treesize:563 [2018-04-11 10:44:19,038 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 71 DAG size of output 70 [2018-04-11 10:44:19,047 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:44:19,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 190 [2018-04-11 10:44:19,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 173 [2018-04-11 10:44:19,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:19,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:19,161 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:19,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:19,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 185 [2018-04-11 10:44:19,176 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 181 treesize of output 159 [2018-04-11 10:44:19,178 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:44:19,226 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:44:19,376 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:44:19,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 125 [2018-04-11 10:44:19,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 49 [2018-04-11 10:44:19,379 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:19,390 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:19,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:19,514 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:44:19,516 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 175 treesize of output 179 [2018-04-11 10:44:19,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 151 [2018-04-11 10:44:19,518 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:19,535 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:19,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:19,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:19,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, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 112 [2018-04-11 10:44:19,643 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 101 [2018-04-11 10:44:19,645 INFO L267 ElimStorePlain]: Start of recursive call 11: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:44:19,680 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:44:19,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:19,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:19,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:19,806 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 196 treesize of output 176 [2018-04-11 10:44:19,825 INFO L477 Elim1Store]: Elim1 applied some 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 173 treesize of output 168 [2018-04-11 10:44:19,830 INFO L267 ElimStorePlain]: Start of recursive call 13: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 9 xjuncts. [2018-04-11 10:44:19,993 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 7 xjuncts. [2018-04-11 10:44:20,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 20 dim-0 vars, and 13 xjuncts. [2018-04-11 10:44:20,260 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:480, output treesize:1807 [2018-04-11 10:44:24,668 WARN L151 SmtUtils]: Spent 4184ms on a formula simplification. DAG size of input: 361 DAG size of output 90 [2018-04-11 10:44:24,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:24,805 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 187 treesize of output 177 [2018-04-11 10:44:24,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 142 [2018-04-11 10:44:24,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:24,840 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 152 treesize of output 137 [2018-04-11 10:44:24,840 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:24,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, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 142 [2018-04-11 10:44:24,877 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 10:44:24,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 100 [2018-04-11 10:44:24,948 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 10:44:25,001 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 86 treesize of output 71 [2018-04-11 10:44:25,002 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-11 10:44:25,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:25,132 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 144 treesize of output 131 [2018-04-11 10:44:25,134 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 84 treesize of output 61 [2018-04-11 10:44:25,134 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,144 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 45 treesize of output 32 [2018-04-11 10:44:25,145 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,151 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,229 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 71 treesize of output 53 [2018-04-11 10:44:25,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 10:44:25,231 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,240 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 10:44:25,241 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,247 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 16 treesize of output 7 [2018-04-11 10:44:25,247 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,252 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,257 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 1 case distinctions, treesize of input 94 treesize of output 76 [2018-04-11 10:44:25,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 63 [2018-04-11 10:44:25,259 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 52 [2018-04-11 10:44:25,282 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:25,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 52 treesize of output 44 [2018-04-11 10:44:25,303 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:25,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:25,324 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-04-11 10:44:25,325 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,339 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 30 treesize of output 23 [2018-04-11 10:44:25,339 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,346 INFO L267 ElimStorePlain]: Start of recursive call 15: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,352 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 1 case distinctions, treesize of input 105 treesize of output 83 [2018-04-11 10:44:25,353 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 79 treesize of output 70 [2018-04-11 10:44:25,354 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 50 [2018-04-11 10:44:25,377 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:44:25,398 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2018-04-11 10:44:25,398 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,414 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 39 treesize of output 34 [2018-04-11 10:44:25,414 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-04-11 10:44:25,428 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,436 INFO L267 ElimStorePlain]: Start of recursive call 21: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,442 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 1 case distinctions, treesize of input 93 treesize of output 71 [2018-04-11 10:44:25,443 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2018-04-11 10:44:25,444 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,461 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 27 treesize of output 20 [2018-04-11 10:44:25,462 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,480 INFO L267 ElimStorePlain]: Start of recursive call 27: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,527 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 65 treesize of output 47 [2018-04-11 10:44:25,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:25,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-04-11 10:44:25,529 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,540 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 10:44:25,540 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,544 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,586 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 102 treesize of output 83 [2018-04-11 10:44:25,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:25,588 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:44:25,588 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 52 treesize of output 47 [2018-04-11 10:44:25,588 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,599 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 45 treesize of output 32 [2018-04-11 10:44:25,599 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,606 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,642 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 37 [2018-04-11 10:44:25,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:25,644 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 20 treesize of output 13 [2018-04-11 10:44:25,644 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,650 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 10:44:25,650 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,654 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:25,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:44:25,683 INFO L202 ElimStorePlain]: Needed 38 recursive calls to eliminate 12 variables, input treesize:440, output treesize:23 [2018-04-11 10:44:25,746 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:44:25,764 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:44:25,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 40 [2018-04-11 10:44:25,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-11 10:44:25,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-11 10:44:25,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1435, Unknown=1, NotChecked=0, Total=1640 [2018-04-11 10:44:25,765 INFO L87 Difference]: Start difference. First operand 275 states and 344 transitions. Second operand 41 states. [2018-04-11 10:44:26,884 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 75 DAG size of output 63 [2018-04-11 10:44:27,222 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 79 DAG size of output 76 [2018-04-11 10:44:28,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:44:28,072 INFO L93 Difference]: Finished difference Result 377 states and 466 transitions. [2018-04-11 10:44:28,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 10:44:28,073 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 72 [2018-04-11 10:44:28,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:44:28,074 INFO L225 Difference]: With dead ends: 377 [2018-04-11 10:44:28,074 INFO L226 Difference]: Without dead ends: 377 [2018-04-11 10:44:28,074 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=625, Invalid=3534, Unknown=1, NotChecked=0, Total=4160 [2018-04-11 10:44:28,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-04-11 10:44:28,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 331. [2018-04-11 10:44:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-04-11 10:44:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 438 transitions. [2018-04-11 10:44:28,076 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 438 transitions. Word has length 72 [2018-04-11 10:44:28,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:44:28,076 INFO L459 AbstractCegarLoop]: Abstraction has 331 states and 438 transitions. [2018-04-11 10:44:28,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-11 10:44:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 438 transitions. [2018-04-11 10:44:28,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-11 10:44:28,077 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:44:28,077 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:44:28,077 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:44:28,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1831048759, now seen corresponding path program 1 times [2018-04-11 10:44:28,077 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:44:28,077 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:44:28,078 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:44:28,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:44:28,078 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:44:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:44:28,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:44:28,468 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:44:28,469 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:44:28,469 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:44:28,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:44:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:44:28,494 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:44:28,497 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 10:44:28,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:28,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:28,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:28,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:28,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2018-04-11 10:44:28,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 10:44:28,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:28,511 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 10:44:28,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:28,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:28,517 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 10:44:28,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2018-04-11 10:44:28,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:28,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:28,519 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 10:44:28,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:28,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:28,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-04-11 10:44:28,551 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 10:44:28,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:28,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:28,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:28,558 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 10:44:28,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-04-11 10:44:28,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 59 [2018-04-11 10:44:28,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 39 treesize of output 38 [2018-04-11 10:44:28,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:28,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 36 [2018-04-11 10:44:28,697 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 10:44:28,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:44:28,734 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 2 xjuncts. [2018-04-11 10:44:28,734 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:43, output treesize:69 [2018-04-11 10:44:28,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 51 [2018-04-11 10:44:28,781 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 44 treesize of output 36 [2018-04-11 10:44:28,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:28,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:44:28,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:28,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:28,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 55 [2018-04-11 10:44:28,813 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 38 treesize of output 31 [2018-04-11 10:44:28,814 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:28,820 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:28,832 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 2 xjuncts. [2018-04-11 10:44:28,832 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:91, output treesize:65 [2018-04-11 10:44:28,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 65 [2018-04-11 10:44:28,886 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 48 treesize of output 53 [2018-04-11 10:44:28,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:28,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:28,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 68 [2018-04-11 10:44:28,945 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 10:44:28,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:44:28,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:28,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:28,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:28,982 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 54 treesize of output 65 [2018-04-11 10:44:28,989 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 78 [2018-04-11 10:44:28,989 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:44:28,998 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:29,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:44:29,009 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:100, output treesize:81 [2018-04-11 10:44:29,262 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 64 treesize of output 60 [2018-04-11 10:44:29,263 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 12 treesize of output 4 [2018-04-11 10:44:29,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:29,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:29,291 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 52 treesize of output 50 [2018-04-11 10:44:29,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 10:44:29,292 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:29,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:29,317 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 64 treesize of output 62 [2018-04-11 10:44:29,318 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 10:44:29,318 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:29,323 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:29,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 10:44:29,342 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:181, output treesize:156 [2018-04-11 10:44:29,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:29,502 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 60 treesize of output 52 [2018-04-11 10:44:29,511 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 57 [2018-04-11 10:44:29,512 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:44:29,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:44:29,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 66 [2018-04-11 10:44:29,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 52 [2018-04-11 10:44:29,591 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 10:44:29,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 45 [2018-04-11 10:44:29,631 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:29,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:44:29,698 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:29,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 65 [2018-04-11 10:44:29,712 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 69 [2018-04-11 10:44:29,713 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:44:29,736 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:44:29,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 14 dim-0 vars, and 8 xjuncts. [2018-04-11 10:44:29,803 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:201, output treesize:426 [2018-04-11 10:44:32,000 WARN L151 SmtUtils]: Spent 2115ms on a formula simplification. DAG size of input: 148 DAG size of output 56 [2018-04-11 10:44:32,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 70 [2018-04-11 10:44:32,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:32,166 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 10:44:32,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:32,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:32,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:32,209 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 64 treesize of output 63 [2018-04-11 10:44:32,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:32,211 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 10:44:32,211 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:32,223 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:32,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-11 10:44:32,260 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:137, output treesize:105 [2018-04-11 10:44:32,332 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 57 treesize of output 42 [2018-04-11 10:44:32,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 10:44:32,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:32,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:32,341 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:44:32,341 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 24 treesize of output 17 [2018-04-11 10:44:32,341 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:32,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:32,364 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 63 [2018-04-11 10:44:32,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:32,366 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:44:32,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-04-11 10:44:32,367 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:32,385 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 27 treesize of output 22 [2018-04-11 10:44:32,385 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:32,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:32,403 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:44:32,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 56 [2018-04-11 10:44:32,410 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2018-04-11 10:44:32,440 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 32 treesize of output 21 [2018-04-11 10:44:32,440 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:32,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-04-11 10:44:32,441 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:32,460 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 22 treesize of output 13 [2018-04-11 10:44:32,461 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:32,469 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:32,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:32,477 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:131, output treesize:5 [2018-04-11 10:44:32,509 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:44:32,528 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:44:32,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 41 [2018-04-11 10:44:32,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-11 10:44:32,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-11 10:44:32,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1577, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 10:44:32,529 INFO L87 Difference]: Start difference. First operand 331 states and 438 transitions. Second operand 42 states. [2018-04-11 10:44:33,875 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 83 DAG size of output 81 [2018-04-11 10:44:34,023 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 81 DAG size of output 79 [2018-04-11 10:44:35,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:44:35,160 INFO L93 Difference]: Finished difference Result 454 states and 597 transitions. [2018-04-11 10:44:35,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 10:44:35,161 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 73 [2018-04-11 10:44:35,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:44:35,162 INFO L225 Difference]: With dead ends: 454 [2018-04-11 10:44:35,162 INFO L226 Difference]: Without dead ends: 454 [2018-04-11 10:44:35,163 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 50 SyntacticMatches, 11 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1493 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=582, Invalid=4388, Unknown=0, NotChecked=0, Total=4970 [2018-04-11 10:44:35,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-04-11 10:44:35,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 359. [2018-04-11 10:44:35,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-04-11 10:44:35,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 472 transitions. [2018-04-11 10:44:35,167 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 472 transitions. Word has length 73 [2018-04-11 10:44:35,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:44:35,168 INFO L459 AbstractCegarLoop]: Abstraction has 359 states and 472 transitions. [2018-04-11 10:44:35,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-11 10:44:35,168 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 472 transitions. [2018-04-11 10:44:35,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-11 10:44:35,168 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:44:35,169 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:44:35,169 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:44:35,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1831048760, now seen corresponding path program 1 times [2018-04-11 10:44:35,169 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:44:35,169 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:44:35,170 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:44:35,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:44:35,170 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:44:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:44:35,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:44:35,789 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:44:35,789 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:44:35,789 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:44:35,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:44:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:44:35,821 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:44:35,845 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 10:44:35,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:35,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:35,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:35,852 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 10:44:35,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:35,853 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:35,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:35,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:35,857 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-04-11 10:44:35,893 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 10:44:35,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:35,895 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 10:44:35,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:35,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:35,912 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 10:44:35,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:35,913 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 10:44:35,914 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:35,916 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:35,921 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 10:44:35,921 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:23 [2018-04-11 10:44:35,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:35,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:35,938 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 10:44:35,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:35,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:35,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2018-04-11 10:44:35,993 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 10:44:35,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:44:35,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:35,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:36,009 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 10:44:36,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:36,011 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:36,014 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:36,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:36,020 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-11 10:44:36,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 59 [2018-04-11 10:44:36,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 39 treesize of output 38 [2018-04-11 10:44:36,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:36,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:36,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 59 [2018-04-11 10:44:36,226 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 10:44:36,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:36,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-04-11 10:44:36,256 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 36 [2018-04-11 10:44:36,270 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 10:44:36,287 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:44:36,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:44:36,302 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:72, output treesize:122 [2018-04-11 10:44:36,378 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:44:36,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 84 [2018-04-11 10:44:36,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-04-11 10:44:36,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:36,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:36,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 72 [2018-04-11 10:44:36,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 10:44:36,446 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:36,454 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:36,480 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:44:36,481 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 75 treesize of output 77 [2018-04-11 10:44:36,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-04-11 10:44:36,482 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:36,492 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:36,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:36,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:36,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 76 [2018-04-11 10:44:36,516 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 38 treesize of output 35 [2018-04-11 10:44:36,516 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:36,524 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:36,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:44:36,544 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:159, output treesize:127 [2018-04-11 10:44:36,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:36,597 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 74 treesize of output 71 [2018-04-11 10:44:36,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 48 [2018-04-11 10:44:36,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:36,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:36,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 115 [2018-04-11 10:44:36,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 96 [2018-04-11 10:44:36,665 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:36,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 98 [2018-04-11 10:44:36,822 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 10:44:36,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:44:36,926 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:36,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:36,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:36,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 84 [2018-04-11 10:44:36,935 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 65 [2018-04-11 10:44:36,936 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:44:36,949 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:37,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 107 [2018-04-11 10:44:37,003 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 82 treesize of output 103 [2018-04-11 10:44:37,003 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:37,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 80 [2018-04-11 10:44:37,062 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:37,099 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:37,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:37,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:37,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:37,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 91 [2018-04-11 10:44:37,116 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 92 [2018-04-11 10:44:37,117 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 10:44:37,153 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 10:44:37,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 5 xjuncts. [2018-04-11 10:44:37,219 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:159, output treesize:390 [2018-04-11 10:44:37,432 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse7 (= 0 c_main_~data~0.offset)) (.cse20 (not (= (select (select |c_#memory_$Pointer$.offset| c_main_~data~0.base) c_main_~data~0.offset) c_main_~data~0.offset))) (.cse0 (not (= c_main_~data~0.base (select (select |c_#memory_$Pointer$.base| c_main_~data~0.base) c_main_~data~0.offset))))) (or (and .cse0 (exists ((v_prenex_216 Int)) (let ((.cse5 (select |c_#memory_$Pointer$.offset| v_prenex_216)) (.cse6 (select |c_#memory_$Pointer$.base| v_prenex_216))) (let ((.cse1 (select .cse6 0)) (.cse4 (select .cse5 4)) (.cse3 (select .cse6 4)) (.cse2 (select .cse5 c_main_~data~0.offset))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) 0) (= c_main_~data~0.base .cse1) (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse4) 0) (not (= c_main_~data~0.base .cse3)) (= (select (select |c_#memory_$Pointer$.base| c_main_~data~0.base) .cse2) v_prenex_216) (= .cse2 c_main_~data~0.offset) (= 0 .cse2)))))) (and .cse7 (exists ((v_prenex_212 Int) (v_prenex_210 Int)) (let ((.cse10 (select |c_#memory_$Pointer$.base| v_prenex_212)) (.cse13 (select |c_#memory_$Pointer$.offset| v_prenex_212))) (let ((.cse11 (select |c_#memory_$Pointer$.base| c_main_~data~0.base)) (.cse9 (select .cse13 4)) (.cse8 (select .cse10 0)) (.cse12 (select .cse13 c_main_~data~0.offset))) (and (= c_main_~data~0.base .cse8) (= .cse9 4) (= v_prenex_212 (select .cse10 .cse9)) (= (select .cse11 .cse12) v_prenex_212) (not (= (select .cse11 v_prenex_210) (select .cse10 v_prenex_210))) (= 0 .cse12) (not (= .cse9 v_prenex_210)) (= (select (select |c_#memory_$Pointer$.offset| .cse8) .cse12) 0))))) .cse0) (and (exists ((main_~lItem~0.base Int)) (let ((.cse18 (select |c_#memory_$Pointer$.offset| main_~lItem~0.base)) (.cse19 (select |c_#memory_$Pointer$.base| main_~lItem~0.base))) (let ((.cse14 (select .cse19 0)) (.cse16 (select .cse19 4)) (.cse17 (select .cse18 4)) (.cse15 (select .cse18 c_main_~data~0.offset))) (and (= c_main_~data~0.base .cse14) (= (select (select |c_#memory_$Pointer$.base| c_main_~data~0.base) .cse15) main_~lItem~0.base) (= (select (select |c_#memory_$Pointer$.offset| .cse16) .cse17) 0) (not (= c_main_~data~0.base .cse16)) (= (select (select |c_#memory_$Pointer$.offset| .cse14) .cse15) 0) (= .cse15 c_main_~data~0.offset) (= (select (select |c_#memory_$Pointer$.base| .cse16) .cse17) 0) (= 0 .cse15))))) .cse20) (and (exists ((v_prenex_215 Int) (v_prenex_214 Int)) (let ((.cse26 (select |c_#memory_$Pointer$.offset| v_prenex_214)) (.cse22 (select |c_#memory_$Pointer$.base| v_prenex_214))) (let ((.cse25 (select |c_#memory_$Pointer$.base| c_main_~data~0.base)) (.cse21 (select .cse22 0)) (.cse24 (select .cse26 c_main_~data~0.offset)) (.cse23 (select .cse26 4))) (and (= c_main_~data~0.base .cse21) (= v_prenex_214 (select .cse22 .cse23)) (= 0 .cse24) (not (= .cse23 v_prenex_215)) (not (= (select .cse25 v_prenex_215) (select .cse22 v_prenex_215))) (= (select .cse25 .cse24) v_prenex_214) (= (select (select |c_#memory_$Pointer$.offset| .cse21) .cse24) 0) (= .cse23 4))))) .cse20 .cse7) (and (exists ((main_~item~0.base Int)) (let ((.cse30 (select |c_#memory_$Pointer$.base| main_~item~0.base)) (.cse29 (select |c_#memory_$Pointer$.offset| main_~item~0.base))) (let ((.cse27 (select .cse29 c_main_~data~0.offset)) (.cse28 (select .cse30 0))) (and (= .cse27 0) (= .cse27 c_main_~data~0.offset) (= (select (select |c_#memory_$Pointer$.offset| .cse28) .cse27) 0) (= 0 (select .cse29 4)) (= main_~item~0.base (select .cse30 4)) (= main_~item~0.base (select (select |c_#memory_$Pointer$.base| c_main_~data~0.base) .cse27)) (= c_main_~data~0.base .cse28) (not (= c_main_~data~0.base main_~item~0.base)))))) .cse20) (and (exists ((v_prenex_217 Int)) (let ((.cse34 (select |c_#memory_$Pointer$.offset| v_prenex_217)) (.cse33 (select |c_#memory_$Pointer$.base| v_prenex_217))) (let ((.cse31 (select .cse33 0)) (.cse32 (select .cse34 c_main_~data~0.offset))) (and (= c_main_~data~0.base .cse31) (= .cse32 0) (not (= c_main_~data~0.base v_prenex_217)) (= v_prenex_217 (select .cse33 4)) (= (select (select |c_#memory_$Pointer$.offset| .cse31) .cse32) 0) (= .cse32 c_main_~data~0.offset) (= 0 (select .cse34 4)) (= v_prenex_217 (select (select |c_#memory_$Pointer$.base| c_main_~data~0.base) .cse32)))))) .cse0))) is different from true [2018-04-11 10:44:37,923 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:37,987 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:44:37,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:37,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:37,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 139 [2018-04-11 10:44:38,012 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 70 treesize of output 116 [2018-04-11 10:44:38,014 INFO L267 ElimStorePlain]: Start of recursive call 3: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 9 xjuncts. [2018-04-11 10:44:38,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:44:38,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:38,189 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:44:38,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:38,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:38,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 127 [2018-04-11 10:44:38,203 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 85 [2018-04-11 10:44:38,204 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 10:44:38,228 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:38,334 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:44:38,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 94 [2018-04-11 10:44:38,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-04-11 10:44:38,337 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:38,347 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:38,444 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:44:38,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:38,451 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:38,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 150 [2018-04-11 10:44:38,464 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 85 [2018-04-11 10:44:38,465 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 10:44:38,487 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:38,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:38,569 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:44:38,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 130 [2018-04-11 10:44:38,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 52 [2018-04-11 10:44:38,572 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:38,592 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:38,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:38,665 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:44:38,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 114 [2018-04-11 10:44:38,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 52 [2018-04-11 10:44:38,668 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:38,680 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:38,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:38,682 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:44:38,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 109 [2018-04-11 10:44:38,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 52 [2018-04-11 10:44:38,685 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:38,696 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:38,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-04-11 10:44:38,753 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 10 variables, input treesize:378, output treesize:384 [2018-04-11 10:44:39,083 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 125 treesize of output 120 [2018-04-11 10:44:39,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:39,085 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 22 treesize of output 31 [2018-04-11 10:44:39,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:39,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:39,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:39,207 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 124 treesize of output 123 [2018-04-11 10:44:39,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:39,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-04-11 10:44:39,209 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:39,226 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:39,310 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:39,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 119 [2018-04-11 10:44:39,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:39,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, 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 43 [2018-04-11 10:44:39,317 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:39,331 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:39,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:39,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 150 [2018-04-11 10:44:39,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:39,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-04-11 10:44:39,411 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:39,428 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:39,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 131 [2018-04-11 10:44:39,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:39,498 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 43 [2018-04-11 10:44:39,498 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:39,512 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:39,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 113 [2018-04-11 10:44:39,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:39,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 39 [2018-04-11 10:44:39,571 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:39,585 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:39,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:44:39,634 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 13 variables, input treesize:412, output treesize:298 [2018-04-11 10:44:39,743 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 122 treesize of output 103 [2018-04-11 10:44:39,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-11 10:44:39,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:39,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:39,756 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:44:39,756 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 52 treesize of output 41 [2018-04-11 10:44:39,756 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:39,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:39,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2018-04-11 10:44:39,800 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:44:39,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 10:44:39,800 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:39,808 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:39,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-04-11 10:44:39,808 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:39,813 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:39,846 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 128 [2018-04-11 10:44:39,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 152 [2018-04-11 10:44:39,856 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 10:44:39,916 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 122 treesize of output 87 [2018-04-11 10:44:39,916 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:39,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 102 [2018-04-11 10:44:39,917 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:39,918 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 122 treesize of output 87 [2018-04-11 10:44:39,919 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:39,967 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 116 treesize of output 107 [2018-04-11 10:44:39,967 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 114 [2018-04-11 10:44:40,016 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 10:44:40,063 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 106 treesize of output 71 [2018-04-11 10:44:40,064 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,107 INFO L267 ElimStorePlain]: Start of recursive call 8: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-11 10:44:40,177 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 71 treesize of output 53 [2018-04-11 10:44:40,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-11 10:44:40,178 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:40,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-04-11 10:44:40,187 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:44:40,194 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 10:44:40,194 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,199 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,204 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 1 case distinctions, treesize of input 102 treesize of output 74 [2018-04-11 10:44:40,205 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 70 treesize of output 63 [2018-04-11 10:44:40,205 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 54 [2018-04-11 10:44:40,230 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,249 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 60 treesize of output 51 [2018-04-11 10:44:40,249 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:40,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 37 [2018-04-11 10:44:40,269 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:40,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:40,289 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 0 case distinctions, treesize of input 51 treesize of output 36 [2018-04-11 10:44:40,289 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,298 INFO L267 ElimStorePlain]: Start of recursive call 20: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 67 [2018-04-11 10:44:40,306 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 63 treesize of output 54 [2018-04-11 10:44:40,306 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 39 [2018-04-11 10:44:40,327 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:44:40,354 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 35 treesize of output 30 [2018-04-11 10:44:40,355 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,370 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 0 case distinctions, treesize of input 59 treesize of output 44 [2018-04-11 10:44:40,371 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,385 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 29 treesize of output 22 [2018-04-11 10:44:40,385 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,401 INFO L267 ElimStorePlain]: Start of recursive call 26: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,406 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 1 case distinctions, treesize of input 87 treesize of output 71 [2018-04-11 10:44:40,408 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 67 treesize of output 50 [2018-04-11 10:44:40,408 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:44:40,431 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2018-04-11 10:44:40,431 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,450 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 46 treesize of output 41 [2018-04-11 10:44:40,450 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,467 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 41 treesize of output 34 [2018-04-11 10:44:40,467 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,483 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 22 [2018-04-11 10:44:40,483 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,491 INFO L267 ElimStorePlain]: Start of recursive call 32: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,535 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 111 treesize of output 92 [2018-04-11 10:44:40,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 79 [2018-04-11 10:44:40,536 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 43 [2018-04-11 10:44:40,544 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,549 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,586 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 50 treesize of output 36 [2018-04-11 10:44:40,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 5 [2018-04-11 10:44:40,588 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 10:44:40,591 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,594 INFO L267 ElimStorePlain]: Start of recursive call 41: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:40,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 10:44:40,626 INFO L202 ElimStorePlain]: Needed 43 recursive calls to eliminate 12 variables, input treesize:378, output treesize:50 [2018-04-11 10:44:40,748 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:44:40,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:44:40,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27] total 49 [2018-04-11 10:44:40,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-11 10:44:40,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-11 10:44:40,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2154, Unknown=14, NotChecked=94, Total=2450 [2018-04-11 10:44:40,766 INFO L87 Difference]: Start difference. First operand 359 states and 472 transitions. Second operand 50 states. [2018-04-11 10:44:43,361 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 181 DAG size of output 122 [2018-04-11 10:44:44,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:44:44,831 INFO L93 Difference]: Finished difference Result 479 states and 617 transitions. [2018-04-11 10:44:44,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 10:44:44,832 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 73 [2018-04-11 10:44:44,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:44:44,833 INFO L225 Difference]: With dead ends: 479 [2018-04-11 10:44:44,833 INFO L226 Difference]: Without dead ends: 479 [2018-04-11 10:44:44,833 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1556 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=749, Invalid=5076, Unknown=31, NotChecked=150, Total=6006 [2018-04-11 10:44:44,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-04-11 10:44:44,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 354. [2018-04-11 10:44:44,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-04-11 10:44:44,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 466 transitions. [2018-04-11 10:44:44,836 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 466 transitions. Word has length 73 [2018-04-11 10:44:44,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:44:44,836 INFO L459 AbstractCegarLoop]: Abstraction has 354 states and 466 transitions. [2018-04-11 10:44:44,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-11 10:44:44,836 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 466 transitions. [2018-04-11 10:44:44,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-04-11 10:44:44,836 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:44:44,836 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, 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 10:44:44,836 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:44:44,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1255090978, now seen corresponding path program 1 times [2018-04-11 10:44:44,837 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:44:44,837 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:44:44,837 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:44:44,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:44:44,837 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:44:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:44:44,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:44:46,789 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:44:46,790 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:44:46,790 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:44:46,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:44:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:44:46,826 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:44:46,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 10:44:46,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:46,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:46,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:46,851 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 10:44:46,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:46,852 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:46,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:46,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:46,856 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-04-11 10:44:46,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:46,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:46,881 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 10:44:46,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:46,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:46,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:32 [2018-04-11 10:44:46,946 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 10:44:46,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:46,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:46,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:46,962 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 10:44:46,963 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 10:44:46,963 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:46,966 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:46,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:46,973 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:46 [2018-04-11 10:44:47,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 10:44:47,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:47,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 10:44:47,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:47,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:47,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-04-11 10:44:47,065 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:47,066 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 10:44:47,066 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:47,070 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:47,079 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 10:44:47,080 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:72, output treesize:82 [2018-04-11 10:44:47,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:47,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:47,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:47,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-11 10:44:47,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:47,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:47,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:93, output treesize:101 [2018-04-11 10:44:47,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 78 [2018-04-11 10:44:47,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:47,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:47,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:47,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 92 [2018-04-11 10:44:47,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:47,263 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:47,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:47,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:47,285 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:123, output treesize:115 [2018-04-11 10:44:47,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:47,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:47,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:47,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:47,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 43 [2018-04-11 10:44:47,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:47,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:47,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:120, output treesize:112 [2018-04-11 10:44:47,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 103 [2018-04-11 10:44:47,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:47,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:47,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:47,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 106 [2018-04-11 10:44:47,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:47,541 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:47,550 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:47,566 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 10:44:47,566 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:134, output treesize:112 [2018-04-11 10:44:47,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 79 [2018-04-11 10:44:47,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:47,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 52 [2018-04-11 10:44:47,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:47,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:47,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:47,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 92 [2018-04-11 10:44:47,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 86 [2018-04-11 10:44:47,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:47,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:47,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:47,637 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:134, output treesize:112 [2018-04-11 10:44:47,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 143 [2018-04-11 10:44:47,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-11 10:44:47,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:47,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:47,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 141 [2018-04-11 10:44:47,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-11 10:44:47,738 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:47,751 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:47,767 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 10:44:47,767 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:160, output treesize:208 [2018-04-11 10:44:48,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 189 [2018-04-11 10:44:48,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 149 [2018-04-11 10:44:48,100 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 10:44:48,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:44:48,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 142 [2018-04-11 10:44:48,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 112 [2018-04-11 10:44:48,146 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:48,159 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:48,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:44:48,175 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:234, output treesize:133 [2018-04-11 10:44:48,238 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 6 treesize of output 5 [2018-04-11 10:44:48,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:48,252 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 10:44:48,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:139, output treesize:138 [2018-04-11 10:44:48,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:48,381 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 10:44:48,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:48,394 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 10:44:48,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:143, output treesize:133 [2018-04-11 10:44:48,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 128 [2018-04-11 10:44:48,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 33 [2018-04-11 10:44:48,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:48,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:48,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:48,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 137 [2018-04-11 10:44:48,508 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 47 treesize of output 40 [2018-04-11 10:44:48,508 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:48,519 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:48,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 10:44:48,534 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:155, output treesize:123 [2018-04-11 10:44:48,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 134 [2018-04-11 10:44:48,610 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2018-04-11 10:44:48,610 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 10:44:48,623 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 10:44:48,623 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:48,634 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 42 treesize of output 26 [2018-04-11 10:44:48,634 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 10:44:48,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-04-11 10:44:48,645 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:48,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 10:44:48,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 55 [2018-04-11 10:44:48,670 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-04-11 10:44:48,670 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:44:48,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-11 10:44:48,677 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:48,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 10:44:48,682 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:48,683 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:48,689 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 10:44:48,689 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:175, output treesize:7 [2018-04-11 10:44:48,756 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:44:48,772 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:44:48,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26] total 52 [2018-04-11 10:44:48,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-11 10:44:48,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-11 10:44:48,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2481, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 10:44:48,773 INFO L87 Difference]: Start difference. First operand 354 states and 466 transitions. Second operand 52 states. [2018-04-11 10:44:49,952 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 122 DAG size of output 81 [2018-04-11 10:44:50,163 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 116 DAG size of output 79 [2018-04-11 10:44:50,391 WARN L151 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 172 DAG size of output 130 [2018-04-11 10:44:50,785 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 90 DAG size of output 73 [2018-04-11 10:44:51,415 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 106 DAG size of output 86 [2018-04-11 10:44:51,591 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 122 DAG size of output 95 [2018-04-11 10:44:55,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:44:55,015 INFO L93 Difference]: Finished difference Result 542 states and 672 transitions. [2018-04-11 10:44:55,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-11 10:44:55,015 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 76 [2018-04-11 10:44:55,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:44:55,016 INFO L225 Difference]: With dead ends: 542 [2018-04-11 10:44:55,016 INFO L226 Difference]: Without dead ends: 542 [2018-04-11 10:44:55,017 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2833 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1054, Invalid=10076, Unknown=0, NotChecked=0, Total=11130 [2018-04-11 10:44:55,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-04-11 10:44:55,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 405. [2018-04-11 10:44:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-04-11 10:44:55,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 519 transitions. [2018-04-11 10:44:55,019 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 519 transitions. Word has length 76 [2018-04-11 10:44:55,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:44:55,020 INFO L459 AbstractCegarLoop]: Abstraction has 405 states and 519 transitions. [2018-04-11 10:44:55,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-11 10:44:55,020 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 519 transitions. [2018-04-11 10:44:55,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-11 10:44:55,020 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:44:55,020 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:44:55,020 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:44:55,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1089032569, now seen corresponding path program 1 times [2018-04-11 10:44:55,020 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:44:55,020 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:44:55,021 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:44:55,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:44:55,021 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:44:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:44:55,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:44:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:44:55,989 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:44:55,989 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:44:55,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:44:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:44:56,020 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:44:56,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:56,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:56,067 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 10:44:56,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-11 10:44:56,113 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 10:44:56,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:56,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,123 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 10:44:56,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:56,124 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,126 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,131 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2018-04-11 10:44:56,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:56,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:56,161 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:56,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 10:44:56,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:33 [2018-04-11 10:44:56,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-11 10:44:56,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 8 treesize of output 7 [2018-04-11 10:44:56,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-11 10:44:56,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:56,293 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,297 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,307 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 10:44:56,307 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2018-04-11 10:44:56,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-11 10:44:56,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 10:44:56,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-11 10:44:56,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:56,357 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,359 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,368 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-04-11 10:44:56,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 74 [2018-04-11 10:44:56,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 17 [2018-04-11 10:44:56,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 77 [2018-04-11 10:44:56,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:56,430 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,436 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,446 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 10:44:56,446 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:102, output treesize:136 [2018-04-11 10:44:56,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 126 [2018-04-11 10:44:56,743 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 129 treesize of output 110 [2018-04-11 10:44:56,743 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 10:44:56,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:44:56,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 104 [2018-04-11 10:44:56,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 78 [2018-04-11 10:44:56,787 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,796 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:44:56,806 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:196, output treesize:75 [2018-04-11 10:44:56,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:44:56,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 63 [2018-04-11 10:44:56,943 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 10:44:56,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 62 [2018-04-11 10:44:56,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:44:56,967 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,973 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:56,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 10:44:56,984 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:97, output treesize:83 [2018-04-11 10:44:57,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 87 [2018-04-11 10:44:57,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-11 10:44:57,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:57,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-11 10:44:57,076 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:57,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2018-04-11 10:44:57,081 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 10:44:57,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:44:57,096 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 38 treesize of output 38 [2018-04-11 10:44:57,097 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 7 [2018-04-11 10:44:57,098 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:57,102 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 15 treesize of output 3 [2018-04-11 10:44:57,102 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 10:44:57,107 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:44:57,113 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 10:44:57,113 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:129, output treesize:7 [2018-04-11 10:44:57,158 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:44:57,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:44:57,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 25] total 51 [2018-04-11 10:44:57,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-11 10:44:57,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-11 10:44:57,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2363, Unknown=19, NotChecked=0, Total=2550 [2018-04-11 10:44:57,176 INFO L87 Difference]: Start difference. First operand 405 states and 519 transitions. Second operand 51 states. [2018-04-11 10:45:01,911 WARN L151 SmtUtils]: Spent 2060ms on a formula simplification. DAG size of input: 89 DAG size of output 61 [2018-04-11 10:45:03,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:45:03,366 INFO L93 Difference]: Finished difference Result 563 states and 682 transitions. [2018-04-11 10:45:03,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-11 10:45:03,367 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 77 [2018-04-11 10:45:03,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:45:03,368 INFO L225 Difference]: With dead ends: 563 [2018-04-11 10:45:03,368 INFO L226 Difference]: Without dead ends: 563 [2018-04-11 10:45:03,369 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3236 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1334, Invalid=9349, Unknown=29, NotChecked=0, Total=10712 [2018-04-11 10:45:03,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-04-11 10:45:03,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 401. [2018-04-11 10:45:03,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-04-11 10:45:03,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 506 transitions. [2018-04-11 10:45:03,374 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 506 transitions. Word has length 77 [2018-04-11 10:45:03,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:45:03,374 INFO L459 AbstractCegarLoop]: Abstraction has 401 states and 506 transitions. [2018-04-11 10:45:03,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-11 10:45:03,374 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 506 transitions. [2018-04-11 10:45:03,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-11 10:45:03,375 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:45:03,375 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:45:03,375 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:45:03,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1089031765, now seen corresponding path program 1 times [2018-04-11 10:45:03,375 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:45:03,375 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:45:03,375 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:45:03,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:45:03,376 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:45:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:45:03,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:45:03,418 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-04-11 10:45:03,418 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:45:03,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 10:45:03,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 10:45:03,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 10:45:03,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-11 10:45:03,419 INFO L87 Difference]: Start difference. First operand 401 states and 506 transitions. Second operand 7 states. [2018-04-11 10:45:03,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:45:03,606 INFO L93 Difference]: Finished difference Result 494 states and 613 transitions. [2018-04-11 10:45:03,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 10:45:03,607 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-04-11 10:45:03,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:45:03,608 INFO L225 Difference]: With dead ends: 494 [2018-04-11 10:45:03,608 INFO L226 Difference]: Without dead ends: 494 [2018-04-11 10:45:03,608 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-04-11 10:45:03,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-04-11 10:45:03,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 422. [2018-04-11 10:45:03,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-04-11 10:45:03,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 548 transitions. [2018-04-11 10:45:03,612 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 548 transitions. Word has length 77 [2018-04-11 10:45:03,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:45:03,612 INFO L459 AbstractCegarLoop]: Abstraction has 422 states and 548 transitions. [2018-04-11 10:45:03,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 10:45:03,612 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 548 transitions. [2018-04-11 10:45:03,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-11 10:45:03,613 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:45:03,613 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:45:03,613 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:45:03,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1089031766, now seen corresponding path program 1 times [2018-04-11 10:45:03,613 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:45:03,614 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:45:03,614 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:45:03,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:45:03,614 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:45:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:45:03,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:45:03,695 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-04-11 10:45:03,696 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:45:03,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 10:45:03,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 10:45:03,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 10:45:03,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 10:45:03,696 INFO L87 Difference]: Start difference. First operand 422 states and 548 transitions. Second operand 7 states. [2018-04-11 10:45:04,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:45:04,029 INFO L93 Difference]: Finished difference Result 521 states and 636 transitions. [2018-04-11 10:45:04,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 10:45:04,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-04-11 10:45:04,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:45:04,030 INFO L225 Difference]: With dead ends: 521 [2018-04-11 10:45:04,030 INFO L226 Difference]: Without dead ends: 521 [2018-04-11 10:45:04,031 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-04-11 10:45:04,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-04-11 10:45:04,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 418. [2018-04-11 10:45:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-04-11 10:45:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 530 transitions. [2018-04-11 10:45:04,034 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 530 transitions. Word has length 77 [2018-04-11 10:45:04,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:45:04,034 INFO L459 AbstractCegarLoop]: Abstraction has 418 states and 530 transitions. [2018-04-11 10:45:04,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 10:45:04,034 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 530 transitions. [2018-04-11 10:45:04,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-11 10:45:04,034 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:45:04,034 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:45:04,034 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:45:04,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1964501075, now seen corresponding path program 1 times [2018-04-11 10:45:04,035 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:45:04,035 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:45:04,035 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:45:04,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:45:04,035 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:45:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:45:04,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:45:04,496 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:45:04,497 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:45:04,497 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:45:04,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:45:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:45:04,525 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:45:04,528 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 10:45:04,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:45:04,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:04,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:04,535 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 10:45:04,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:45:04,536 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:04,537 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:04,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:04,541 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-04-11 10:45:04,549 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 10:45:04,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:04,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 16 treesize of output 23 [2018-04-11 10:45:04,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:04,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:04,561 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 10:45:04,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:04,563 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 10:45:04,563 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:04,565 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:04,570 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 10:45:04,571 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:23 [2018-04-11 10:45:04,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:04,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:04,576 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 10:45:04,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:04,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:04,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2018-04-11 10:45:04,614 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 10:45:04,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:45:04,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:04,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:04,626 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 10:45:04,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:45:04,636 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:04,638 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:04,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:04,644 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-11 10:45:04,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 59 [2018-04-11 10:45:04,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2018-04-11 10:45:04,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:04,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 36 [2018-04-11 10:45:04,816 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 10:45:04,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-04-11 10:45:04,840 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:04,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:45:04,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 59 [2018-04-11 10:45:04,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2018-04-11 10:45:04,891 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:04,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-04-11 10:45:04,925 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:04,941 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:04,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:45:04,957 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:72, output treesize:122 [2018-04-11 10:45:05,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 87 [2018-04-11 10:45:05,045 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 80 treesize of output 72 [2018-04-11 10:45:05,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:05,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:05,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:05,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:05,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 91 [2018-04-11 10:45:05,102 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 38 treesize of output 31 [2018-04-11 10:45:05,102 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:05,114 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:05,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:05,144 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:05,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 82 [2018-04-11 10:45:05,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 42 [2018-04-11 10:45:05,147 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:05,159 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:05,185 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:05,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 77 [2018-04-11 10:45:05,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 42 [2018-04-11 10:45:05,195 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:05,204 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:05,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:45:05,226 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:163, output treesize:151 [2018-04-11 10:45:05,279 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:05,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:05,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:05,285 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 115 treesize of output 120 [2018-04-11 10:45:05,294 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 101 [2018-04-11 10:45:05,295 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:45:05,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:05,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 117 [2018-04-11 10:45:05,362 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 110 treesize of output 121 [2018-04-11 10:45:05,362 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:05,427 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 3 case distinctions, treesize of input 95 treesize of output 104 [2018-04-11 10:45:05,427 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 10:45:05,486 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:45:05,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:05,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 87 [2018-04-11 10:45:05,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 67 [2018-04-11 10:45:05,530 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:05,542 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:05,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 178 [2018-04-11 10:45:05,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 137 [2018-04-11 10:45:05,567 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:05,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 123 [2018-04-11 10:45:05,674 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-11 10:45:05,784 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 88 treesize of output 105 [2018-04-11 10:45:05,784 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:05,811 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:45:05,852 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 99 treesize of output 90 [2018-04-11 10:45:05,854 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 40 treesize of output 57 [2018-04-11 10:45:05,854 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:05,861 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:05,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 10:45:05,891 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:229, output treesize:290 [2018-04-11 10:45:06,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:06,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:06,287 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 136 treesize of output 124 [2018-04-11 10:45:06,297 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 116 [2018-04-11 10:45:06,298 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:06,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:06,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:06,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:06,629 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 128 treesize of output 118 [2018-04-11 10:45:06,643 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 109 [2018-04-11 10:45:06,645 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:06,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:07,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:07,220 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:07,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 98 [2018-04-11 10:45:07,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 52 [2018-04-11 10:45:07,223 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:07,234 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:07,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:07,237 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:07,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 154 [2018-04-11 10:45:07,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 65 [2018-04-11 10:45:07,240 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:07,250 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:07,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:07,252 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:07,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 98 [2018-04-11 10:45:07,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-04-11 10:45:07,255 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:07,264 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:07,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:07,473 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:07,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 151 [2018-04-11 10:45:07,486 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 140 [2018-04-11 10:45:07,488 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:07,560 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:07,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:07,995 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:08,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 214 [2018-04-11 10:45:08,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 65 [2018-04-11 10:45:08,001 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:08,016 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:08,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:08,019 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:08,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 138 [2018-04-11 10:45:08,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 52 [2018-04-11 10:45:08,026 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:08,038 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:08,040 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:08,042 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:08,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 126 [2018-04-11 10:45:08,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-04-11 10:45:08,048 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:08,060 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:08,280 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:08,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 90 [2018-04-11 10:45:08,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 52 [2018-04-11 10:45:08,284 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:08,293 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:08,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:08,296 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:08,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 162 [2018-04-11 10:45:08,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 84 [2018-04-11 10:45:08,299 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:08,310 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:08,311 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:08,312 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:08,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 102 [2018-04-11 10:45:08,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 52 [2018-04-11 10:45:08,315 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:08,328 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:08,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 12 dim-0 vars, and 9 xjuncts. [2018-04-11 10:45:08,463 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 6 variables, input treesize:433, output treesize:988 [2018-04-11 10:45:09,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:09,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 126 [2018-04-11 10:45:09,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 106 [2018-04-11 10:45:09,029 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 10:45:09,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 120 [2018-04-11 10:45:09,069 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 10:45:09,133 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 91 treesize of output 90 [2018-04-11 10:45:09,133 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,135 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 94 treesize of output 83 [2018-04-11 10:45:09,135 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,136 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 94 treesize of output 83 [2018-04-11 10:45:09,136 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,187 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 10:45:09,187 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,232 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 78 treesize of output 67 [2018-04-11 10:45:09,232 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-11 10:45:09,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 63 [2018-04-11 10:45:09,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 42 [2018-04-11 10:45:09,359 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:45:09,381 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 38 treesize of output 31 [2018-04-11 10:45:09,382 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,398 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 31 treesize of output 26 [2018-04-11 10:45:09,398 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,413 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 0 case distinctions, treesize of input 55 treesize of output 40 [2018-04-11 10:45:09,413 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,426 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 25 treesize of output 18 [2018-04-11 10:45:09,427 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,433 INFO L267 ElimStorePlain]: Start of recursive call 10: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,436 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 67 treesize of output 49 [2018-04-11 10:45:09,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:09,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-04-11 10:45:09,438 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:45:09,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 10:45:09,449 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,455 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 10:45:09,456 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,460 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,465 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 1 case distinctions, treesize of input 83 treesize of output 67 [2018-04-11 10:45:09,466 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 63 treesize of output 56 [2018-04-11 10:45:09,466 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2018-04-11 10:45:09,487 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,504 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2018-04-11 10:45:09,505 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,519 INFO L267 ElimStorePlain]: Start of recursive call 20: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 72 [2018-04-11 10:45:09,527 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 64 treesize of output 60 [2018-04-11 10:45:09,527 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:09,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:09,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, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2018-04-11 10:45:09,553 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,574 INFO L267 ElimStorePlain]: Start of recursive call 24: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:09,618 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 91 treesize of output 81 [2018-04-11 10:45:09,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 10:45:09,619 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,629 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:09,630 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 39 treesize of output 30 [2018-04-11 10:45:09,630 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,638 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,679 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 50 treesize of output 38 [2018-04-11 10:45:09,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 10:45:09,681 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:09,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:09,692 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 12 [2018-04-11 10:45:09,692 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,697 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,734 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 92 treesize of output 80 [2018-04-11 10:45:09,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-04-11 10:45:09,735 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:09,745 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 41 treesize of output 42 [2018-04-11 10:45:09,745 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,753 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,785 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 55 treesize of output 39 [2018-04-11 10:45:09,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-11 10:45:09,786 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:09,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2018-04-11 10:45:09,793 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,796 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:09,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 10:45:09,823 INFO L202 ElimStorePlain]: Needed 38 recursive calls to eliminate 10 variables, input treesize:325, output treesize:38 [2018-04-11 10:45:09,888 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:45:09,906 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:45:09,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 43 [2018-04-11 10:45:09,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-11 10:45:09,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-11 10:45:09,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1579, Unknown=9, NotChecked=0, Total=1806 [2018-04-11 10:45:09,907 INFO L87 Difference]: Start difference. First operand 418 states and 530 transitions. Second operand 43 states. [2018-04-11 10:45:11,669 WARN L151 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 163 DAG size of output 156 [2018-04-11 10:45:12,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:45:12,167 INFO L93 Difference]: Finished difference Result 442 states and 554 transitions. [2018-04-11 10:45:12,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 10:45:12,167 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 77 [2018-04-11 10:45:12,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:45:12,168 INFO L225 Difference]: With dead ends: 442 [2018-04-11 10:45:12,168 INFO L226 Difference]: Without dead ends: 442 [2018-04-11 10:45:12,169 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1311 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=633, Invalid=4046, Unknown=13, NotChecked=0, Total=4692 [2018-04-11 10:45:12,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-04-11 10:45:12,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 424. [2018-04-11 10:45:12,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-04-11 10:45:12,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 536 transitions. [2018-04-11 10:45:12,172 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 536 transitions. Word has length 77 [2018-04-11 10:45:12,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:45:12,172 INFO L459 AbstractCegarLoop]: Abstraction has 424 states and 536 transitions. [2018-04-11 10:45:12,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-11 10:45:12,172 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 536 transitions. [2018-04-11 10:45:12,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-11 10:45:12,172 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:45:12,172 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:45:12,172 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:45:12,172 INFO L82 PathProgramCache]: Analyzing trace with hash 743364234, now seen corresponding path program 1 times [2018-04-11 10:45:12,172 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:45:12,172 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:45:12,173 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:45:12,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:45:12,173 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:45:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:45:12,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:45:12,203 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-04-11 10:45:12,203 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:45:12,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 10:45:12,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 10:45:12,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 10:45:12,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-11 10:45:12,204 INFO L87 Difference]: Start difference. First operand 424 states and 536 transitions. Second operand 7 states. [2018-04-11 10:45:12,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:45:12,415 INFO L93 Difference]: Finished difference Result 477 states and 576 transitions. [2018-04-11 10:45:12,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 10:45:12,415 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 78 [2018-04-11 10:45:12,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:45:12,416 INFO L225 Difference]: With dead ends: 477 [2018-04-11 10:45:12,416 INFO L226 Difference]: Without dead ends: 477 [2018-04-11 10:45:12,417 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-04-11 10:45:12,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-04-11 10:45:12,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 424. [2018-04-11 10:45:12,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-04-11 10:45:12,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 522 transitions. [2018-04-11 10:45:12,421 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 522 transitions. Word has length 78 [2018-04-11 10:45:12,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:45:12,421 INFO L459 AbstractCegarLoop]: Abstraction has 424 states and 522 transitions. [2018-04-11 10:45:12,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 10:45:12,421 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 522 transitions. [2018-04-11 10:45:12,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-11 10:45:12,422 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:45:12,422 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:45:12,422 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:45:12,422 INFO L82 PathProgramCache]: Analyzing trace with hash 743364235, now seen corresponding path program 1 times [2018-04-11 10:45:12,422 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:45:12,423 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:45:12,423 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:45:12,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:45:12,423 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:45:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:45:12,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:45:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-04-11 10:45:12,485 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:45:12,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 10:45:12,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 10:45:12,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 10:45:12,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 10:45:12,486 INFO L87 Difference]: Start difference. First operand 424 states and 522 transitions. Second operand 7 states. [2018-04-11 10:45:12,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:45:12,701 INFO L93 Difference]: Finished difference Result 503 states and 596 transitions. [2018-04-11 10:45:12,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 10:45:12,701 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 78 [2018-04-11 10:45:12,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:45:12,702 INFO L225 Difference]: With dead ends: 503 [2018-04-11 10:45:12,702 INFO L226 Difference]: Without dead ends: 503 [2018-04-11 10:45:12,702 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-04-11 10:45:12,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-04-11 10:45:12,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 399. [2018-04-11 10:45:12,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-04-11 10:45:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 478 transitions. [2018-04-11 10:45:12,705 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 478 transitions. Word has length 78 [2018-04-11 10:45:12,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:45:12,705 INFO L459 AbstractCegarLoop]: Abstraction has 399 states and 478 transitions. [2018-04-11 10:45:12,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 10:45:12,705 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 478 transitions. [2018-04-11 10:45:12,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-11 10:45:12,705 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:45:12,705 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:45:12,705 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:45:12,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1475052260, now seen corresponding path program 1 times [2018-04-11 10:45:12,705 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:45:12,705 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:45:12,706 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:45:12,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:45:12,706 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:45:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:45:12,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:45:13,350 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:45:13,350 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:45:13,350 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:45:13,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:45:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:45:13,381 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:45:13,417 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 10:45:13,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:45:13,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,426 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 10:45:13,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:45:13,428 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,429 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,433 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-04-11 10:45:13,475 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 10:45:13,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:13,477 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 10:45:13,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,488 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 10:45:13,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:13,490 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 10:45:13,490 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,493 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,498 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 10:45:13,498 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:23 [2018-04-11 10:45:13,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:13,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:13,521 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 10:45:13,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:32 [2018-04-11 10:45:13,576 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 10:45:13,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 10:45:13,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,591 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 10:45:13,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:45:13,592 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,595 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,602 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-04-11 10:45:13,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:13,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:13,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:13,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 10:45:13,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:47 [2018-04-11 10:45:13,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2018-04-11 10:45:13,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 10:45:13,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2018-04-11 10:45:13,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:45:13,762 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,766 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,777 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:69 [2018-04-11 10:45:13,815 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:13,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2018-04-11 10:45:13,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-04-11 10:45:13,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:13,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:13,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 57 [2018-04-11 10:45:13,845 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 38 treesize of output 31 [2018-04-11 10:45:13,845 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,851 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,861 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:91, output treesize:65 [2018-04-11 10:45:13,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2018-04-11 10:45:13,903 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 27 treesize of output 38 [2018-04-11 10:45:13,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,923 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:13,925 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:13,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 100 [2018-04-11 10:45:13,934 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 58 [2018-04-11 10:45:13,935 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:45:13,949 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:13,960 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 10:45:13,960 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:113, output treesize:123 [2018-04-11 10:45:14,212 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:14,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 141 [2018-04-11 10:45:14,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 57 [2018-04-11 10:45:14,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:14,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:14,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:14,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:14,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 139 [2018-04-11 10:45:14,248 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 133 [2018-04-11 10:45:14,250 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:14,295 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:14,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:14,333 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:168, output treesize:380 [2018-04-11 10:45:16,464 WARN L151 SmtUtils]: Spent 2043ms on a formula simplification. DAG size of input: 105 DAG size of output 41 [2018-04-11 10:45:16,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:16,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 86 [2018-04-11 10:45:16,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:16,575 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 10:45:16,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:16,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:16,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:16,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 90 [2018-04-11 10:45:16,610 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:16,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 39 [2018-04-11 10:45:16,611 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:16,627 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:16,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 10:45:16,645 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:135, output treesize:109 [2018-04-11 10:45:16,707 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 75 treesize of output 73 [2018-04-11 10:45:16,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:16,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2018-04-11 10:45:16,725 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 10:45:16,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 10:45:16,735 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:16,740 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 10:45:16,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:16,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:45:16,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 10:45:16,762 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:132, output treesize:69 [2018-04-11 10:45:16,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 55 [2018-04-11 10:45:16,897 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 28 treesize of output 17 [2018-04-11 10:45:16,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:16,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 10:45:16,907 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:16,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 10:45:16,911 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:16,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:16,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:16,917 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:83, output treesize:5 [2018-04-11 10:45:16,942 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:45:16,969 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:45:16,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2018-04-11 10:45:16,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-11 10:45:16,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-11 10:45:16,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2313, Unknown=13, NotChecked=0, Total=2550 [2018-04-11 10:45:16,970 INFO L87 Difference]: Start difference. First operand 399 states and 478 transitions. Second operand 51 states. [2018-04-11 10:45:19,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:45:19,268 INFO L93 Difference]: Finished difference Result 419 states and 495 transitions. [2018-04-11 10:45:19,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 10:45:19,269 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 78 [2018-04-11 10:45:19,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:45:19,270 INFO L225 Difference]: With dead ends: 419 [2018-04-11 10:45:19,270 INFO L226 Difference]: Without dead ends: 419 [2018-04-11 10:45:19,270 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1834 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=792, Invalid=5675, Unknown=13, NotChecked=0, Total=6480 [2018-04-11 10:45:19,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-04-11 10:45:19,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 399. [2018-04-11 10:45:19,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-04-11 10:45:19,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 477 transitions. [2018-04-11 10:45:19,273 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 477 transitions. Word has length 78 [2018-04-11 10:45:19,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:45:19,274 INFO L459 AbstractCegarLoop]: Abstraction has 399 states and 477 transitions. [2018-04-11 10:45:19,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-11 10:45:19,274 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 477 transitions. [2018-04-11 10:45:19,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-11 10:45:19,274 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:45:19,274 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:45:19,274 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:45:19,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1475052259, now seen corresponding path program 1 times [2018-04-11 10:45:19,274 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:45:19,274 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:45:19,275 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:45:19,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:45:19,275 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:45:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:45:19,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:45:19,783 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:45:19,783 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:45:19,783 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:45:19,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:45:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:45:19,815 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:45:19,818 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 10:45:19,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:45:19,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:19,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:19,826 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 10:45:19,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:45:19,827 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:19,831 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:19,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:19,835 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-04-11 10:45:19,843 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 10:45:19,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:19,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 10:45:19,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:19,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:19,857 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 10:45:19,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:19,858 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 10:45:19,859 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:19,861 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:19,866 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 10:45:19,866 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:23 [2018-04-11 10:45:19,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:19,872 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:19,872 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 10:45:19,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:19,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:19,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2018-04-11 10:45:19,909 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 10:45:19,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:45:19,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:19,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:19,920 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 10:45:19,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:45:19,921 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:19,924 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:19,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:19,929 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-11 10:45:20,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 59 [2018-04-11 10:45:20,048 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 10:45:20,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:20,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-04-11 10:45:20,081 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:20,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 36 [2018-04-11 10:45:20,108 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 10:45:20,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:45:20,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 59 [2018-04-11 10:45:20,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 39 treesize of output 38 [2018-04-11 10:45:20,155 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:20,193 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:20,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:45:20,208 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:72, output treesize:122 [2018-04-11 10:45:20,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:20,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:20,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 91 [2018-04-11 10:45:20,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-04-11 10:45:20,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:20,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:20,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 87 [2018-04-11 10:45:20,340 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 80 treesize of output 72 [2018-04-11 10:45:20,340 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:20,359 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:20,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:20,388 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:20,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 82 [2018-04-11 10:45:20,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 42 [2018-04-11 10:45:20,391 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:20,400 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:20,426 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:20,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 93 [2018-04-11 10:45:20,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 92 [2018-04-11 10:45:20,436 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:20,454 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:20,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:45:20,476 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:163, output treesize:151 [2018-04-11 10:45:20,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 162 [2018-04-11 10:45:20,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 151 [2018-04-11 10:45:20,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:45:20,743 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 96 treesize of output 113 [2018-04-11 10:45:20,743 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:20,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:45:20,820 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:20,821 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:20,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 98 [2018-04-11 10:45:20,834 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 100 [2018-04-11 10:45:20,835 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:20,872 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:20,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:20,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 117 [2018-04-11 10:45:20,895 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:20,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 91 [2018-04-11 10:45:20,897 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 10:45:20,908 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:45:20,967 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 88 treesize of output 105 [2018-04-11 10:45:20,967 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:20,989 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:21,062 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 115 treesize of output 90 [2018-04-11 10:45:21,064 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 40 treesize of output 57 [2018-04-11 10:45:21,064 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:21,071 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:21,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:21,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:21,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:21,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 112 [2018-04-11 10:45:21,147 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 101 [2018-04-11 10:45:21,148 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:45:21,162 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:21,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-04-11 10:45:21,222 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:229, output treesize:543 [2018-04-11 10:45:21,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:21,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:21,703 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 136 treesize of output 124 [2018-04-11 10:45:21,713 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 113 [2018-04-11 10:45:21,714 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:21,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:22,071 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:22,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 142 [2018-04-11 10:45:22,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 65 [2018-04-11 10:45:22,075 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:22,086 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:22,310 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:22,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 194 [2018-04-11 10:45:22,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 65 [2018-04-11 10:45:22,315 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:22,329 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:22,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:22,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:22,524 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 140 treesize of output 124 [2018-04-11 10:45:22,534 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 119 [2018-04-11 10:45:22,535 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:22,580 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:22,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:22,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:22,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:22,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 163 [2018-04-11 10:45:22,809 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 155 [2018-04-11 10:45:22,810 INFO L267 ElimStorePlain]: Start of recursive call 11: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:22,862 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:23,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:23,101 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:23,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 98 [2018-04-11 10:45:23,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-04-11 10:45:23,104 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:23,115 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:23,117 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:23,118 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:23,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 154 [2018-04-11 10:45:23,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 84 [2018-04-11 10:45:23,121 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:23,132 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:23,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:23,134 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:23,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 102 [2018-04-11 10:45:23,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-04-11 10:45:23,138 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:23,149 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:23,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 12 dim-0 vars, and 9 xjuncts. [2018-04-11 10:45:23,276 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:449, output treesize:1031 [2018-04-11 10:45:23,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 117 [2018-04-11 10:45:23,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:23,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 39 [2018-04-11 10:45:23,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:23,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:23,803 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 111 treesize of output 106 [2018-04-11 10:45:23,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:23,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2018-04-11 10:45:23,805 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:23,819 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:23,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:23,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 107 [2018-04-11 10:45:23,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:23,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 39 [2018-04-11 10:45:23,913 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:23,927 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:24,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 133 [2018-04-11 10:45:24,008 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:24,009 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 10:45:24,009 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:24,027 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:24,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:24,096 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 108 treesize of output 107 [2018-04-11 10:45:24,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:24,098 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 10:45:24,098 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:24,112 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:24,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 126 [2018-04-11 10:45:24,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:24,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 39 [2018-04-11 10:45:24,179 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:24,203 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:24,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:24,251 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 21 variables, input treesize:364, output treesize:274 [2018-04-11 10:45:24,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 118 [2018-04-11 10:45:24,543 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 105 treesize of output 98 [2018-04-11 10:45:24,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:24,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:24,577 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:24,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 104 [2018-04-11 10:45:24,584 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:24,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:24,649 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:24,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 102 [2018-04-11 10:45:24,649 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 10:45:24,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 75 [2018-04-11 10:45:24,701 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:24,750 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 75 treesize of output 66 [2018-04-11 10:45:24,750 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:24,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-11 10:45:24,890 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 1 case distinctions, treesize of input 73 treesize of output 63 [2018-04-11 10:45:24,892 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 59 treesize of output 52 [2018-04-11 10:45:24,892 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:24,916 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:24,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-04-11 10:45:24,917 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:24,939 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:24,939 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 52 treesize of output 48 [2018-04-11 10:45:24,939 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:24,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:24,962 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 43 treesize of output 36 [2018-04-11 10:45:24,962 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:24,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:24,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:24,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-11 10:45:24,984 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:24,995 INFO L267 ElimStorePlain]: Start of recursive call 8: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:24,998 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 66 treesize of output 50 [2018-04-11 10:45:24,999 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:24,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 10:45:24,999 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:25,008 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 10:45:25,008 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:25,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-04-11 10:45:25,015 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:25,020 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:25,026 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 1 case distinctions, treesize of input 78 treesize of output 66 [2018-04-11 10:45:25,028 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:25,028 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 62 treesize of output 58 [2018-04-11 10:45:25,028 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:25,054 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:25,055 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 52 treesize of output 48 [2018-04-11 10:45:25,055 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:25,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2018-04-11 10:45:25,078 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 10:45:25,098 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 38 treesize of output 33 [2018-04-11 10:45:25,099 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:25,117 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-04-11 10:45:25,118 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:25,127 INFO L267 ElimStorePlain]: Start of recursive call 18: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:25,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 60 [2018-04-11 10:45:25,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2018-04-11 10:45:25,134 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:45:25,156 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 0 case distinctions, treesize of input 52 treesize of output 43 [2018-04-11 10:45:25,156 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:25,175 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 10:45:25,175 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:25,191 INFO L267 ElimStorePlain]: Start of recursive call 24: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:25,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:25,248 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 95 treesize of output 85 [2018-04-11 10:45:25,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 10:45:25,249 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:25,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:25,260 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:25,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:25,261 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 37 treesize of output 34 [2018-04-11 10:45:25,261 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:25,269 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:25,318 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 50 treesize of output 38 [2018-04-11 10:45:25,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 10:45:25,319 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:25,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:25,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-04-11 10:45:25,332 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:25,337 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:25,380 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 98 treesize of output 86 [2018-04-11 10:45:25,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 10:45:25,382 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:25,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:25,393 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:25,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:25,394 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 33 treesize of output 30 [2018-04-11 10:45:25,394 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:25,402 INFO L267 ElimStorePlain]: Start of recursive call 34: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:25,438 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 40 [2018-04-11 10:45:25,439 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:25,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 10:45:25,439 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:25,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:25,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-04-11 10:45:25,447 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:25,451 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:25,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 10:45:25,480 INFO L202 ElimStorePlain]: Needed 39 recursive calls to eliminate 12 variables, input treesize:325, output treesize:35 [2018-04-11 10:45:25,571 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:45:25,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:45:25,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 43 [2018-04-11 10:45:25,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-11 10:45:25,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-11 10:45:25,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1591, Unknown=9, NotChecked=0, Total=1806 [2018-04-11 10:45:25,589 INFO L87 Difference]: Start difference. First operand 399 states and 477 transitions. Second operand 43 states. [2018-04-11 10:45:27,107 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 145 DAG size of output 116 [2018-04-11 10:45:27,524 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 165 DAG size of output 158 [2018-04-11 10:45:28,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:45:28,056 INFO L93 Difference]: Finished difference Result 365 states and 413 transitions. [2018-04-11 10:45:28,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 10:45:28,057 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 78 [2018-04-11 10:45:28,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:45:28,057 INFO L225 Difference]: With dead ends: 365 [2018-04-11 10:45:28,057 INFO L226 Difference]: Without dead ends: 365 [2018-04-11 10:45:28,058 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1290 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=593, Invalid=3951, Unknown=12, NotChecked=0, Total=4556 [2018-04-11 10:45:28,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-04-11 10:45:28,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 341. [2018-04-11 10:45:28,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-04-11 10:45:28,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 389 transitions. [2018-04-11 10:45:28,060 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 389 transitions. Word has length 78 [2018-04-11 10:45:28,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:45:28,060 INFO L459 AbstractCegarLoop]: Abstraction has 341 states and 389 transitions. [2018-04-11 10:45:28,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-11 10:45:28,060 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 389 transitions. [2018-04-11 10:45:28,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-11 10:45:28,060 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:45:28,060 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, 1, 1, 1, 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 10:45:28,061 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:45:28,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1709097013, now seen corresponding path program 1 times [2018-04-11 10:45:28,061 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:45:28,061 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:45:28,061 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:45:28,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:45:28,062 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:45:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:45:28,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:45:28,388 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:45:28,388 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:45:28,388 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:45:28,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:45:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:45:28,414 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:45:28,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 10:45:28,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:45:28,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:28,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:28,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:28,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2018-04-11 10:45:28,462 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 10:45:28,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:28,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, 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 10:45:28,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:28,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:28,469 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 10:45:28,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2018-04-11 10:45:28,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:28,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:28,483 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 10:45:28,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:28,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:28,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-04-11 10:45:28,511 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 10:45:28,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:45:28,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:28,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:28,517 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 10:45:28,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-04-11 10:45:28,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 59 [2018-04-11 10:45:28,614 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 10:45:28,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:28,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-04-11 10:45:28,661 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:28,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 36 [2018-04-11 10:45:28,676 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 10:45:28,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:45:28,697 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 2 xjuncts. [2018-04-11 10:45:28,697 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:69 [2018-04-11 10:45:28,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 51 [2018-04-11 10:45:28,754 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 44 treesize of output 36 [2018-04-11 10:45:28,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:28,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:28,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:28,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:28,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 55 [2018-04-11 10:45:28,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 38 treesize of output 31 [2018-04-11 10:45:28,783 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:28,789 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:28,800 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 2 xjuncts. [2018-04-11 10:45:28,801 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:91, output treesize:65 [2018-04-11 10:45:28,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 65 [2018-04-11 10:45:28,854 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 48 treesize of output 53 [2018-04-11 10:45:28,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:28,894 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 3 case distinctions, treesize of input 33 treesize of output 40 [2018-04-11 10:45:28,894 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 10:45:28,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:45:28,923 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:28,923 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:28,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:28,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, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 65 [2018-04-11 10:45:28,931 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 78 [2018-04-11 10:45:28,932 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:45:28,940 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:28,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:45:28,951 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:100, output treesize:81 [2018-04-11 10:45:29,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 108 treesize of output 104 [2018-04-11 10:45:29,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:29,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 98 [2018-04-11 10:45:29,483 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 10:45:29,537 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 10:45:29,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:29,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:29,591 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:29,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 104 [2018-04-11 10:45:29,596 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:29,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:45:29,730 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 108 treesize of output 101 [2018-04-11 10:45:29,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:29,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-04-11 10:45:29,734 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:29,746 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:29,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:29,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 88 [2018-04-11 10:45:29,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:29,847 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 84 [2018-04-11 10:45:29,848 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:29,881 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:30,005 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 96 treesize of output 89 [2018-04-11 10:45:30,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:30,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-04-11 10:45:30,008 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:30,018 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:30,123 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:30,125 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 85 treesize of output 75 [2018-04-11 10:45:30,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:30,138 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 72 [2018-04-11 10:45:30,139 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:30,167 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:30,290 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 89 treesize of output 78 [2018-04-11 10:45:30,291 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:30,293 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 40 treesize of output 38 [2018-04-11 10:45:30,293 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:30,301 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:30,303 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 88 treesize of output 83 [2018-04-11 10:45:30,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:30,307 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 31 treesize of output 35 [2018-04-11 10:45:30,307 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:30,316 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:30,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 6 dim-2 vars, End of recursive call: 14 dim-0 vars, and 8 xjuncts. [2018-04-11 10:45:30,415 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 11 variables, input treesize:313, output treesize:578 [2018-04-11 10:45:34,717 WARN L151 SmtUtils]: Spent 4214ms on a formula simplification. DAG size of input: 159 DAG size of output 64 [2018-04-11 10:45:35,083 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:35,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 93 [2018-04-11 10:45:35,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:35,095 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 1 case distinctions, treesize of input 81 treesize of output 78 [2018-04-11 10:45:35,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:45:35,133 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 56 [2018-04-11 10:45:35,133 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:35,134 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 58 treesize of output 53 [2018-04-11 10:45:35,134 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:35,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:35,167 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:35,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 51 [2018-04-11 10:45:35,168 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 10:45:35,169 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:35,169 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:35,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2018-04-11 10:45:35,170 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:45:35,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:35,209 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 1 case distinctions, treesize of input 68 treesize of output 65 [2018-04-11 10:45:35,209 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 10:45:35,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:35,249 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:35,256 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 55 treesize of output 63 [2018-04-11 10:45:35,257 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:35,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:35,259 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:35,266 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 52 treesize of output 60 [2018-04-11 10:45:35,266 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:35,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-04-11 10:45:35,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-04-11 10:45:35,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:45:35,441 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-11 10:45:35,448 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:45:35,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-04-11 10:45:35,450 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:35,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-11 10:45:35,451 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:35,456 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:35,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-04-11 10:45:35,458 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:35,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-11 10:45:35,459 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:35,462 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:35,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-04-11 10:45:35,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:35,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-11 10:45:35,465 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:35,471 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:35,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-04-11 10:45:35,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:45:35,475 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-04-11 10:45:35,482 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:45:35,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-04-11 10:45:35,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:45:35,491 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-04-11 10:45:35,499 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:45:35,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-04-11 10:45:35,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:35,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-11 10:45:35,502 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:35,507 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:35,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-04-11 10:45:35,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:45:35,512 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-04-11 10:45:35,528 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:45:35,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:35,651 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:35,653 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 96 treesize of output 78 [2018-04-11 10:45:35,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:35,659 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 1 case distinctions, treesize of input 44 treesize of output 41 [2018-04-11 10:45:35,660 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-04-11 10:45:35,677 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:35,678 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 35 treesize of output 31 [2018-04-11 10:45:35,678 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:45:35,679 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:35,680 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 38 treesize of output 34 [2018-04-11 10:45:35,680 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:45:35,696 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 10:45:35,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-04-11 10:45:35,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:45:35,789 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-04-11 10:45:35,794 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:45:35,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-04-11 10:45:35,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:35,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-11 10:45:35,796 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:35,799 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:35,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 10:45:35,881 INFO L202 ElimStorePlain]: Needed 34 recursive calls to eliminate 9 variables, input treesize:209, output treesize:34 [2018-04-11 10:45:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:45:36,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:45:36,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 32] total 50 [2018-04-11 10:45:36,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-11 10:45:36,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-11 10:45:36,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2294, Unknown=2, NotChecked=0, Total=2450 [2018-04-11 10:45:36,028 INFO L87 Difference]: Start difference. First operand 341 states and 389 transitions. Second operand 50 states. [2018-04-11 10:45:39,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:45:39,579 INFO L93 Difference]: Finished difference Result 349 states and 391 transitions. [2018-04-11 10:45:39,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-11 10:45:39,579 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 81 [2018-04-11 10:45:39,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:45:39,580 INFO L225 Difference]: With dead ends: 349 [2018-04-11 10:45:39,580 INFO L226 Difference]: Without dead ends: 349 [2018-04-11 10:45:39,580 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2901 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=1152, Invalid=9142, Unknown=8, NotChecked=0, Total=10302 [2018-04-11 10:45:39,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-04-11 10:45:39,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 331. [2018-04-11 10:45:39,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-04-11 10:45:39,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 376 transitions. [2018-04-11 10:45:39,582 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 376 transitions. Word has length 81 [2018-04-11 10:45:39,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:45:39,582 INFO L459 AbstractCegarLoop]: Abstraction has 331 states and 376 transitions. [2018-04-11 10:45:39,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-11 10:45:39,582 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 376 transitions. [2018-04-11 10:45:39,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-11 10:45:39,583 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:45:39,583 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, 1, 1, 1, 1, 1, 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 10:45:39,583 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:45:39,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1102486425, now seen corresponding path program 1 times [2018-04-11 10:45:39,583 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:45:39,583 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:45:39,583 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:45:39,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:45:39,583 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:45:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:45:39,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:45:40,460 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:45:40,460 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:45:40,460 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:45:40,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:45:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:45:40,491 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:45:40,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 10:45:40,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:40,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:40,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-04-11 10:45:40,531 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 10:45:40,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 10:45:40,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:40,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:40,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:40,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:25 [2018-04-11 10:45:40,586 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 21 treesize of output 16 [2018-04-11 10:45:40,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:40,588 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 10:45:40,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:40,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:40,596 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 10:45:40,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:25 [2018-04-11 10:45:40,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:40,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 10:45:40,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:40,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:40,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:40,628 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 10:45:40,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:40,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:40,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-04-11 10:45:40,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-11 10:45:40,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10:45:40,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:40,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:40,689 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 10:45:40,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:36 [2018-04-11 10:45:40,718 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 20 [2018-04-11 10:45:40,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:40,725 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 10:45:40,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:44 [2018-04-11 10:45:40,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 59 [2018-04-11 10:45:40,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 39 treesize of output 38 [2018-04-11 10:45:40,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:40,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:40,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 44 [2018-04-11 10:45:40,869 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 10:45:40,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:45:40,913 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 2 xjuncts. [2018-04-11 10:45:40,913 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:62, output treesize:107 [2018-04-11 10:45:40,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:40,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:40,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 69 [2018-04-11 10:45:40,997 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 38 treesize of output 31 [2018-04-11 10:45:40,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:41,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:41,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 62 [2018-04-11 10:45:41,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-11 10:45:41,045 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:41,055 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:41,079 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 2 xjuncts. [2018-04-11 10:45:41,079 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:124, output treesize:98 [2018-04-11 10:45:41,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 86 [2018-04-11 10:45:41,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:41,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:41,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 2 case distinctions, treesize of input 56 treesize of output 75 [2018-04-11 10:45:41,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:45:41,244 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 60 [2018-04-11 10:45:41,244 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:41,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:45:41,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:41,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:41,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:41,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 83 [2018-04-11 10:45:41,332 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 78 [2018-04-11 10:45:41,332 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:45:41,343 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:41,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:45:41,363 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:141, output treesize:134 [2018-04-11 10:45:41,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 93 [2018-04-11 10:45:41,581 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 10:45:41,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:41,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:41,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 91 [2018-04-11 10:45:41,629 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 12 treesize of output 4 [2018-04-11 10:45:41,629 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:41,639 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:41,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 68 [2018-04-11 10:45:41,675 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 10:45:41,675 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:41,682 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:41,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:41,715 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:261, output treesize:236 [2018-04-11 10:45:41,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:41,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 90 [2018-04-11 10:45:41,981 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 83 [2018-04-11 10:45:41,982 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:42,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:42,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 89 [2018-04-11 10:45:42,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 75 [2018-04-11 10:45:42,112 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 10:45:42,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 63 [2018-04-11 10:45:42,158 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:42,208 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:45:42,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:42,287 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 78 treesize of output 68 [2018-04-11 10:45:42,296 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 62 [2018-04-11 10:45:42,297 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:42,320 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 10:45:42,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 14 dim-0 vars, and 8 xjuncts. [2018-04-11 10:45:42,416 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:281, output treesize:590 [2018-04-11 10:45:42,669 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 178 DAG size of output 70 [2018-04-11 10:45:42,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 100 [2018-04-11 10:45:42,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 10:45:42,917 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:42,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 84 [2018-04-11 10:45:42,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:45:42,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-04-11 10:45:42,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:162, output treesize:271 [2018-04-11 10:45:43,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 74 [2018-04-11 10:45:43,114 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:43,114 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:43,114 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 18 treesize of output 31 [2018-04-11 10:45:43,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:43,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:43,230 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:43,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 73 [2018-04-11 10:45:43,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:43,237 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 10:45:43,242 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:43,258 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:43,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 97 [2018-04-11 10:45:43,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:43,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:43,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 31 [2018-04-11 10:45:43,348 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:43,364 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:43,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 80 [2018-04-11 10:45:43,444 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:43,445 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 10:45:43,445 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:43,459 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:43,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-04-11 10:45:43,522 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 14 variables, input treesize:335, output treesize:315 [2018-04-11 10:45:43,930 WARN L148 SmtUtils]: Spent 158ms on a formula simplification that was a NOOP. DAG size: 133 [2018-04-11 10:45:44,182 WARN L148 SmtUtils]: Spent 137ms on a formula simplification that was a NOOP. DAG size: 133 [2018-04-11 10:45:44,403 WARN L148 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 144 [2018-04-11 10:45:44,998 WARN L148 SmtUtils]: Spent 465ms on a formula simplification that was a NOOP. DAG size: 144 [2018-04-11 10:45:45,533 WARN L151 SmtUtils]: Spent 329ms on a formula simplification. DAG size of input: 251 DAG size of output 168 [2018-04-11 10:45:45,850 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 216 DAG size of output 115 [2018-04-11 10:45:45,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 104 [2018-04-11 10:45:45,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 10:45:45,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:45:45,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:45:45,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:46,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 131 [2018-04-11 10:45:46,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 10:45:46,006 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 10:45:46,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:45:46,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:46,172 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:46,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:46,187 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:46,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 101 treesize of output 137 [2018-04-11 10:45:46,236 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 13 case distinctions, treesize of input 121 treesize of output 214 [2018-04-11 10:45:46,236 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-04-11 10:45:46,271 INFO L267 ElimStorePlain]: Start of recursive call 7: 104 dim-0 vars, End of recursive call: 104 dim-0 vars, and 78 xjuncts. [2018-04-11 10:45:47,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 113 [2018-04-11 10:45:47,445 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 10:45:48,002 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 24 dim-0 vars, and 20 xjuncts. [2018-04-11 10:45:48,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 3 dim-2 vars, End of recursive call: 130 dim-0 vars, and 24 xjuncts. [2018-04-11 10:45:48,772 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 23 variables, input treesize:338, output treesize:2484 [2018-04-11 10:45:50,022 WARN L151 SmtUtils]: Spent 249ms on a formula simplification. DAG size of input: 863 DAG size of output 100 [2018-04-11 10:45:50,039 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 96 treesize of output 65 [2018-04-11 10:45:50,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:50,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:50,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-04-11 10:45:50,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:50,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:50,051 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:50,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2018-04-11 10:45:50,051 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:50,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:50,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 94 [2018-04-11 10:45:50,096 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 82 treesize of output 73 [2018-04-11 10:45:50,096 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:50,120 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 53 treesize of output 48 [2018-04-11 10:45:50,120 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:50,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:50,144 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:50,144 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2018-04-11 10:45:50,144 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:50,167 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:50,191 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 110 treesize of output 73 [2018-04-11 10:45:50,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:50,193 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:50,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-04-11 10:45:50,194 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:50,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:45:50,204 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:45:50,204 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2018-04-11 10:45:50,204 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 10:45:50,210 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:50,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:45:50,226 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 14 variables, input treesize:339, output treesize:10 [2018-04-11 10:45:50,365 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:45:50,383 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:45:50,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 34] total 63 [2018-04-11 10:45:50,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-11 10:45:50,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-11 10:45:50,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=3762, Unknown=0, NotChecked=0, Total=4032 [2018-04-11 10:45:50,383 INFO L87 Difference]: Start difference. First operand 331 states and 376 transitions. Second operand 64 states. [2018-04-11 10:45:51,829 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 97 DAG size of output 72 [2018-04-11 10:45:52,758 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 86 DAG size of output 64 [2018-04-11 10:45:54,999 WARN L151 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 104 DAG size of output 97 [2018-04-11 10:45:55,222 WARN L151 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 102 DAG size of output 95 [2018-04-11 10:45:55,525 WARN L151 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 97 DAG size of output 91 [2018-04-11 10:45:55,772 WARN L151 SmtUtils]: Spent 179ms on a formula simplification. DAG size of input: 102 DAG size of output 98 [2018-04-11 10:45:56,065 WARN L151 SmtUtils]: Spent 194ms on a formula simplification. DAG size of input: 117 DAG size of output 107 [2018-04-11 10:45:56,378 WARN L151 SmtUtils]: Spent 223ms on a formula simplification. DAG size of input: 182 DAG size of output 112 [2018-04-11 10:46:00,856 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 176 DAG size of output 101 [2018-04-11 10:46:03,146 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 161 DAG size of output 93 [2018-04-11 10:46:03,394 WARN L151 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 143 DAG size of output 101 [2018-04-11 10:46:04,097 WARN L151 SmtUtils]: Spent 274ms on a formula simplification. DAG size of input: 221 DAG size of output 141 [2018-04-11 10:46:04,599 WARN L151 SmtUtils]: Spent 228ms on a formula simplification. DAG size of input: 192 DAG size of output 138 [2018-04-11 10:46:05,392 WARN L151 SmtUtils]: Spent 468ms on a formula simplification. DAG size of input: 248 DAG size of output 193 [2018-04-11 10:46:05,806 WARN L151 SmtUtils]: Spent 234ms on a formula simplification. DAG size of input: 193 DAG size of output 137 [2018-04-11 10:46:06,550 WARN L151 SmtUtils]: Spent 472ms on a formula simplification. DAG size of input: 294 DAG size of output 210 [2018-04-11 10:46:07,122 WARN L151 SmtUtils]: Spent 382ms on a formula simplification. DAG size of input: 274 DAG size of output 198 [2018-04-11 10:46:07,805 WARN L151 SmtUtils]: Spent 499ms on a formula simplification. DAG size of input: 296 DAG size of output 212 [2018-04-11 10:46:08,250 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 131 DAG size of output 124 [2018-04-11 10:46:08,836 WARN L151 SmtUtils]: Spent 390ms on a formula simplification. DAG size of input: 277 DAG size of output 201 Received shutdown request... [2018-04-11 10:46:08,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-11 10:46:08,871 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 10:46:08,874 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 10:46:08,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 10:46:08 BoogieIcfgContainer [2018-04-11 10:46:08,874 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 10:46:08,875 INFO L168 Benchmark]: Toolchain (without parser) took 184412.58 ms. Allocated memory was 395.3 MB in the beginning and 628.1 MB in the end (delta: 232.8 MB). Free memory was 329.5 MB in the beginning and 448.6 MB in the end (delta: -119.1 MB). Peak memory consumption was 113.7 MB. Max. memory is 5.3 GB. [2018-04-11 10:46:08,876 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 395.3 MB. Free memory is still 354.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 10:46:08,876 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.83 ms. Allocated memory is still 395.3 MB. Free memory was 329.5 MB in the beginning and 303.0 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. [2018-04-11 10:46:08,876 INFO L168 Benchmark]: Boogie Preprocessor took 39.67 ms. Allocated memory is still 395.3 MB. Free memory was 303.0 MB in the beginning and 300.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 10:46:08,876 INFO L168 Benchmark]: RCFGBuilder took 517.79 ms. Allocated memory was 395.3 MB in the beginning and 601.9 MB in the end (delta: 206.6 MB). Free memory was 300.4 MB in the beginning and 518.9 MB in the end (delta: -218.6 MB). Peak memory consumption was 23.7 MB. Max. memory is 5.3 GB. [2018-04-11 10:46:08,876 INFO L168 Benchmark]: TraceAbstraction took 183618.56 ms. Allocated memory was 601.9 MB in the beginning and 628.1 MB in the end (delta: 26.2 MB). Free memory was 518.9 MB in the beginning and 448.6 MB in the end (delta: 70.3 MB). Peak memory consumption was 96.5 MB. Max. memory is 5.3 GB. [2018-04-11 10:46:08,878 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 395.3 MB. Free memory is still 354.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 233.83 ms. Allocated memory is still 395.3 MB. Free memory was 329.5 MB in the beginning and 303.0 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.67 ms. Allocated memory is still 395.3 MB. Free memory was 303.0 MB in the beginning and 300.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 517.79 ms. Allocated memory was 395.3 MB in the beginning and 601.9 MB in the end (delta: 206.6 MB). Free memory was 300.4 MB in the beginning and 518.9 MB in the end (delta: -218.6 MB). Peak memory consumption was 23.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 183618.56 ms. Allocated memory was 601.9 MB in the beginning and 628.1 MB in the end (delta: 26.2 MB). Free memory was 518.9 MB in the beginning and 448.6 MB in the end (delta: 70.3 MB). Peak memory consumption was 96.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 679]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 656]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 683]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 683). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 654]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 655]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 673]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 680]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 683]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 683). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 653]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 684]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 684). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 656]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 679]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 628]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 662]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 662]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 654]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 653]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 656]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 654]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 655]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 684]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 684). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 656]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 680]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 654]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 673]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was constructing difference of abstraction (331states) and interpolant automaton (currently 47 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 108 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 59 error locations. TIMEOUT Result, 183.5s OverallTime, 44 OverallIterations, 3 TraceHistogramMax, 96.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4475 SDtfs, 22154 SDslu, 33605 SDs, 0 SdLazy, 42488 SolverSat, 3312 SolverUnsat, 112 SolverUnknown, 0 SolverNotchecked, 49.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3079 GetRequests, 1228 SyntacticMatches, 133 SemanticMatches, 1717 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 33423 ImplicationChecksByTransitivity, 88.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=424occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 43 MinimizatonAttempts, 2314 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 84.7s InterpolantComputationTime, 3885 NumberOfCodeBlocks, 3885 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 3818 ConstructedInterpolants, 464 QuantifiedInterpolants, 9426039 SizeOfPredicates, 438 NumberOfNonLiveVariables, 6303 ConjunctsInSsa, 1213 ConjunctsInUnsatCore, 67 InterpolantComputations, 23 PerfectInterpolantSequences, 795/1130 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0513_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_10-46-08-885.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0513_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_10-46-08-885.csv Completed graceful shutdown